A new taxonomy of conjugate gradient methods

Computers and Mathematics with Applications

Volumn 31, Issue 4-5, 1996, Pages 7-17

  Broyden, C G ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Biconjugate gradients; Biconjugate residuals; Conjugate gradients; Hegedus methods; Lanczos methods; Linear systems

Indexed keywords

EID: 0043176703     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(95)00211-1     Document Type: Article

References (44)

1. M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bureau of Standards 49, 409-436 (1952).
2. R.W. Freund, G.H. Golub and N.M. Nachtigal, Iterative solution of linear systems, Acta Numerica 1, 57-100 (1992).
3. J.E. Dennis, Jr. and K. Turner, Generalized conjugate directions, Linear Algebra Applics. 88/89, 187-209 (1987).
4. P. Joly, Présentation de synthése des méthodes de gradient conjugué, Mathematical Modelling and Numerical Analysis 20 (4), 639-665 (1986).
5. R.W. Freund and N.M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60, 315-339 (1991).
6. Cs. J. Hegedus, Generating conjugate directions for arbitrary matrices by matrix equations, Parts 1 and 2, Report No. KFKI-1990-36/M, Hungarian Academy of Sciences, Central Research Institute for Physics, Budapest, (1990).
7. Cs. J. Hegedus, Generation of conjugate directions for arbitrary matrices and solution of linear systems, University of Bergamo Research Report, In Computer Algorithms for Aolving Linear Algebraic Equations: The State of the Art, (Edited by E. Spedicato and M.T. Vespucci), NATO Advanced Study Institute, Bergamo, (1991).
8. S.F. Ashby, T.A. Manteuffel and P.E. Saylor, A taxonomy for conjugate gradient methods, SIAM J. Numer. Anal. 27, 1542-1568 (1990).
9. V. Faber and T. Manteuffel, Necessary and sufficient conditions for the existence of a conjugate gradient method, SIAM J. Numer. Anal. 21, 352-262 (1984).
10. V.V. Voyevodin, On methods of conjugate directions, USSR Journ. Comput. Math, and Math. Phys. 19 (5), 228-233 (1981).
11. V.V. Voyevodin, Linear Algebra, Mir, Moscow, (1983).
12. J. Abaffy and E. Spedicato, ABS Projection Algorithms, Ellis Horwood, Chichester, (1989).
13. C.G. Broyden, Block conjugate gradient methods, Optimization Methods and Software 2, 1-17 (1993).
14. D.G. Luenberger, Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, (1984).
15. T.S. Eliot, The hollow men, In Selected Poems, Faber and Faber, London, (1954).
16. A. Ruhe, Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices, Math. Comp. 33 (146), 680-687 (1979).
17. M.R. Hestenes, The conjugate gradient method for solving linear systems, In Proc. Symposia on Applied Mathematics, Volume VI, Numerical Analysis, McGraw-Hill, New York, (1956).
18. M.R. Hestenes, Conjugate Direction Methods in Optimisation, Springer, Berlin, (1980).
19. J.K. Reid, On the method of conjuate gradients for the solution of large sparse systems of equations, In Large Sparse Sets of Linear Equations, (Edited by J.K. Reid), Academic Press, London, (1971).
20. L.C.W. Dixon, On Nazareth's three term conjugate gradient method, Technical Report No. 133, Hatfield Polytechnic Numerical Optimisation Centre, (1983).
21. L. Nazareth, A conjugate gradient algorithm without line searches, JOTA 23 (3), 373-387 (1977).
22. J. Nocedal, On the method of conjugate gradients for function minimisation, Ph.D. Thesis, Rice University, (1978).
23. R. Fletcher, Conjugate gradient methods for indefinite systems, In Proc. Dundee Conference on Numerical Analysis, Lecture Notes in Mathematics, 506, (Edited by G.A. Watson), Springer, Berlin, (1976).
24. V.M. Fridman, The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetric matrix, USSR Journ. Comput. Math, and Math. Phys. 2, 362-363 (1963).
25. C.C. Paige and M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (4), 617-629 (1975).
26. J. Stoer and R.W. Freund, On the solution of large indefinite systems of linear equations by conjugate gradient methods, In Computing Methods in Applied Sciences and Engineering V, (Edited by R. Glowinski and J.L. Lions), pp. 35-53, North-Holland, Amsterdam, (1982).
27. E.J. Craig, The N-step iteration procedure, J. Math Phys. 34, 64-73 (1955).
28. D.M. Young and K.C. Jea, Generalized conjugate gradient acceleration of iterative methods, Linear Algebra Applics. 34, 159-194 (1980).
29. M.A. Boschetti, Nuovi algoritmi basati sui metodi gradienti coniugati, Tesi di Laurea, Universitá di Bologna, (1993).
30. C. Lanczos, Solution of systems of linear equations by minimized iterations, J. Res. Nat Bur. Standards 49, 255-282 (1950).
31. D.G. Luenberger, Hyperbolic pairs in the method of conjugate gradients, SIAM J. Appl. Math. 17, 1263-1267 (1969).
32. C. Brezinski, M. Redivo Zaglia and H. Sadok, A breakdown-free Lanczos-type algorithm for solving linear systems, Numer. Math. 63, 29-38 (1992).
33. C. Brezinski, M. Redivo Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algoriths. 1, 261-284 (1991).
34. C. Brezinski, M. Redivo Zaglia and H. Sadok, Addendum to avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algoriths. 2, 133-136 (1992).
35. G. Golub and W. Kahan, Calculating the singular values and pseudo-inverse of a matrix, J. SIAM Numer. Anal. Ser B 2 (2), 205-224 (1965).
36. C.C. Paige and M.A. Saunders, An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software 6 (1), 43-71 (1982).
37. H.C. Elman, Iterative methods for large, sparse nonsymmetric systems of linear equations, Ph.D. Thesis, Yale University, (1982).
38. Y. Saad and M.H. Schutz, Conjugate gradient-like algorithms for solving nonsymmetric linear systems, Math. Comp. 44, 417-424 (1985).
39. P.K.W. Vinsome, Orthomin, an iterative method for solving sparse sets of linear equations, In Proceedings of the Fourth Symposium on Reservoir Simulation, Society of Petroleum Engineers of AIME.
40. P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 10, 36-52 (1989).
41. H.A. van der Vorst, Bi-CGSTAB: A fast and smoothly-convergent variant of bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 13, 631-644 (1992).
42. 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. Matrix Anal. (to appear).
43. M. Gutknecht, Variants of biCGStab for matrices with complex spectrum, IPS Research Report 91-14, ETH Zurich, (1991).
44. I.S. Duff, R.G. Grimes and J.G. Lewis, Sparse matrix test problems, ACM Trans. Math Soft. 15, 1-14 (1989).