On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
Author:
- Zhi-Hao CaoZCZhi-Hao Cao
- 1 June 1998
- journal article
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 27 (2) , 123-140
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Avoiding breakdown in variants of the bi-cgstab algorithmLinear Algebra and its Applications, 1997
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric SystemsSIAM Journal on Scientific Computing, 1994
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part IISIAM Journal on Matrix Analysis and Applications, 1994
- Variants of BICGSTAB for Matrices with Complex SpectrumSIAM Journal on Scientific Computing, 1993
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear SystemsSIAM Journal on Scientific Computing, 1993
- A breakdown-free Lanczos type algorithm for solving linear systemsNumerische Mathematik, 1992
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part ISIAM Journal on Matrix Analysis and Applications, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Avoiding breakdown and near-breakdown in Lanczos type algorithmsNumerical Algorithms, 1991
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systemsSIAM Journal on Scientific and Statistical Computing, 1989