GMRES convergence bounds for eigenvalue problems
DOI10.1515/cmam-2017-0017zbMath1391.65065arXiv1609.06201OpenAlexW2521297506MaRDI QIDQ1642858
Jennifer Pestana, Patrick Kürschner, Melina A. Freitag
Publication date: 15 June 2018
Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.06201
convergence analysispreconditioningKrylov subspace methodinexact subspace iterationinexact inverse iteration
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Preconditioners for iterative methods (65F08)
Related Items (2)
Cites Work
- Prescribing the behavior of early terminating GMRES and Arnoldi iterations
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation
- Convergence theory for inexact inverse iteration applied to the generalised nonsymmetric eigenproblem
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- Krylov sequences of maximal length and convergence of GMRES
- Inexact inverse iteration for generalized eigenvalue problems
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- A polynomial preconditioner for the GMRES algorithm
- A block MINRES algorithm based on the band Lanczos method
- Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
- Inexact inverse iteration for symmetric matrices
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- Nested Krylov Methods for Shifted Linear Systems
- Polynomial Preconditioned GMRES and GMRES-DR
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Computing an Eigenvector with Inverse Iteration
- Inexact Inverse Subspace Iteration with Preconditioning Applied to Non-Hermitian Eigenvalue Problems
- Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- GMRES convergence bounds that depend on the right-hand-side vector
This page was built for publication: GMRES convergence bounds for eigenvalue problems
