Skip to main content

Part of the book series: Nato Advanced Study Institutes Series ((ASIC,volume 2))

Abstract

In this paper we consider various iterative methods for solving systems of linear algebraic equations. We shall be primarily concerned with large systems with sparse matrices such as arise in the solution of elliptic boundary value problems in two dimensions by finite difference methods. Our discussion is divided into two parts: First, we review the well-known facts about such methods as the Jacobi, Gauss-Seidel, and successive overrelaxation methods. A treatment of various acceleration techniques is included. In the second part of the paper we consider the symmetric overrelaxation method and describe some practical procedures which can be used to obtain very rapid convergence. By showing that the method can be very effective in many cases and by outlining a definite procedure for its application, we hope to encourage its wider usage and to stimulate further research.

Work on this paper was supported in part by the U.S.Army Research Office (Durham), grant DA-ARO-D-31-124-734 at The University of Texas at Austin.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Bibliography

  1. Axelsson, O. “A generalized SSOR method,” BIT 13, 443–467 (1972).

    Article  MathSciNet  Google Scholar 

  2. Carré, B. A. “The determination of the optimum accelerating factor for successive over-relaxation,” The Computer Journal 4, 73–78 (1961).

    Article  MATH  Google Scholar 

  3. Concus, Paul, and Gene H. Golub. “Use of fast direct methods for the efficient numerical solution of nonseparable elliptic equations,” Report STAN-CS-72-278, Computer Science Department, Stanford University, April 1972.

    Google Scholar 

  4. Golub, G. H. “The use of Chebyshev matrix polynomials in the iterative solution of linear systems compared with the method of successive overrelaxation,” doctoral thesis, University of Illinois, Urbana, Illinois (1959).

    Google Scholar 

  5. Golub, G. H., and R. S. Varga. “Chebyshev semi-iterative methods, successive, overrelaxation iterative methods, and second-order Richardson iterative methods,” Numer. Math., Parts I and II, 3, 147–168 (1961).

    Article  MathSciNet  Google Scholar 

  6. Hageman, L. A., and R. B. Kellogg, “Estimating optimum over-relaxation parameters,” Math. Comp. 22, 60–68 (1968).

    Article  MathSciNet  MATH  Google Scholar 

  7. Kahan, W. “Gauss-Seidel methods of solving large systems of linear equations,” doctoral thesis, University of Toronto, Toronto, Canada (1958).

    Google Scholar 

  8. Kulsrud, H. E. “A practical technique for the determination of the optimum relaxation factor of the successive over-relaxation method,” Comm. Assoc. Comput. Mach. 4, 184–187 (1961).

    MathSciNet  MATH  Google Scholar 

  9. Reid, J. K. “A method for finding the optimum successive over-relaxation parameter,” The Computer Journal 9, 200–204 (1966).

    MathSciNet  MATH  Google Scholar 

  10. Richardson, L. F. “The approximate arithmetical solution by finite differences of physical problems involving differential equations with an application to the stresses in a masonry dam,” Philos. Trans. Roy. Soc. London Ser. A 210, 307–357 (1910).

    Article  Google Scholar 

  11. Rigler, A. K. “Estimation of the successive over-relaxation factor,” Math. of Comp. 19, 302–307 (1965).

    Article  MathSciNet  MATH  Google Scholar 

  12. Sheldon, J. “On the numerical solution of elliptic difference equations,” Math. Tables Aids Comput. 9, 101–112 (1955).

    Article  MathSciNet  MATH  Google Scholar 

  13. Wachspress, E. L. “Iterative Solution of Elliptic Systems and Applications to the Neutron Diffusion Equations of Reactor Physics,” Prentice-Hall, Englewood Cliffs, New Jersey (1966).

    MATH  Google Scholar 

  14. Young, David M. “Ordvac solutions of the Dirichlet problem,” J. Assoc. Comput. Mach. 2, 137–161 (1955).

    MathSciNet  Google Scholar 

  15. — “On the solution of linear systems by iteration,” Proc. Sixth Symp. in Appl. Math. Amer. Math. Soc. VI, McGraw-Hill, New York (1956).

    Google Scholar 

  16. —. “Iterative Solution of Large Linear Systems,” Academic Press, New York (1971).

    MATH  Google Scholar 

  17. —. “A bound on the optimum relaxation factor for the successive overrelaxation method,” Numer. Math. 16, 408–413 (1971).

    Article  MATH  Google Scholar 

  18. —. “Second-degree iterative methods for the solution of large linear systems,” J. Approx. Theory 25, 137–148 (1972).

    Article  Google Scholar 

  19. —. “On the accelerated SSOR method for solving large linear systems,” to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1973 D. Reidel Publishing Company, Dordrecht

About this paper

Cite this paper

Young, D.M. (1973). Solution of Linear Systems of Equations. In: Gram, J.G. (eds) Numerical Solution of Partial Differential Equations. Nato Advanced Study Institutes Series, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-2672-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-2672-7_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-2674-1

  • Online ISBN: 978-94-010-2672-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics