Generalized conjugate gradient squared

Journal of Computational and Applied Mathematics

Volumn 71, Issue 1, 1996, Pages 125-146

  Fokkema, Diederik R ^a,b   Sleijpen, Gerard L G ^a   Van Der Vorst, Henk A ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b SYNOPSYS SWITZERLAND LLC   (Switzerland)

Author keywords

Bi CG; BiCGstab( ); CGS; Iterative solvers; Krylov subspace; Newton's method; Nonlinear systems; Nonsymmetric linear systems

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; NONLINEAR EQUATIONS; POLYNOMIALS;

CONJUGATE GRADIENT SQUARED (CGS) METHOD; NEWTON'S METHOD; NONSYMMETRIC LINEAR SYSTEMS;

ITERATIVE METHODS;

EID: 0030194237     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-0427(95)00227-8     Document Type: Article

References (26)

1. H.G. Brachtendorf, Simulation des eingeschwungenen Verhaltens elektronischer Schaltungen, Ph.D. Thesis, Universität Bremen, 1994.
2. P.N. Brown and Y. Saad, Hybrid Krylov methods for nonlinear systems of equations, SIAM J. Sci. Statist. Comput. 11 (1990) 450-481.
3. 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.
4. R.S. Dembo, S.C. Eisenstat and T. Steihaug, Inexact Newton methods, SIAM J. Numer. Anal 19 (1982) 400-408.
5. J.E. Dennis, Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
6. R. Fletcher, Conjugate gradient methods for indefinite systems, in: G.A. Watson, Ed., Numerical Analysis Dundee 1975, Lecture Notes in Mathematics, Vol. 506 (Springer, Berlin, 1976) 73-89.
7. R. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14 (1993) 470-482.
8. R. Glowinski, H.B. Keller and L. Reinhart, Continuation-conjugate gradient methods for the least squares solution of nonlinear boundary value problems, SIAM J. Sci. Statist. Comput. 6 (1985) 793-832.
9. I. Gustafsson, A class of first order factorizations methods, BIT 18 (1978) 142-156.
10. M.H. Gutknecht, Variants of BiCGStab for matrices with complex spectrum, SIAM J. Sci. Comput. 14 (1993) 1020-1033.
11. Y. Huang and H.A. Van der Vorst, Some observations on the convergence behaviour of GMRES, Tech. Report 89-09, Delft University of Technology, Faculty of Tech. Math., 1989.
12. C. Lanczos, Solution of systems of linear equations by minimized iteration, J. Res. Nat. Bur. Standards 49 (1952) 33-53.
13. A. Liegmann, Efficient solution of large sparse linear systems, Ph.D. Thesis, ETH Zürich, 1995.
14. J.A. Meijerink and H.A. Van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp. 31 (1977) 148-162.
15. N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl. 13 (1992) 778-795.
16. A. Neumaier. Oral presentation at the Oberwolfach meeting, April 1994.
17. S.J. Polak, C. den Heijer, W.H.A. Schilders and P. Markowich, Semiconductor device modelling from the numerical point of view, Internat. J. Numer. Methods Engng. 24 (1987) 763-838.
18. C. Pommerell and W. Fichtner, PILS: An iterative linear solver package for ill-conditioned systems, in: Supercomputing '91 (Albuquerque, NM, November 1991) (IEEE Computer Society Press, Los Alamitos, CA) 588-599.
19. A. Ruhe, Rational Krylov algorithms for nonsymmetric eigenvalue problems II. Matrix Pairs, Linear Algebra and its Appl. 197/198 (1994) 283-295.
20. G.L.G. Sleijpen and D.R. Fokkema, BiCGstab(ℓ) for linear equations involving matrices with complex spectrum, Electron. Trans. Numer. Anal. 1 (1993) 11-32.
21. G.L.G. Sleijpen and H.A. Van der Vorst, Maintaining convergence properties of BiCGstab methods in finite precision arithmetic, Numer. Algorithms 10 (1995) 203-223.
22. G.L.G. Sleijpen and H.A. Van der Vorst, Reliable updated residuals in hybrid Bi-CG methods, Computing 56 (2) (1996), to appear.
23. G.L.G. Sleijpen, H.A. Van der Vorst and D.R. Fokkema, BiCGstab(ℓ) and other hybrid Bi-CG methods, Numer. Algorithms 7 (1994) 75-109.
24. P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 10 (1989) 36-52.
25. 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) 631-644.
26. L. Zhou and H.F. Walker, Residual smoothing techniques for iterative methods, SIAM J. Sci. Comput. 15 (1994) 297-312.