Jacobi correction equation, line search, and conjugate gradients in Hermitian eigenvalue computation I: Computing an extreme eigenvalue

SIAM Journal on Numerical Analysis

Volumn 46, Issue 5, 2008, Pages 2567-2592

  Ovtchinnikov, E E ^a  

^a UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

Conjugate gradients; Convergence estimates; Generalized davidson method; Hermitian eigenvalue computation; Jacobi orthogonal complement correction equation

Indexed keywords

ASYMPTOTIC ANALYSIS; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATHEMATICAL OPERATORS;

CONJUGATE GRADIENTS; CONVERGENCE ESTIMATES; GENERALIZED DAVIDSON METHOD; HERMITIAN EIGENVALUE COMPUTATION; JACOBI ORTHOGONAL COMPLEMENT CORRECTION EQUATION;

CONJUGATE GRADIENT METHOD;

EID: 55349100568     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/070688742     Document Type: Article

References (30)

1. P.-A. ABSIL, C. G. BAKER, AND K. A. GALLIVAN, A truncated-CG style, method for symmetric generalized eigenvalue problems, J. Comput. Appl. Math., 189 (2006), pp. 274-285.
2. W. W. BRADBURY AND R. FLETCHER, New iterative methods for solution of the eigenproblem, Numer. Math., 9 (1966), pp. 259-267.
3. J. W. DANIEL, The conjugate gradient method for linear and nonlinear operators equations, SIAM J. Numer. Anal., 4 (1967), pp. 10-26.
4. A. EDELMAN, T. A. ARIAS, AND S. T. SMITH, The geometry of algorithms with orthogonality constraints, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 303-353.
5. Y. T. FENG AND D. R. OWEN, Conjugate gradient methods for solving the smallest eigenpair of large symmetric eigenvalue problems, Internat. J. Numer. Methods Engrg., 39 (1996), pp. 2209-2229.
6. R. FLETCHER AND C. M. REEVES, Function minimization by conjugate gradients, Comput. J., 7 (1964), pp. 149-154.
7. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards, 49 (1952), pp. 409-436.
8. A. V. KNYAZEV, Computation of Eigenvalues and Eigenvectors for Mesh Problems: Algorithms and Error Estimates, Department of Numerical Mathematics, USSR Academy of Sciences, Moscow, 1986 (in Russian).
9. 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.
10. A. V. KNYAZEV, A preconditioned conjugate gradient method for eigenvalue problems and its implementation in a subspace, Internat. Ser. Numer. Math., 96 (1991), pp. 143-154.
11. A. V. KNYAZEV, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
12. 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.
13. K. NEYMEYR, A geometric theory for preconditioned inverse iteration, Linear Algebra Appl., 322 (2001), pp. 61-104.
14. Y. NOTAY, Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 9 (2002), pp. 21-44.
15. Y. NOTAY, Convergence analysis of inexact Rayleigh quotient iteration, SIAM J. Matrix. Anal. Appl., 24 (2003), pp. 627-644
16. 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.
17. E. OVTCHINNIKOV, Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems II: The subspace acceleration, SIAM J. Numer. Anal., 41 (2003), pp. 272-286.
18. E. E. OVTCHINNIKOV, Sharp convergence estimates for the preconditioned steepest descent method for Hermitian eigenvalue problems, SIAM. J. Numer. Anal., 43 (2006), pp. 2668-2689.
19. E. E. OVTCHINNIKOV, Jacobi correction equation, line search, and conjugate gradients in Hermitian eigenvalue computation II: Computing several extreme eigenvalues, SIAM J. Numer. Anal., 46 (2008), pp. 2593-2619.
20. A. PERDON AND G. GAMHOLATI, Extreme eigenvalues of large sparse matrices by Rayteigh quotient and modified conjugate gradients, Comput. Methods Appl. Mech. Engrg., 56 (1986), pp. 251-264.
21. E. POLAR, Computational Methods in Optimization: A Unified Approach, Academic Press, New York, London, 1971.
22. D. T. POLYAK, The conjugate gradient method in extremal problems, USSR Comput. Math. Math. Phys., 9 (1969), pp. 94-112.
23. B. T. POLYAK, Introduction to Optimization, Optimization Software, New York, 1987.
24. A. SAMEH AND Z. TONG, The trace minimization method for the symmetric generalized eigenvalue problem, J. Comput. Appl. Math., 123 (2000), pp. 155-175.
25. B. A. SAMOKISH, The steepest descent method for an eigenvalue problem with semi-bounded operators, Izv. Vyssh. Uchcbn. Zaved. Mat., 5 (1958), pp. 105-114 (in Russian).
26. V. SIMONCHINI AND L. ELDÉN, Inexact Rayleigh quotient-type methods for eigenvalue computations, BIT, 42 (2002), pp. 159-182.
27. 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.
28. I. TAKAHASHI, A note on the conjugate gradient method, Inform. Process. Japan, 5 (1965), pp. 45-49.
29. X. YANG, T. K. SARKAR., AND E. ARVAS, A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix, IEEE Trans. Acoust. Speech Signal Process., 37 (1989), pp. 1550-1556.
30. Y. ZHOU, Studies on Jacobi-Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates, Numer. Linear Algebra Appl., 13 (2006), pp. 621-642.