A variant algorithm of the Orthomin\((m)\) method for solving linear systems
From MaRDI portal
Publication:2379022
DOI10.1016/j.amc.2008.08.035zbMath1157.65341MaRDI QIDQ2379022
Kuniyoshi Abe, Shao-Liang Zhang
Publication date: 14 January 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.08.035
algorithm; numerical experiments; Krylov subspace method; singular linear systems; Orthomin\((m)\) method
65F10: Iterative numerical methods for linear systems
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variant of the ORTHOMIN(2) method for singular linear systems
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- Necessary and sufficient conditions for the convergence of \(\text{Orthomin}(k)\) on singular and inconsistent linear systems
- A note on solving EP inconsistent linear systems
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- GMRES On (Nearly) Singular Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Methods of conjugate gradients for solving linear systems
