Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems II: The subspace acceleration

SIAM Journal on Numerical Analysis

Volumn 41, Issue 1, 2003, Pages 272-286

  Ovtchinnikov, E ^a  

^a UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

Convergence estimates; Generalized Davidson method; Iterative methods for eigenvalue problems; Krylov subspaces; Preconditioning

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ESTIMATION; GEOMETRY; ITERATIVE METHODS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

CONVERGENCE ESTIMATES; GENERALIZED DAVIDSON METHOD; RAYLEIGH QUOTIENT; SUBSPACE ACCELERATION; SYMMETRIC EIGENVALUE PROBLEMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 1842615910     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142902411768     Document Type: Article

References (19)

1. Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. Van Der Vorst, eds., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Software Environ. Tools 11, SIAM, Philadelphia, 2000.
2. M. Crouzeix, B. Philippe, and M. Sadkane, The Davidson method, SIAM J. Sci. Comput., 15 (1994), pp. 62-76.
3. E. R. Davidson, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices, J. Computational Phys., 17 (1975), pp. 87-94.
4. G. H. Golub and R. S. Varga, Chebyshev semi-iterative methods, successive overrelaxation iterative methods and second order Richardson iterative methods, Numer. Math., 3 (1961), pp. 147-168.
5. A. V. Knyazev, Convergence rate estimates for iterative methods for a mesh symmetric eigenvalue problem, Soviet J. Numer. Anal. Math. Modelling, 2 (1987), pp. 371-396.
6. A. V. Knyazev, A Preconditioned Conjugate Gradient Method for Eigenvalue Problems and Its Implementation in a Subspace, Internat. Ser. Numer. Math. 96, Birkhäuser, Basel, 1991, pp. 143-154.
7. A. V. Knyazev, Preconditioned eigensolvers - an oxymoron?, Electron. Trans. Numer. Anal., 7 (1998), pp. 104-123.
8. A. V. Knyazev, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
9. A. V. Knyazev and K. Neymeyr, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, Linear Algebra Appl., 358 (2003), pp. 95-114.
10. Y. Notay, Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 9 (2002), pp. 21-44.
11. S. Oliveira, On the convergence rate of a preconditioned subspace eigensolver, Computing, 63 (1999), pp. 219-231.
12. E. Ovtchinnikov, Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems, Technical report, University of Westminster, London, UK, 2001.
13. E. Ovtchinnikov, Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems I: The preconditioning aspect, SIAM J. Numer. Anal., 41 (2003), pp. 258-271.
14. E. Ovtchinnikov, Generalized Davidson Versus Conjugate Gradient Methods: A Numerical Study, manuscript, 2002.
15. E. Ovtchinnikov, Convergence Estimates for Preconditioned Gradient Subspace Iteration Eigensolvers, Technical report 1244, University of Utrecht, Utrecht, the Netherlands, June 2002.
16. B. N. Parlett, The Rayleigh quotient iteration and some generalizations, Math. Comp., 28 (1974), pp. 679-693.
17. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Algorithms Archit. Adv. Sci. Comput., Manchester University Press, Manchester, UK, Halsted Press, New York, 1992.
18. B. Samokish, The steepest descent method for an eigenvalue problem with semi-bounded operators, Izv. Vyssh. Uchebn. Zaved. Mat., 5 (1958), pp. 105-114.
19. 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.