A Block–Stodola eigensolution technique for large algebraic systems with non‐symmetrical matrices
Stanley B. Dong · International Journal for Numerical Methods in Engineering · 1977
Abstract A Block–Stodola eigensolution method is presented for large algebraic eigensystems of the form AU = λBU where A is real but non‐symmetric. The steps in this method parallel those of a previous technique for the case when both A and B were real and symmetric. The essence of the technique is simultaneous iteration using a group of trial vectors instead of only one vector as is the case in the classical Stodola–Vianello iteration method. The problem is then transformed into a subspace where a direct solution of the reduced algebraic eigenvalue problem is sought. The main advantage is the significant reduction of computational effort in extracting a subset of eigenvalues and corresponding eigenvectors. Theorems from linear algebra serve to underlie the basis of the present technique. Complex eigendata that emerge during iteration can be handled without doubling the size of the problem. Higher order eigenvalue problems are reducible to first order form for which this technique is applicable. The treatment of the quadratic eigenvalue problem illustrates the details of this extension.