Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
From MaRDI portal
Publication:675681
DOI10.1007/BF02127693zbMath0873.65028OpenAlexW1993237915MaRDI QIDQ675681
Publication date: 9 October 1997
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02127693
convergencenumerical experimentseigenvalue distributionKrylov subspace methodsgeneralized minimal residual methodbi-conjugate gradient methodnonnormal matricesquasi-minimal residual methodfull orthogonal method
Related Items
On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems, The effect of non-optimal bases on the convergence of Krylov subspace methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
- Hydrodynamic Stability Without Eigenvalues
- Implementation of the GMRES Method Using Householder Transformations
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Variants of BICGSTAB for Matrices with Complex Spectrum
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
