Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers

DOI10.1137/23M1551729arXiv2201.04517OpenAlexW4389340281MaRDI QIDQ6183454

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

Publication date: 4 January 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Ritz valuesmajorizationprincipal anglesblock Lanczos methodcluster robustnesssubspace eigensolvers

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of the block Lanczos method for eigenvalue clusters
• Sharp Ritz value estimates for restarted Krylov subspace iterations
• Computing leaky modes of optical fibers using a FEAST algorithm for polynomial eigenproblems
• Cluster robustness of preconditioned gradient subspace iteration eigensolvers
• Computational aspects of F. L. Bauer's simultaneous iteration method
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• Numerical Methods for Large Eigenvalue Problems
• Convergence Analysis of Restarted Krylov Subspace Eigensolvers
• Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
• Rayleigh–Ritz Majorization Error Bounds with Applications to FEM
• Sharpness in rates of convergence for the symmetric Lanczos method
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• New estimates for Ritz vectors
• Convergence estimates of nonrestarted and restarted block‐Lanczos methods
• Absolute Variation of Ritz Values, Principal Angles, and Spectral Spread
• Majorization Bounds for Ritz Values of Self-Adjoint Matrices
• Cluster robust estimates for block gradient-type eigensolvers
• Spectral discretization errors in filtered subspace iteration
• Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
• Angles between subspaces and their tangents
• Inequalities: theory of majorization and its applications

This page was built for publication: Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers