Convergence theory for preconditioned eigenvalue solvers in a nutshell

DOI10.1007/s10208-015-9297-1zbMath1370.65018arXiv1412.5005OpenAlexW3101845474WikidataQ59695730 ScholiaQ59695730MaRDI QIDQ2362287

Merico E. Argentati, Evgueni E. Ovtchinnikov, Ming Zhou, Klaus Neymeyr, Andrew V. Knyazev

Publication date: 7 July 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.5005

zbMATH Keywords

rate of convergenceeigenvalueeigenvectoriterative methodRayleigh quotientgradientpreconditionersymmetricKarush-Kuhn-Tucker theory

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)

Related Items

Hybrid eigensolvers for nuclear configuration interaction calculations, A mixed precision LOBPCG algorithm, Sharp Ritz value estimates for restarted Krylov subspace iterations, Cluster robust estimates for block gradient-type eigensolvers

Uses Software

• JDQR
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
• An indefinite variant of LOBPCG for definite matrix pencils
• Preconditioning eigensolvers -- an Oxymoron?
• Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
• A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
• Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems
• Convergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem
• Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues
• Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers
• Templates for the Solution of Algebraic Eigenvalue Problems
• A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
• Graph Partitioning Using Matrix Values for Preconditioning Symmetric Positive Definite Systems
• Sharp Convergence Estimates for the Preconditioned Steepest Descent Method for Hermitian Eigenvalue Problems
• Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues