On the convergence rate of a preconditioned subspace eigensolver

DOI10.1007/s006070050032zbMath0944.65039OpenAlexW2046249517MaRDI QIDQ1969306

Yanyan Li

Publication date: 13 September 2000

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s006070050032

zbMATH Keywords

convergencecondition numberpreconditionereigenvalue problemssubspace methodDavidson type algorithmmultigrid preconditioned conjugate gradient algorithm

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Cluster robustness of preconditioned gradient subspace iteration eigensolvers ⋮ A block Chebyshev-Davidson method for linear response eigenvalue problems ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ Mesh independence of the generalized Davidson algorithm ⋮ A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems