On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
From MaRDI portal
Publication:285268
DOI10.1007/s10543-015-0564-yzbMath1350.65023OpenAlexW2222006807MaRDI QIDQ285268
Jurjen Duintjer Tebbens, Gérard A. Meurant
Publication date: 19 May 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-015-0564-y
convergenceeigenvectorKrylov subspace methodsquasi-minimal residualeigenvalue influencefull orthogonalization method (FOM)generalized minimal residual (GMRES) methodnonsymmetric systemsQ-MR methodQ-OR methodquasi-orthogonal residual
Related Items
The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems ⋮ On two generalized inverse eigenvalue problems for Hessenberg-upper triangular pencils and their application to the study of GMRES convergence ⋮ Heavy ball restarted CMRH methods for linear systems ⋮ Restarted Hessenberg method for solving shifted nonsymmetric linear systems ⋮ Augmented and deflated CMRH method for solving nonsymmetric linear systems ⋮ The Coefficients of the FOM and GMRES Residual Polynomials ⋮ An optimal Q-OR Krylov subspace method for solving linear systems ⋮ Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously ⋮ Some unusual results on extrapolation methods ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prescribing the behavior of early terminating GMRES and Arnoldi iterations
- A new look at CMRH and its relation to GMRES
- Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Reduced storage matrix methods in stiff ODE systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Krylov sequences of maximal length and convergence of GMRES
- On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
- On a variable smoothing procedure for Krylov subspace methods
- GMRES and the Arioli, Pták, and Strakoš parametrization
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Software for simplified Lanczos and QMR algorithms
- On investigating GMRES convergence using unitary matrices
- The effect of non-optimal bases on the convergence of Krylov subspace methods
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- On the Convergence of Restarted Krylov Subspace Methods
- Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles
- Krylov Subspace Methods
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
- Geometric aspects of the theory of Krylov subspace methods
- Iterative Krylov Methods for Large Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
