On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems

Applied Numerical Mathematics

Volumn 27, Issue 2, 1998, Pages 123-140

  Cao, Zhi Hao ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

BI CG; Iterative methods; Nonsymmetric linear systems; Quasi minimal residual approach

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ITERATIVE METHODS;

QUASI-MINIMAL RESIDUAL (QMR) APPROACH;

LINEAR SYSTEMS;

EID: 0032091421     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00004-X     Document Type: Article

References (15)

1. C. Brezinski, M. Redivo-Zaglia and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math. 63 (1992) 29-38.
2. C. Brezinski, M. Redivo-Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithm, Numer. Algorithms 1 (1991) 261-284.
3. Z.H. Cao, Avoiding breakdown in variants of the BI-CGSTAB algorithm, Linear Algebra Appl. 263 (1997) 113-132.
4. T.F. Chan, E. Gallopoulos, V. Simoncini, T. Szeto and C.H. Tong, A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems, SIAM J. Sci. Comput. 15 (1994) 338-347.
5. R.W. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14 (1993) 470-482.
6. R.W. Freund and N.M. Nachtigal, QMR: a quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60 (1991) 315-339.
7. R.W. Freund and T. Szeto, A quasi-minimal residual squared algorithm for non-Hermitian linear systems, Technical Report 91.26, RIACS NASA Ames Research Center, Moffett Field, CA (1991).
8. M.H. Gutknecht, Variants of BICGSTAB for matrices with complex spectrum, SIAM J. Sci. Comput. 14 (1993) 1020-1033.
9. M.H. Gutknecht, The unsymmetric Lanczos algorithms and their relations to Padé approximation, continued fractions, and the gd algorithm, in: Proceedings of the Copper Moutain Conference on Iterative Methods (1990).
10. M.H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part I, SIAM J. Matrix Anal. Appl. 13 (1992) 594-634.
11. M.H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part II, SIAM J. Matrix Anal. Appl. 15 (1994) 15-58.
12. P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Comput. 10 (1989) 36-52.
13. C.H. Tong, A family of quasi-minimal residual methods for nonsymmetric linear systems, SIAM J. Sci. Comput. 15 (1994) 89-105.
14. H.A. van der Vorst, Bi-CGSTAB: a fast and smoothing converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Comput. 13 (1992) 631-644.
15. L. Zhou and H.F. Walker, Residual smoothing techniques for iterative methods, SIAM J. Sci. Comput. 15 (1994) 297-312.