Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices

Linear Algebra and Its Applications

Volumn 34, Issue C, 1980, Pages 269-295

  Saad, Y ^a  

^a IMAG CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 49149143501     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(80)90169-X     Document Type: Article

References (20)

1. The principle of minimized iterations in the solution of the matrix eigenvalue problem
2. Accelerated projection methods for computing pseudo inverse solutions of systems of linear equations
3. Reothogonalization and stable algorithms for updating the Gram-Schmidt QR factorization
4. The block Lanczos method for computing eigenvalues
5. Simultaneous iteration for partial eigensolution of real matrices
6. Estimates for some computational techniques in linear algebra
7. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
8. Algorithms for sparse matrix eigenvalue problems
9. The computation of eigenvalues and eigenvectors of very large sparse matrices
10. Bidiagonalization of matrices and solution of linear equations
11. Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse matrices
12. Calcul de valeurs propres de grandes matrices hermitiennes par des techniques de partitionnement
13. Etude de la convergence du procédé d'Arnoldi pour le calcul d'éléments propres de grandes matrices non symetriques