Convergence Analysis of Restarted Krylov Subspace Eigensolvers
From MaRDI portal
Publication:3185675
DOI10.1137/16M1056481zbMath1343.65038MaRDI QIDQ3185675
Publication date: 4 August 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Related Items
Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers, Sharp Ritz value estimates for restarted Krylov subspace iterations, Cluster robust estimates for block gradient-type eigensolvers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem
- On preconditioned eigensolvers and invert-Lanczos processes
- 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. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
- Iterative minimization of the Rayleigh quotient by block steepest descent iterations
- Convergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- A Generalized Lanczos Scheme
- Templates for the Solution of Algebraic Eigenvalue Problems
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- Estimates for Some Computational Techniques in Linear Algebra
