Abstract
Iterative methods, which were initially developed for the solution of symmetric linear systems, have more recently been extended to the nonsymmetric case. Nonsymmetric linear systems arise in many applications, including the solution of elliptic partial differential equations. In this work, we provide a brief description of and discuss the relationship between five commonly used iterative techniques: CGNR, GMRES, BiCG, CGS and BiCGSTAB. We highlight the relative merits and deficiencies of each technique through the implementation of each in the numerical solution of several differential equations test problems. Preconditioning is used in each case. We also discuss the mathematical equivalence between a nonsymmetric Lanczos orthogonalization, and BiCG.
Similar content being viewed by others
References
Barrett, R.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1994.
Elman, H. C.: Iterative methods for large, sparse, nonsymmetric systems of linear equations, PhD thesis and Res. Rep. # 229, Dept. of Comp. Sci., Yale University, 1982.
Fletcher, R.: Conjugate gradient methods for indefinite systems, in: Lecture Notes in Math.506, Springer-Verlag, Berlin, Heidelberg, New York, 1976, pp. 73-89.
Hestenes, M. R. and Stiefel, E.: Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand. 49(1952), 409-436.
Lanczos, C.: Solution for systems of linear equations by minimized iteration, J. Res. Nat. Bur. Stand. 49(1952), 33-53.
Nachtigal, N. M., Reddy, S. C. and Lloyd N.: Trefethen, How fast are nonsymmetric matrix iterations?, Report, Department of Math., MIT, presented at Copper Mountain Conference of Iterative Methods, April 1990.
Parlett, B. N., Taylor, D. R. and Liu, Z. A.: A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44(1985), 105-124.
de Pillis, L. G. and Trifa, M.: The nonsymmetric Lanczos connection, Harvey Mudd College technical report, 1995.
Saad, Y.: The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems, SIAM J. Numer. Anal. 19(3) (1982), 485-506.
Saad, Y.: Iterative Methods for Sparse Linear Systems, PWS Publishing Company, 1996.
Saad, Y. and Schultz, M. H.: GMRES: a generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7(1986), 856-869.
Sonneveld, P.: CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 10(1) (1989), 36-52.
van der Vorst, H. A.: Iterative solution methods for certain sparse linear systems with a nonsymmetric matrix arising from PDE problems, J. Comput. Phys. 44(1981), 1-19.
van der Vorst, H. A.: Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, Report from the Math. Inst., University of Utrecht, Netherlands, September 1990.
van der Vorst, H. A.: The convergence behavior of preconditioned CG and CGS in the presence of rounding errors, in O. Axelsson (ed.), Proc. PCG Conference, Nijmegen, June 19-21, 1989.
Rights and permissions
About this article
Cite this article
de Pillis, L.G. A Comparison of Iterative Methods for Solving Nonsymmetric Linear Systems. Acta Applicandae Mathematicae 51, 141–159 (1998). https://doi.org/10.1023/A:1005919601192
Issue Date:
DOI: https://doi.org/10.1023/A:1005919601192