论文信息 - On the sparse matrix computation of critical frequencies - 字舞流文

On the sparse matrix computation of critical frequencies

An algorithm for finding the eigenvalues of the generalized eigenvalue problem Ax = {\lambda}Bx for sparse A and B matrices is discussed. Its performance is compared to that of the QZ algorithm for some test matrices.

C. Pottle | C. Pottle | Yue Wong | Y. Wong

[1] J. G. F. Francis,et al. The QR Transformation - Part 2 , 1962, Comput. J..

[2] I. Kaufman,et al. On poles and zeros of linear systems , 1973 .

[3] D. Calahan,et al. Eigenvalue Methods for Sparse Matrices , 1972 .

[4] G. Stewart,et al. An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .

[5] J. W. Walker,et al. Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .

[6] J. G. F. Francis,et al. The QR Transformation A Unitary Analogue to the LR Transformation - Part 1 , 1961, Comput. J..

[7] Fred G. Gustavson,et al. Some Basic Techniques for Solving Sparse Systems of Linear Equations , 1972 .

[8] Hsueh-Yi Hsieh,et al. A probabilistic approach to optimal pivoting and prediction of fill-in for random sparse matrices , 1972 .

[9] D. E. Muller. A method for solving algebraic equations using an automatic computer , 1956 .

[10] D. Rose. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[11] R. Berry,et al. An Optimal Ordering of Electronic Circuit Equations for a Sparse Matrix Solution , 1971 .