Avoiding breakdown in variants of the BI-CGSTAB algorithm

Linear Algebra and Its Applications

Volumn 263, Issue 1-3, 1997, Pages 113-132

  Cao, Zhi Hao ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040944381     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00525-3     Document Type: Article

References (18)

1. C. Brezinski, Padé-Type Approximation and General Orthogonal Polynomials, Birkhäuser, Basel, 1980.
2. C. Brezinski, M. R. Zaglia, and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math. 63:29-38 (1992).
3. C. Brezinski, M. R. Zaglia, and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algorithms 1:261-284 (1991).
4. C. Brezinski and H. Sadok, Avoiding breakdown in the CGS algorithm, Numer. Algorithms 1:199-206 (1991).
5. P. N. Brown, A theoretical comparison of the Anoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput. 12:58-78 (1991).
6. A. Draux, Polynômes Orthogonaux Formels, Springer-Verlag, New York, 1983.
7. R. W. Freund, M. H. Gutknecht, and N. M. Nachtigal, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput. 14:137-158 (1993).
8. M. H. Gutknecht, Variants of BICGSTAB for matrices with complex spectrum, SIAM J. Sci. Comput. 14:1020-1033 (1993).
9. M. H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part I, SIAM J. Matrix Anal. Appl. 13:594-639 (1992).
10. M. H. Gutknecht, A completed theory of the unsymmetric Lanczos process and related algorithms, Part II, SIAM J. Matrix Anal. Appl. 15:15-58 (1994).
11. C. Lanczos, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Standards 49:33-53 (1952).
12. N. M. Nachtigal, S. C. Reddy, and L. N. Trefethen, How fast are nonsymmetric matrix iterations? SIAM J. Matrix Anal. Appl. 13:778-795 (1992).
13. H. Rutishauser, Beiträge zur Kenntnis des Biorthogonalisierungs-Algorithmus von Lanczos, Z. Angew. Math. Phys. 4:35-56 (1953).
14. Y. Saad, The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems, SIAM J. Numer. Anal. 19:485-506 (1982).
15. Y. Saad and M. H. Shultz, Conjugate gradient-like algorithms for solving nonsymmetric linear systems, Math. Comp. 44:417-424 (1985).
16. P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 10:36-52 (1989).
17. E. Stiefel, Relaxationsmethoden bester Strategie zur Lösung linear Gleichungssysteme, Comm. Math. Helv. 29:157-179 (1955).
18. H. A. Van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 13:631-644 (1992).