Convergence of Restarted Krylov Subspaces to Invariant Subspaces
DOI10.1137/S0895479801398608zbMATH Open1067.65037OpenAlexW1984263725MaRDI QIDQ4650974FDOQ4650974
Authors: Christopher Beattie, Mark Embree, John Rossi
Publication date: 21 February 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479801398608
Recommendations
- 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
convergenceeigenvalueserror boundsKrylov subspace methodsnumerical experimentsperturbation theoryinvariant subspacesLanczos algorithmArnoldi algorithmpseudospectrarestartscontainment gapZolotarev-type polynomial approximation problems
Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Rate of convergence, degree of approximation (41A25)
Cited In (28)
- A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
- Computation of eigenpair partial derivatives by Rayleigh-Ritz procedure
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- On the field of values of oblique projections
- The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
- Sharp Ritz value estimates for restarted Krylov subspace iterations
- Convergence analysis of restarted Krylov subspace eigensolvers
- Analysis of acceleration strategies for restarted minimal residual methods
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- On convergence of iterative projection methods for symmetric eigenvalue problems
- The many proofs of an identity on the norm of oblique projections
- A numerical solution of the constrained energy problem
- An iterative technique for construction of invariant subspaces
- Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- Weighted Inner Products for GMRES and GMRES-DR
- An Arnoldi-extrapolation algorithm for computing pagerank
- Title not available (Why is that?)
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- Polynomial preconditioned Arnoldi with stability control
- Convergence of Arnoldi's method for generalized eigenvalue problems
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- A posteriori error estimates of Krylov subspace approximations to matrix functions
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
Uses Software
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)