Convergence of the block Lanczos method for eigenvalue clusters
The authors develop a new convergence theory for the block Lanczos method for solving large scale Hermitian eigenvalue problems. Unlike the approach of \textit{Y. Saad} [SIAM J. Numer. Anal. 17, 687--706 (1980; Zbl 0456.65016)], which bounded errors in each individual approximate eigenvector, their approach bounds approximation errors in the entire eigenspace associated with all eigenvalues in a tight cluster. This produces much tighter error bounds for (i) the canonical angles from the eigenspace to the generated Krylov space, (ii) the canonical angles between the eigenspace and its Ritz approximate subspace, and (iii) the total differences between the eigenvalues in the cluster and their corresponding Ritz values.
- Generalized block Lanczos methods for large unsymmetric eigenproblems
- Convergence estimates of nonrestarted and restarted block-Lanczos methods.
- Sharpness in rates of convergence for the symmetric Lanczos method
- An adaptive block Lanczos algorithm
- On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
- An adaptive block Lanczos algorithm
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- An extremal problem in Fourier analysis with applications to operator theory
- Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
- Estimates for Some Computational Techniques in Linear Algebra
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- On Meinardus' examples for the conjugate gradient method
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Perturbation of spectral subspaces and solution of linear operator equations
- Sharpness in rates of convergence for the symmetric Lanczos method
- The Rotation of Eigenvectors by a Perturbation. III
- Which eigenvalues are found by the Lanczos method?
- Accuracy of singular vectors obtained by projection-based SVD methods
- A block Lanczos method for the linear response eigenvalue problem
- Error bounds for approximate deflating subspaces for linear response eigenvalue problems
- Eigenvalue clustering of coefficient matrices in the iterative stride reductions for linear systems
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Randomized block Krylov methods for approximating extreme eigenvalues
- Rayleigh-Ritz majorization error bounds for the linear response eigenvalue problem
- Cluster-robust accuracy bounds for Ritz subspaces
- scientific article; zbMATH DE number 4199465 (Why is no real title available?)
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- Sharpness in rates of convergence for the symmetric Lanczos method
- Convergence estimates of nonrestarted and restarted block-Lanczos methods.
- Sharp error bounds for Ritz vectors and approximate singular vectors
- A Structure-Exploiting Nested Lanczos-Type Iteration for the Multiview Canonical Correlation Analysis
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- A block Lanczos method for the CDT subproblem
- Cluster robust estimates for block gradient-type eigensolvers
- Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- 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
- On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- Hybrid eigensolvers for nuclear configuration interaction calculations
- Bootstrapped block Lanczos for large-dimension eigenvalue problems
- Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers
- Error bounds of Lanczos approach for trust-region subproblem
- An inexact alternating projection method with application to matrix completion
This page was built for publication: Convergence of the block Lanczos method for eigenvalue clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495529)
