Reliable updated residuals in hybrid Bi-CG methods

Computing (Vienna/New York)

Volumn 56, Issue 2, 1996, Pages 141-163

  Sleijpen, G L G ^a,b   Van Der Vorst, H A ^a,b  

^a University Utrecht ^*

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bi CGSTAB; BiCGstab(l); CGS; Iterative solver; Non symmetric linear systems

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; PROBLEM SOLVING;

LINEAR EQUATIONS; NONSYMMETRIC LINEAR SYSTEMS; RELIABLE UPDATED RESIDUALS;

SYSTEMS ANALYSIS;

EID: 0029732659     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02309342     Document Type: Article

References (21)

1. Bai, Z.: Error analysis of the Lanczos algorithm for the nonsymmetric eigenvalue problem. Math. Comp. 62, 209-226 (1994).
2. Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Proc. of the Dundee Biennial Conference on Numerical Analysis (Watson, G., ed.), pp. 73-89. New York: Springer 1975.
3. Fokkema, D. R., Sleijpen, G. L. G., van der Vorst, H. A.: Generalized conjugate gradient squared. Preprint 851, Dept. Math., University Utrecht (1994).
4. Freund, R. W.: A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14, 470-482 (1993).
5. Freund, R. W., Gutknecht, M. H., Nachtigal, N. M.: An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput. 14, 137-158 (1993).
6. Freund, R. W., Nachtigal, N. M.: QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60, 315-339 (1991).
7. Greenbaum, A.: Behavior of slightly perturbed Lanczos and conjugate gradient recurrences. Linear Algebra Appl. 113, 7-63 (1989).
8. Greenbaum, A.: Estimating the attainable accuracy of recursively computed residual methods. Preprint, Courant Institute of Math. Sc., 1995.
9. Lanczos, C.: Solution of systems of linear equations by minimized iteration. J. Res. Nat. Bur. Stand. 49, 33-53 (1952).
10. Meier Yang, U.: Preconditioned conjugate gradient-like methods of nonsymmetric linear systems. Preprint, Center for Research and Development, University of Illinois at Urbana-Champaign, 1992.
11. Neumaier, A.: Oral presentation at the Oberwolfach meeting "Numerical Linear Algebra", Oberwolfach, April 1994.
12. Paige, C. C.: Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem. Linear Algebra Appl. 34, 235-258 (1980).
13. Paige, C. C., Parlett, B. N., Van der Vorst, H. A.: Approximate solutions and eigenvalue bounds from Krylov subspaces. Numer. Lin. Alg. Appl. 2, 115-134 (1995).
14. Saad, Y.: A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Statist. Comput. 14, 461-469 (1993).
15. Saad, Y., Schultz, M. H., GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear system. SIAM J. Sci. Stat. Comp. 7, 856-869 (1986).
16. Sleijpen, G. L. G., Fokkema, D. R.: BiCGstab(l) for linear equations involving matrices with complex spectrum. Elect. Trans, Numer. Anal. (ETNA) 1, 11-32 (1993).
17. Sleijpen, G. L. G., Van der Vorst, H. A.: Maintaining convergence properties of BiCGstab methods in finite precision arithmetic. Preprint Nr. 861, Dept. Math., University Utrecht, 1994. To appear in Numerical Algorithms.
18. Sleijpen, G. L. G., Van der Vorst, H. A., Fokkema, D. R.: BiCGstab(l) and other hybrid Bi-CG methods. Numer. Alg. 7, 75-109 (1994).
19. Sonneveld, P.: CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Stat. Comp. 10, 36-52 (1989).
20. Van der Vorst, H. A.: Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631-644 (1992).
21. Zhou, L., Walker, H. F.: Residual smoothing techniques for iterative methods. SIAM J. Sci. Comput. 15, 297-312 (1994).