Thick-restart Lanczos method for large symmetric eigenvalue problems

SIAM Journal on Matrix Analysis and Applications

Volumn 22, Issue 2, 2001, Pages 602-616

  Wu, Kesheng ^a   Simon, Horst ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Lanczos eigenvalue method; Partial reorthogonalization; Thick restart

Indexed keywords

EID: 0006377434     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479898334605     Document Type: Article

References (29)

1. W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. D. CALVETTI, L. REICHEL, AND D. SORENSEN, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal., 2 (1994), pp. 1-21.
3. A. CHAPMAN AND Y. SAAD, Deflated and Augmented Krylov Subspace Techniques, Tech. Rep. UMSI 95/181, Minnesota Supercomputing Institute, University of Minnesota, Minneapolis, MN, 1995.
4. J. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Theory, Progress in Scientific Computing 3, Birkhäuser Boston, Boston, MA, 1985.
5. J. W. DANIEL, W. B. GRAGG, L. KAUFMAN, AND G. W. STEWART, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
6. E. R. DAVIDSON, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices, J. Comput. Phys., 17 (1975), pp. 87-94.
7. E. R. DAVIDSON, Super-matrix methods, Comput. Phys. Comm., 53 (1989), pp. 49-60.
8. G. DE SAMBLANX, Filtering And Restarting Projection Methods for Eigenvalue Problems, Ph.D. thesis, Katholieke Universiteit Leuven, Heverlee, Belgium, 1998.
9. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
10. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1999), pp. 94-125.
11. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
12. R. B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, ARPACK User's Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, PA, 1998. ARPACK Software is available at http://www.caam.rice.edu/software/ ARPACK/.
13. R. B. LEHOUCQ AND D. SORENSEN, Deflation techniques for an implicitly restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 789-821.
14. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 156 (1991), pp. 289-309.
15. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp., 65 (1996), pp. 1213-1230.
16. B. N. PARLETT, The Symmetric Eigenvalue Problem, Classics Appl. Math. 20, SIAM, Philadelphia, PA, 1998.
17. B. N. PARLETT AND D. SCOTT, The Lanczos algorithm with selective orthogonalization, Math. Comp., 33 (1979), pp. 217-238.
18. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1993.
19. Y. SAAD, Analysis of Augmented Krylov Subspace Techniques, Tech. Rep. UMSI 95/175, Minnesota Supercomputing Institute, University of Minnesota, Minneapolis, MN, 1995.
20. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, MA, 1996.
21. H. D. SIMON, The Lanczos Algorithm for Solving Symmetric Linear Systems, Ph.D. thesis, University of California, Berkeley, CA, 1982.
22. H. D. SIMON, The Lanczos algorithm with partial reorthogonalization, Math. Comp., 42 (1984), pp. 115-136.
23. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
24. D. S. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
25. A. STATHOPOULOS, Y. SAAD, AND K. WU, Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods, SIAM J. Sci. Comput., 19 (1998), pp. 227-245.
26. L.-W. WANG AND A. ZUNGER, Large scale electronic structure calculations using the Lanczos method, Computational Materials Science, 2 (1994), pp. 326-340.
27. K. WU, Preconditioned Techniques for Large Eigenvalue Problems, Ph.D. thesis, University of Minnesota, Minneapolis, MN, 1997. An updated version also appears as Tech. Rep. TR97-038 at the Computer Science Department, University of Minnesota, Minneapolis, MN.
28. K. WU AND H. SIMON, Thick-Restart Lanczos Method for Symmetric Eigenvalue Problems, Tech. Rep. 41412, Lawrence Berkeley National Laboratory, Berkeley, CA, 1998.
29. K. WU AND H. D. SIMON, Dynamic Restarting Schemes for Eigenvalue Problems, Tech. Rep. LBNL-42982, Lawrence Berkeley National Laboratory, Berkeley, CA, 1999.