Prescribing the behavior of early terminating GMRES and Arnoldi iterations
From MaRDI portal
Publication:393756
DOI10.1007/s11075-013-9695-xzbMath1288.65037OpenAlexW2084864145MaRDI QIDQ393756
Jurjen Duintjer Tebbens, Gérard A. Meurant
Publication date: 24 January 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9695-x
prescribed eigenvaluesgeneralized minimal residual (GMRES) methodArnoldi iterationsearly terminationprescribed residualsprescribed Ritz values
Related Items
Multistep matrix splitting iteration preconditioning for singular linear systems ⋮ Preconditioning for Nonsymmetry and Time-Dependence ⋮ On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems ⋮ GMRES convergence bounds for eigenvalue problems ⋮ Admissible and Attainable Convergence Behavior of Block Arnoldi and GMRES ⋮ GMRES algorithms over 35 years ⋮ Necessary and sufficient conditions for GMRES complete and partial stagnation ⋮ The role eigenvalues play in forming GMRES residual norms with non-normal matrices ⋮ On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES ⋮ On prescribing the convergence behavior of the conjugate gradient algorithm ⋮ Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems ⋮ On Fixed-Point, Krylov, and $2\times 2$ Block Preconditioners for Nonsymmetric Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Krylov sequences of maximal length and convergence of GMRES
- GMRES and the Arioli, Pták, and Strakoš parametrization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Constraint Preconditioning for Indefinite Linear Systems
- A Note on Preconditioning for Indefinite Linear Systems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
- Computable Convergence Bounds for GMRES
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- The principle of minimized iterations in the solution of the matrix eigenvalue problem