Composite step product methods for solving nonsymmetric linear systems

SIAM Journal on Scientific Computing

Volumn 17, Issue 6, 1996, Pages 1491-1508

  Chan, Tony F ^a   Szeto, Tedd ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bi CGSTAB; Biconjugate gradient method; Breakdowns; Composite step; Lanczos method; Product methods

Indexed keywords

EID: 0347953383     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594269202     Document Type: Article

References (29)

1. A. K. AZIZ AND I. BABUŠKA, Part I, Survey lectures on the mathematical foundations of the finite element method, in The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations, Academic Press, New York, 1972, pp. 1-362.
2. R. E. BANK AND T. F. CHAN, An analysis of the composite step bi-conjugate gradient algorithm for solving nonsymmetric systems, Numer. Math., 66(1993), pp. 295-319.
3. _, A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems, Numer. Algorithms, 7(1994), pp. 1-16.
4. T. BARTH AND T. MANTEUFFEL, Variable metric conjugate gradient methods, in Proceedings of the Tenth International Symposium on Matrix Analysis and Parallel Computing, Keio University, Yokohama, Japan, March, 1994.
5. C. BREZINSKI AND H. SADOK, Lanczos-type algorithms for solving systems of linear equations, Appl. Numer. Math., 11(1993), pp. 443-473.
6. C. BREZINSKI AND M. REDIVO-ZAGLIA, Breakdowns in the computation of orthogonal polynomials, in Nonlinear Numerical Methods and Rational Approximation, A. Cuyt, ed., Kluwer, Dordrecht, the Netherlands, 1994, pp. 49-59.
7. C. BREZINSKI, M. REDIVO-ZAGLIA, AND H. SADOK, A breakdown-free Lancios type algorithm for solving linear systems, Numer. Math., 63(1992), pp. 29-38.
8. _, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algorithms, 1(1991), pp. 261-284.
9. T. F. CHAN AND T. SZETO, A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems, Numer. Algorithms, 7(1994), pp. 17-32.
10. A. DRAUX, Polynômes orthogonaux formels, Lecture Notes in Math., 974, Springer-Verlag, Berlin, 1983.
11. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15(1989), pp. 1-14.
12. S. C. EISENSTAT, H. C. ELMAN, AND M. H. SCHULTZ, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal., 20(1983), pp. 345-357.
13. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Numerical Analysis, Lecture Notes in Math., 506, G. A. Watson, ed., Springer-Verlag, Berlin, 1976, pp. 73-89.
14. R. W. FREUND AND N. M. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60(1991), pp. 315-339.
15. _, A Look Ahead TFQMR Method, Presented at the Cornelius Lanczos International Centenary Conference, Raleigh, NC, December 1993.
16. 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., 13 (1992), pp. 137-158.
17. M. H. GUTKNECHT, The unsymmetric Lanczos algorithms and their relations to Pade approximation, continued fraction and the QD algorithm, in Proc. Copper Mountain Conference on Iterative Methods, Book 2, Breckenridge, CO, 1990.
18. _, Variants of BiCGSTAB for matrices with complex spectrum, SIAM J. Sci. Comput., 14 (1993), pp. 1020-1033.
19. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand., 49(1952), pp. 409-436.
20. W. JOUBERT, Generalized Conjugate Gradient and Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations, Ph.D. thesis, The University of Texas at Austin, Austin, TX, 1990.
21. C. LANCZOS, Solution of linear equations by minimized iterations, J. Res. Nat. Bur. Stand., 49 (1952), pp. 33-53.
22. T. MANTEUFFEL, An Iterative Method for Solving Nonsymmetric Linear Systems with Dynamic Estimation of Parameters, Ph.D. thesis, University of Illinois, Urbana, IL, 1975.
23. N. M. NACHTIGAL, S. C. REDDY, and L. N. TREFETHEN, How Fast Are Nonsymmetric Matrix Iterations?, Tech. report, Department of Mathematics, MIT, Cambridge, MA, 1990.
24. B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comput., 44(1985), pp. 105-124.
25. G. SLEIJPEN AND D. FOKKEMA, BICGSTAB(L) for linear equations involving unsymmetric matrices with complex spectrum, ETNA, 1(1993), pp. 11-32.
26. P. SONNEVELD, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10(1989), pp. 36-52.
27. C. H. TONG, A Comparative Study of Preconditioned Lanczos Methods for Nonsymmetric Linear Systems, Tech. report SAND91-8402 UC-404, Sandia National Laboratories, Albuquerque, NM, 1992.
28. 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(1992), pp. 631-644.
29. _, The convergence behaviour of preconditioned CG and CG-S in the presence of rounding errors, in Preconditioned Conjugate Gradient Methods, O. Axelsson and L. Yu. Kolotilina, eds., Lecture Notes in Math., 1457, Springer-Verlag, Berlin, 1990.