Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
From MaRDI portal
Arnoldi algorithmcontainment gapeigenvalue computationsKrylov subspacesLanczos algorithmpseudospectra
Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Approximation in the complex plane (30E10) Invariant subspaces of linear operators (47A15) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Recommendations
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems
- Convergence analysis of restarted Krylov subspace eigensolvers
- On the convergence of restarted Krylov subspace methods
- The Arnoldi eigenvalue iteration with exact shifts can fail
Cited in
(30)- Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems
- Optimal quotients for solving large eigenvalue problems
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- Randomized block Krylov methods for approximating extreme eigenvalues
- Acceleration of the Arnoldi method and real eigenvalues of the non-Hermitian Wilson-Dirac operator
- A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
- A periodic Krylov-Schur algorithm for large matrix products
- Convergence of Arnoldi's method for generalized eigenvalue problems
- Schubert varieties and distances between subspaces of different dimensions
- Interpolation-restart strategies for resilient eigensolvers
- 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.
- Prescribing the behavior of early terminating GMRES and Arnoldi iterations
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- A mathematical biography of Danny C. Sorensen
- A Krylov-Schur approach to the truncated SVD
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- Twice is enough for dangerous eigenvalues
- A GMRES convergence analysis for localized invariant subspace ill-conditioning
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Polynomial preconditioned Arnoldi with stability control
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- On convergence of iterative projection methods for symmetric eigenvalue problems
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- An Arnoldi-extrapolation algorithm for computing pagerank
This page was built for publication: Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317159)
