Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
From MaRDI portal
Publication:4443588
DOI10.1137/S0036142902411756zbMath1078.65537MaRDI QIDQ4443588
Publication date: 18 January 2004
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
preconditioningiterative methodsJacobi-Davidson methodsuperlinear convergencesteepest descent methodsymmetric eigenvalue problemsgeneralized Davidson method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Cluster robustness of preconditioned gradient subspace iteration eigensolvers ⋮ 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 convergence of iterative projection methods for symmetric eigenvalue problems ⋮ On preconditioned eigensolvers and invert-Lanczos processes
Uses Software