Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method

SIAM Journal on Scientific Computing

Volumn 23, Issue 2, 2002, Pages 517-541

  Knyazev, Andrew V ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Conjugate gradient methods; Preconditioning; Symmetric eigenvalue problems; The Lanczos method

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; LINEAR EQUATIONS; OPTIMIZATION; VECTORS;

PRECONDITIONED EIGENSOLVER;

GRADIENT METHODS;

EID: 0036223489     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827500366124     Document Type: Conference Paper

References (44)

1. Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem
2. A parallel Davidson-type algorithm for several eigenvalues
3. New iterative methods for solution of the eigenproblem
4. A subspace preconditioning algorithm for eigenvector/eigenvalue computation
5. Matrix eigenvector methods
6. An efficient method for band structure calculations in 2D photonic crystals
7. An efficient method for band structure calculations in 3D photonic crystals
8. Group iterative method for finding lower-order eigen-values
9. On an iterative method for finding lower eigenvalues
10. The geometry of algorithms with orthogonality constraints
11. Curvature in conjugate gradient eigenvalue computation with applications to materials and chemistry calculations
12. Conjugate gradient methods for solving the smallest eigenpair of large symmetric eigenvalue problems
13. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils
14. An orthogonal accelerated deflation technique for large symmetric eigenproblems
15. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
16. Convergence rate estimates for iterative methods for mesh symmetric eigen-value problem
17. A preconditioned conjugate gradient method for eigenvalue problems and its implementation in a subspace
18. New estimates for Ritz vectors
19. Preconditioned eigensolvers - An oxymoron?
20. Preconditioned eigensolvers: Practical algorithms
21. Preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problems
22. Homotopy method for the large, sparse, real nonsymmetric eigenvalue problem
23. Modern algorithms for large sparse eigenvalue problems
24. Davidson's method and preconditioning for generalized eigenvalue problems
25. A geometric theory for preconditioned inverse iteration applied to a subspace
26. A geometric theory for preconditioned inverse iteration. I: Extrema of the Rayleigh quotient
27. A geometric theory for preconditioned inverse iteration. II: Sharp convergence estimates
28. Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem
29. Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures: A paradigm in three dimensions
30. Successive eigenvalue relaxation: A new method for generalized eigenvalue problems and convergence estimates
31. Unconstrained energy functionals for electronic structure calculations
32. Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils
33. The effects of inexact solvers in algorithms for symmetric eigenvalue problems
34. Conjugate gradient like methods and their application to eigen-value problems for neutron diffusion equation
35. Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
36. Subspace iterative methods for eigenvalue problems
37. On the homotopy method for perturbed symmetric generalized eigenvalue problems