Skip to main content

Some observations on the generalized conjugate gradient method

  • Conference paper
  • First Online:
Numerical Methods

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1005))

Abstract

As we have seen, if systems of the form Mz=d are “easy” to solve, then GCG is better than CSP. If not, then CSP is superior. Of course, it is not clear that either method is the best possible for this class of problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rati Chandra. Conjugate Gradient Methods for Partial Differential Equations. Ph.D. Thesis, Department of Computer Science, Yale University, 1978. Also available as Research Report #129.

    Google Scholar 

  2. Paul Concus and Gene H. Golub. A generalized conjugate gradient method for nonsymmetric systems of linear equations. In R. Glowinski and J. L. Lions, Editors, Lecture Notes in Economics and Mathematical Systems, Volume 134, Springer Verlag, 1976, pp. 56–65.

    Google Scholar 

  3. R. S. Dembo, S. C. Eisenstat, and T. Steihaug. Inexact Newton methods. SIAM Journal on Numerical Analysis 19(2):400–408 (1982).

    Article  MathSciNet  MATH  Google Scholar 

  4. Stanley C. Eisenstat. A Note on the Generalized Conjugate Gradient Method. Technical Report #228, Department of Computer Science, Yale University, 1982. To appear in SIAM Journal on Numerical Analysis.

    Google Scholar 

  5. Howard C. Elman. Iterative Methods for Large, Sparse, Nonsymmetric Systems of Linear Equations. Ph.D. Thesis, Department of Computer Science, Yale University, 1982. Also available as Technical Report #229.

    Google Scholar 

  6. D. K. Faddeev and V. N. Faddeeva. Computational Methods of Linear Algebra. W. H. Freeman and Company, San Francisco, 1963.

    MATH  Google Scholar 

  7. Gene H. Golub and Michael L. Overton. Convergence of a two-stage Richardson iterative procedure for solving systems of linear equations. In G. A. Watson, Editor, Lecture Notes in Mathematics, Volume 912, Springer Verlag, 1982, pp. 125–139. Proceedings of the 9th Biennial Conference, Dundee, Scotland, June 23–26, 1981.

    Google Scholar 

  8. L. A. Hageman, Franklin T. Luk, and David M. Young. On the equivalence of certain iterative acceleration methods. SIAM Journal on Numerical Analysis 17:852–873 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  9. P. Swarztrauber and R. Sweet. Efficient FORTRAN Subprograms For the Solution of Elliptic Equations. Technical Report TN/IA-109, NCAR, July 1975.

    Google Scholar 

  10. Olof Widlund. A Lanczos method for a class of nonsymmetric systems of linear equations. SIAM Journal on Numerical Analysis 15:801–812 (1978).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Eisenstat, S.C. (1983). Some observations on the generalized conjugate gradient method. In: Numerical Methods. Lecture Notes in Mathematics, vol 1005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0112527

Download citation

  • DOI: https://doi.org/10.1007/BFb0112527

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12334-7

  • Online ISBN: 978-3-540-40967-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics