Convergence of the block Lanczos method for eigenvalue clusters

DOI10.1007/s00211-014-0681-6zbMath1334.65073OpenAlexW1964831500MaRDI QIDQ495529

Ren-Cang Li, Lei-Hong Zhang

Publication date: 14 September 2015

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-014-0681-6

zbMATH Keywords

convergenceerror boundsKrylov spaceRitz valuesblock Lanczos methodclose eigenvalueslarge scale Hermitian eigenvalue problemsRitz approximate subspace

Mathematics Subject Classification ID

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

Related Items (19)

Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods ⋮ Accelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair Computation ⋮ Hybrid eigensolvers for nuclear configuration interaction calculations ⋮ Accuracy of singular vectors obtained by projection-based SVD methods ⋮ Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers ⋮ On the Generalized Lanczos Trust-Region Method ⋮ Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces ⋮ A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems ⋮ A block Lanczos method for the linear response eigenvalue problem ⋮ Rayleigh-Ritz majorization error bounds for the linear response eigenvalue problem ⋮ Error bounds of Lanczos approach for trust-region subproblem ⋮ Error bounds for approximate deflating subspaces for linear response eigenvalue problems ⋮ Sharp error bounds for Ritz vectors and approximate singular vectors ⋮ Randomized block Krylov subspace methods for trace and log-determinant estimators ⋮ Randomized block Krylov methods for approximating extreme eigenvalues ⋮ A Structure-Exploiting Nested Lanczos-Type Iteration for the Multiview Canonical Correlation Analysis ⋮ A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization ⋮ Cluster-robust accuracy bounds for Ritz subspaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perturbation of spectral subspaces and solution of linear operator equations
• An extremal problem in Fourier analysis with applications to operator theory
• An adaptive block Lanczos algorithm
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Which Eigenvalues Are Found by the Lanczos Method?
• Sharpness in rates of convergence for the symmetric Lanczos method
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• On Meinardus' examples for the conjugate gradient method
• Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
• Estimates for Some Computational Techniques in Linear Algebra
• The Rotation of Eigenvectors by a Perturbation. III

This page was built for publication: Convergence of the block Lanczos method for eigenvalue clusters