Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers

DOI10.1553/etna_vol58s597arXiv2206.00585OpenAlexW4389351581MaRDI QIDQ6146165

Ming Zhou, Klaus Neymeyr

Publication date: 5 February 2024

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

Ritz valuescluster robustnesspreconditioned subspace eigensolvers

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An indefinite variant of LOBPCG for definite matrix pencils
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• Group iterative method for finding low-order eigenvalues
• 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
• Cluster robustness of preconditioned gradient subspace iteration eigensolvers
• The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
• A geometric theory for preconditioned inverse iteration applied to a subspace
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• Convergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem
• Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
• Templates for the Solution of Algebraic Eigenvalue Problems
• Convergence estimates of nonrestarted and restarted block‐Lanczos methods
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
• A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
• Cluster robust estimates for block gradient-type eigensolvers
• Convergence Analysis of a Locally Accelerated Preconditioned Steepest Descent Method for Hermitian-Definite Generalized Eigenvalue Problems
• Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
• Sharp Convergence Estimates for the Preconditioned Steepest Descent Method for Hermitian Eigenvalue Problems

This page was built for publication: Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers