Inexact inverse iteration for generalized eigenvalue problems

BIT Numerical Mathematics

Volumn 40, Issue 4, 2000, Pages 671-684

  Golub, Gene H ^a   Ye, Qiang ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Inner outer iterations; Inverse iteration; Shift and invert

Indexed keywords

EID: 0041730764     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022388317839     Document Type: Article

References (19)

1. W. E. Arnoldi, The principle of minimized iterations in the solutions of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. M. Crouzeix, B. Philippe, and M. Sadkane, The Davidson method, SIAM J. Sci. Stat. Comput., 15 (1994), pp. 62-76.
3. I. S. Duff, R. G. Grimes, and J. G. Lewis, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
4. G. H. Golub and C. F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.
5. G. H. Golub, Z. Zhang, and H. Zha, Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations, Linear Algebra Appl., 309 (2000), pp. 289-306.
6. Y. Lai, K. Lin, and W. Lin, An inexact inverse iteration for large sparse eigenvalue problems, Numer. Linear Algebra Appl., 4 (1997), pp. 425-437.
7. C. Lanczos, An iteration method for the solutions of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand., 45 (1950), pp. 255-282.
8. R. Lehoucq and K. Meerbergen, Using generalized Cayley transformations within an inexact rational Krylov sequence method, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 131-148.
9. K. Meerbergen and D. Roose, The restarted Arnoldi method applied to iterative linear solvers for the computation of rightmost eigenvalues, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1-20.
10. R. Morgan and D. Scott, Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems, SIAM J. Sci. Stat. Comput. 14 (1993), pp. 585-593.
11. A. Ruhe, Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Stat. Comput., 19 (1998), pp. 1535-1551.
12. A. Ruhe and T. Wiberg, The method of conjugate gradients used in inverse iteration, BIT, 12 (1972), pp. 543-554.
13. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
14. Y. Saad, and M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869.
15. G. Sleijpen and H. Van der Vorst, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
16. P. Smit and M. Paardekooper, The effects of inexact solvers in algorithms for symmetric eigenvalue problems, Linear Algebra Appl., 287 (1999), pp. 337-357.
17. D. Sorensen and C. Yang, A truncated RQ iteration for large scale eigenvalue calculations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 1045-1073.
18. A. Stathopoulos, Y. Saad, and C. Fisher, Robust preconditioning of large sparse symmetric eigenvalue problems, J. Comp. Appl. Math., 64 (1995), pp. 197-215.
19. G. W. Stewart, Simultaneous iterations for computing invariant subspaces of non-Hermitian matrices, Numer. Math., 25 (1976), pp. 123-136.