Thick-restart Lanczos method for symmetric eigenvalue problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1457 LNCS, Issue , 1998, Pages 43-55

  Wu, Kesheng ^a   Simon, Horst D ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION OPERATION; EIGENVALUE PROBLEM; LANCZOS ALGORITHM; LANCZOS METHODS; MATRIX VECTOR MULTIPLICATION; SPARSE MATRICES; SYMMETRIC EIGENVALUE PROBLEMS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 22044439737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0018526     Document Type: Conference Paper

References (23)

1. W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quarterly of Applied Mathematics, 9:17-29, 1951.
2. J. Baglama, D. Calvetti, and L. Reichel. Iterative methods for the computation of a few eigenvalues of a large symmetric matrix. BIT, 36:400-421, 1996. (Pubitemid 126419078)
3. S. Balay, W. Gropp, L. C. McInnes, and B. Smith. PETSc 2.0 users manual. Technical Report ANL-95/11, Mathematics and Computer Science Division, Argonne National Laboratory, 1995. Latest source code available at URL http://www.mcs.anl.gov/petsc.
4. A. Chapman and Y. Saad. Deflated and augmented Krylov subspace techniques. Technical Report UMSI 95/181, Minnesota Supercomputing Institute, University of Minnesota, 1995.
5. M. Crouzeix, B. Philippe, and M. Sadkane. The Davidson method. SIAM J. Sci. Comput., 15:62-76, 1994.
6. Ernest R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comput. Phys., 17:87-94, 1975.
7. Ernest R. Davidson. Super-matrix methods. Computer Physics Communications, 53:49-60, 1989.
8. G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD 21211, third edition, 1996.
9. S. A. Hutchinson, J. N. Shadid, and R. S. Tuminaro. AZTEC user's guide. Technical Report SAND95-1559, Massively parallel computing research laboratory, Sandia National Laboratories, Albuquerque, NM, 1995.
10. M. T. Jones and P. E. Plassmann. Bloeksolve95 users manual: scalable library software for parallel solution of sparse linear systems. Technical Report ANL-95/48, Mathematics and Computer Science Division, Argonne national laboratory, Argonne, IL, 1995.
11. Richard B. Lehoucq. Analysis and implementation of an implicitly restarted Arnoldi iteration. PhD thesis, Rice University, 1995.
12. Ronald B. Morgan. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Mathematics of Computation, 65(215):1213-1230, July 1996.
13. Beresford N. Parlett. The symmetric eigenvalue problem. Prentice-Hall, Eaglewood Cliffs, NJ, 1980.
14. Y. Saad. Analysis of augmented Krylov subspace techniques. Technical Report UMSI 95/175, Minnesota Supercomputing Institute, University of Minnesota, 1995.
15. Yusef Saad. Numerical Methods for Large Eigenvalue Problems. Manchester University Press, 1993.
16. Yousef Saad. Iterative Methods for Sparse Linear Systems. PWS publishing, Boston, MA, 1996.
17. Miloud Sdkane. A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Numer. Math., 64(2):181-193, 1993.
18. D. Sorensen, R. Lehoucq, P. Vu, and C. Yang. ARPACh': an implementation of the Implicitly Restarted Arnoldi iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix, 1995.
19. D. S. Sorensen. Implicit application of polynomial filters in a K-step Arnoldi method. SIAM J. Matrix Anal. Appl., 13(1):357-385, 1992.
20. A. Stathopoulos, Y. Saad, and K. Wu. Thick restarting of the Davidson method: an extension to implicit restarting. In T. Manteuffel, S. McCormick, L. Adams, S. Ashby, H. Elman, R. Freund, A. Greenbaum, S. Patter, P. Saylor, N. Trefethen, H. van der Vorst, H. Walker, and O. Wildlund, editors, Proceedings of Copper Mountain Conference on Iterative Methods, Copper Mountain, Colorado, 1996.
21. A. Stathopoulos, Y. Saad, and K. Wu. Dynamic thick restarting of the Davidson and the implicitly restarted Arnoldi methods. SIAM J. Sci. Comput., 19(1):227-245, 1998. (Pubitemid 128617509)
22. Kesheng Wu. Preconditioned Techniques for Large Eigenvalue Problems. PhD thesis, University of Minnesota, 1997. An updated version also appears as Technical Report TR97-038 at the Computer Science Department.
23. Kesheng Wu and Horst Simon. Thick-restart Lanczos method for symmetric eigenvalue problems. Technical Report 41412, Lawrence Berkeley National Laboratory, 1998.