Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods

SIAM Journal on Scientific Computing

Volumn 19, Issue 1, 1998, Pages 227-245

  Stathopoulos, Andreas ^a   Saad, Yousef ^a   Wu, Kesheng ^a  

^a 4 192 EE/CSci Bldg ^*  (United States)

Author keywords

Arnoldi method; Davidson method; Deflation; Eigenvalue; Implicit restarting; Lanczos method; Preconditioning

Indexed keywords

EID: 0346555718     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596304162     Document Type: Article

References (29)

1. Z. BAI, D. DAY, J. DEMMEL, AND J. DONGARRA, A Test Matrix Collection for Non-Hermitian Eigenvalue Problems, Tech. report, Department of Mathematics, University of Kentucky, Lexington, KY, 1996.
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. report 95-181, Supercomputing Institute, University of Minnesota, Minneapolis, MN, 1995.
4. E. CHOW AND Y. SAAD, Approximate inverse preconditioners via sparse-sparse iteration, SIAM J. Sci. Comput., to appear.
5. P. CONCUS, G. H. GOLUB, AND D. P. O'LEARY, A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations, Academic Press, New York, 1976.
6. M. CROUZEIX, B. PHILIPPE, AND M. SADKANE, The Davidson method, SIAM J. Sci. Comput., 15 (1994), pp. 62-76.
7. J. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 2, Programs of Progr. Sci. Comput. 4, Birkhäuser Boston, Boston, MA, 1985.
8. 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.
9. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, (1989), pp. 1-14.
10. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson Style QR and QZ Algorithms for the Partial Reduction of Matrix Pencils, Tech. report 941, Department of Mathematics, University of Utrecht, the Netherlands, 1996; SIAM J. Sci. Comput., to appear.
11. N. KOSUGI, Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix, J. Comput. Phys., 55 (1984), pp. 426-436.
12. R. B. LEHOUCQ, Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, Ph.D. thesis, TR95-13, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1995.
13. R. B. LEHOUCQ, D. C. SORENSEN, AND P. VU, An Implementation of the Implicitly Restarted Arnoldi Iteration that Computes Some of the Eigenvalues and Eigenvectors of a Large Sparse Matrix, Tech. report, University of Tennessee, Knoxville, TN, Netlib, 1995.
14. R. B. MORGAN, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1154-1171.
15. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comput., 65 (1996), pp. 1213-1230.
16. R. B. MORGAN AND D. S. SCOTT, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Comput., 7 (1986), pp. 817-825.
17. C. W. MURRAY, S. C. RACINE, AND E. R. DAVIDSON, Improved algorithms for the lowest eigenvalues and associated eigenvectors of large matrices, J. Comput. Phys., 103 (1992), pp. 382-389.
18. Y. SAAD, Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems, Math. Comp., 42 (1984), pp. 567-588.
19. V. SAAD, Numerical Methods for Large Eigenvalue Problems, Halstead Press, New York, 1992.
20. Y. SAAD, Analysis of Augmented Krylov Subspace Methods, Tech. report 95-176, Supercomputing Institute, University of Minnesota, Minneapolis, MN, 1995.
21. M. SADKANE, Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math., 64 (1993), pp. 195-211.
22. D. S. SCOTT, The advantages of inverted operators in Rayleigh-Ritz approximations, SIAM J. Sci. and Statist. Comput., 3 (1982), pp. 68-75.
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. C. 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 AND C. FISCHER, A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix, Comput. Phys. Comm., 79 (1994), pp. 268-290.
26. A. STATHOPOULOS, Y. SAAD, AND C. FISCHER, Robust preconditioning of large, sparse, symmetric eigenvalue problems, J. Comput. Appl. Math., 64 (1995), pp. 197-215.
27. A. VAN DER SLUIS AND H. A. VAN DER VORST, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543-560.
28. H. A. VAN DER VORST AND C. VUIK, The superlinear convergence behavior of GMRES, J. Comput. Appl. Math., 48 (1993), pp. 327-341.
29. J. VAN LENTHE AND P. PULAY, A space-saving modification of Davidson's eigenvector algorithm, J. Comput. Chem., 11 (1990), pp. 1164-1168.