Convergence of Restarted Krylov Subspaces to Invariant Subspaces
The authors prove estimates for the angle (strictly spoken: for the containment gap) between a searched invariant subspace of a general \(n\times n\) matrix and the subspace generated by Krylov subspace methods like the Arnoldi algorithm or the biorthogonal Lanczos algorithm. They don't make further assumptions on the matrix and take into account restarts (by writing the new starting vector as \(p(A)v\) where \(p\) is a suitable polynomial and \(v\) the former starting vector). Their estimates contain 3 constants and an expression which can be further estimated by inserting an appropriate polynomial of given degree. Here, polynomials turn out to be advantageous which take on small values on a set in the complex plane containing all unwanted eigenvalues and large values for a set containing the wanted eigenvalues. The optimal polynomial is shown to be connected to the solution of a Zolotarev-type approximation problem. From the 3 constants in the gap estimate, one is at most \(\sqrt 2\), the remaining two are closely further estimated by appropriate singular values and using pseudospectra bounds. The theory developed is able to explain convergence behaviour including stagnation and superlinear phases, and to suggest optimal restart strategies. A series of numerical experiments for matrices with known Jordan structure shows that the estimates are rather close and can deliver convergence rates with small error.
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- Convergence analysis of restarted Krylov subspace eigensolvers
- On the convergence of restarted Krylov subspace methods
- Sharp Ritz value estimates for restarted Krylov subspace iterations
- Analysis of acceleration strategies for restarted minimal residual methods
- Sharp Ritz value estimates for restarted Krylov subspace iterations
- A posteriori error estimates of Krylov subspace approximations to matrix functions
- A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
- Convergence of Arnoldi's method for generalized eigenvalue problems
- The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- An iterative technique for construction of invariant subspaces
- Convergence analysis of restarted Krylov subspace eigensolvers
- Computation of eigenpair partial derivatives by Rayleigh-Ritz procedure
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- scientific article; zbMATH DE number 697769 (Why is no real title available?)
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- Weighted Inner Products for GMRES and GMRES-DR
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- Polynomial preconditioned Arnoldi with stability control
- Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
- On convergence of iterative projection methods for symmetric eigenvalue problems
- A numerical solution of the constrained energy problem
- The many proofs of an identity on the norm of oblique projections
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- On the field of values of oblique projections
- An Arnoldi-extrapolation algorithm for computing pagerank
This page was built for publication: Convergence of Restarted Krylov Subspaces to Invariant Subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650974)