Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration

DOI10.1137/S0036142902411768zbMath1078.65538MaRDI QIDQ4443589

Evgueni E. Ovtchinnikov

Publication date: 18 January 2004

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

zbMATH Keywords

linear systemsconvergence accelerationpreconditioningiterative methodsKrylov subspacessteepest descent methodsymmetric eigenvalue problemsgeneralized Davidson method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues ⋮ A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems ⋮ Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems ⋮ A block Chebyshev-Davidson method for linear response eigenvalue problems ⋮ The Jacobi-Davidson method ⋮ On preconditioned eigensolvers and invert-Lanczos processes ⋮ Mesh independence of the generalized Davidson algorithm