论文信息 - A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices - 字舞流文

A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices

J. Cullum | R. Willoughby

[1] C. T. Fike,et al. Norms and exclusion theorems , 1960 .

[2] C. Reinsch,et al. Balancing a matrix for calculation of eigenvalues and eigenvectors , 1969 .

[3] J. Bunch,et al. Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[4] C. Paige. Computational variants of the Lanczos method for the eigenproblem , 1972 .

[5] C. Paige. Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix , 1976 .

[6] G W Stewart,et al. SRRIT - A FORTRAN Subroutine to Calculate the Dominant Invariant Subspaces of a Real Matrix. , 1978 .

[7] B. Parlett,et al. The Lanczos algorithm with selective orthogonalization , 1979 .

[8] Y. Saad. Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices , 1980 .

[9] William J. Stewart,et al. A Simultaneous Iteration Algorithm for Real Matrices , 1981, TOMS.

[10] W. Kahan,et al. Residual Bounds on Approximate Eigensystems of Nonnormal Matrices , 1982 .

[11] Jane Cullum,et al. A Lanczos procedure for the modal analysis of very large nonsymmetric matrices , 1984, The 23rd IEEE Conference on Decision and Control.

[12] Zhishun A. Liu,et al. A Look Ahead Lanczos Algorithm for Unsymmetric Matrices , 1985 .