Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Solution of linear systems of equations: Iterative methods

  • Conference paper
  • First Online:
Sparse Matrix Techniques

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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. R.S. Varga, Matrix iterative analysis, Prentice-Hall, New Jersey, 1962.

    Google Scholar 

  2. M.R. Hestenes, Historical papers: Iterative methods for solving linear equations, JOTA 11 (1973), 323–334 and The solution of linear equations by minimization, JOTA 11 (1973), 335–359. Completed on December 12, 1951. The first paper originally appeared as NAML Report No. 52-9, 1951.

    Article  MathSciNet  MATH  Google Scholar 

  3. M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand. B49 (1952), 409–436.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Fletcher and C.M. Reeves, Function minimization by conjugate gradients, Computer Journal 7 (1964), 149–154.

    Article  MathSciNet  MATH  Google Scholar 

  5. E. Polak et G. Ribiére, Note sur la convergence de methodes de directions conjuguees, R. I. R. O. 16-R1 (1969), 35–43.

    MathSciNet  MATH  Google Scholar 

  6. J.W. Daniel, The conjugate gradient method for linear and nonlinear operator equations, SIAM J. Numer. Anal. 4 (1967), 10–26.

    Article  MathSciNet  MATH  Google Scholar 

  7. R. Bartels and J.W. Daniel, A conjugate gradient approach to nonlinear elliptic boundary value problems in irregular regions, CNA 63, The University of Texas at Austin, 1973.

    Google Scholar 

  8. D.J. Evans, The use of preconditioning in iterative methods for solving linear equations with symmetric positive definite matrices, J. Inst. Maths. Applics. (1968) 4, 295–314.

    Article  MATH  Google Scholar 

  9. E.G. D'Yakonov, On an iterative method for the solution of finite difference equations, Dokl. Akad. Nauk SSSR, 138 (1961), 522–525.

    MathSciNet  Google Scholar 

  10. G.J. Habetler and E.L. Wachspress, Symmetric successive overrelaxation in solving diffusion difference equations, Math. Comp. 15 (1961), 356–362.

    Article  MathSciNet  MATH  Google Scholar 

  11. J.E. Gunn, The solution of elliptic difference equations by semi-explicit iterative techniques, SIAM J. Numer. Anal. Ser. B 2 (1964), 24–45.

    MathSciNet  MATH  Google Scholar 

  12. T. Dupont, R.P. Kendall and H.H. Rachford, Jr., An approximate factorization procedure for solving self-adjoint elliptic difference equations, SIAM J. Numer. Anal. 5 (1968), 559–573.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. O. Axelsson, Iterative methods for elliptic problems, CERN DD/72/13, Geneva, 1972.

    Google Scholar 

  15. O. Axelsson, On preconditioning and convergence acceleration in sparse matrix problems, CERN 74-10, Geneva, 1974.

    Google Scholar 

  16. O. Axelsson, A class of iterative methods for finite element equations, Computer methods in applied mechanics and engineering 7 (1976) (to appear).

    Google Scholar 

  17. D.M. Young, Iterative solution of large linear systems, Academic Press, 1971.

    Google Scholar 

  18. M.J.D. Powell, Restart procedures for the conjugate gradient method. C.S.S. 24 (1975), Harwell, England.

    Google Scholar 

  19. J.K. Reid, On the method of conjugate gradients for the solution of large sparse systems of linear equations, in Large sparse sets of linear equations (ed. Reid), Academic Press, 1971.

    Google Scholar 

  20. L.F. Richardson, The approximate arithmetical solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam, Trans. Roy. Soc. London A210 (1911), 307–357

    Article  MATH  Google Scholar 

  21. L.F. Richardson, How to solve differential equations approximately by arithmetic, Math. Gazette, 12 (1925), 415–421.

    Article  MATH  Google Scholar 

  22. V.I. Lebedev, S.A. Finogenov, On the order of choice of the iteration parameters in the Chebyshev cyclic iteration method, Zh. Vychislit. Mat. i Mat. Fiz. 11 (1971), 425 and 13 (1973), 18.

    MathSciNet  MATH  Google Scholar 

  23. O. Axelsson, Lecture notes on Iterative methods, Report 72.04, Department of Computer Sciences, Chalmers University of Technology, Göteborg, Sweden.

    Google Scholar 

  24. D.M. Young, Second degree iterative methods for the solution of large linear systems, J. Approx. Theory 5 (1972), 137.

    Article  MathSciNet  MATH  Google Scholar 

  25. V.I. Lebedev, Iterative methods for the solution of operator equations with their spectrum on several intervals, Zh. Vychislit. Mat. i Mat. Fiz. 9 (1969), 1247–1252.

    Google Scholar 

  26. L. Andersson, SSOR preconditioning of Toeplitz matrices, Thesis, Chalmers University of Technology, Göteborg, Sweden, 1976.

    MATH  Google Scholar 

  27. J. Todd, Introduction to the constructive theory of functions, ISNM vol. 1, Birkhäuser, Basel, 1963.

    Google Scholar 

  28. M. Engeli, Th. Ginsburg, H. Rutishauser, E. Stiefel, Refined iterative methods for computation of the solution and the eigenvalues of self-adjoint boundary value problems, Mitteilungen aus dem Institut für angewandte Mathematik, nr. 8, ETH, Zürich, 1959.

    Google Scholar 

  29. H. Wozniakowski, Numerical stability of iterations for solution of nonlinear equations and large linear systems, Department of Computer Science, Carnegie — Mellon University, 1975.

    Google Scholar 

  30. G. Forsythe, E.G. Straus, On best conditioned matrices, Proc. Amer. Math. Soc. 6 (1955), 340–345.

    Article  MathSciNet  MATH  Google Scholar 

  31. J.A. Meijerink, H.A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, TR-1, Academic Computer Centre, Utrecht, the Netherlands, 1976.

    MATH  Google Scholar 

  32. P. Concus, G.H. Golub, Use of fast direct methods for the efficient numerical solution of nonseparable elliptic equations, STAN-CS-72-278, Stanford University, 1972.

    Google Scholar 

  33. E.L. Wachspress, Iterative solution of elliptic systems and applications to the neutron diffusion equations of reactor physics, Prentice-Hall, 1966.

    Google Scholar 

  34. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand. B 45 (1950), 255–282.

    Article  MathSciNet  Google Scholar 

  35. H. Liebmann, Die angenäherte Ermittelung harmonischer Funktionen und konformer Abbildungen, Bayer. Akad. Wiss., Math-Phys. Klasse, Sitz. (1918), 385–416.

    Google Scholar 

  36. J.W. Sheldon, On the numerical solution of elliptic equations, Math. Tables and other Aids to Comp. 9 (1955), 101–111.

    Article  MathSciNet  MATH  Google Scholar 

  37. A.C. Aitken, On the iterative solution of a system of linear equations, Proc. Roy. Soc. Edinburgh A63 (1950), 52.

    MathSciNet  MATH  Google Scholar 

  38. L.W. Ehrlich, The block symmetric successive overrelaxation method, J. Soc. Indust. Appl. Math. 12 (1964), 807–826.

    Article  MathSciNet  MATH  Google Scholar 

  39. D. Young, On Richardson's method for solving linear systems with positive definite matrices, J. Math. Phys. 32 (1954), 243–255.

    Article  MATH  Google Scholar 

  40. E. Stiefel, Kernel polynomials in linear algebra and their numerical applications, NBS, Appl. Math. Series 49 (1958), 1–22.

    MathSciNet  Google Scholar 

  41. E. Cuthill, J. Mc Kee, Reducing the bandwidth of sparse symmetric matrices, Proc. 24th Nat. Conf. of the ACM, ACM Publ. P-69, New York, (1969), 157–172.

    Google Scholar 

  42. W-H. Liu, A.H. Sherman, Comparative analysis of the Cuthill-Mc Kee and the reverse Cuthill-Mc Kee ordering algorithms for sparse matrices, SIAM J. Numer. Anal. 13 (1976), 198–213.

    Article  MathSciNet  MATH  Google Scholar 

  43. I. Fried, More on gradient iterative methods in finite-element analysis, AIAA Journal 7 (1969), 565–567.

    Article  MATH  Google Scholar 

  44. J. Smith, The coupled equation approach to the numerical solution of the Biharmonic equation by finite differences I, II, SIAM J. Numer. Anal. 5 (1968), 323–339, 7 (1970), 104–111.

    Article  MathSciNet  MATH  Google Scholar 

  45. O. Axelsson, Notes on the numerical solution of the Biharmonic equation, J. Inst. Maths. Applics. 11 (1973), 213–226.

    Article  MathSciNet  MATH  Google Scholar 

  46. L.W. Ehrlich, Solving the Biharmonic equation as coupled finite difference equations, SIAM J. Numer. Anal. 8 (1971), 278–287.

    Article  MathSciNet  MATH  Google Scholar 

  47. J.W. Mc Laurin, A general coupled equation approach for solving the Biharmonic boundary value problem, SIAM J. Numer. Anal. 11 (1974), 14–23.

    Article  MathSciNet  Google Scholar 

  48. M.M. Gupta, Discretization error estimates for certain splitting procedures for solving first Biharmonic boundary value problems, SIAM J. Numer. Anal. 12 (1975), 364–377.

    Article  MathSciNet  MATH  Google Scholar 

  49. T.A. Manteuffel, An iterative method for solving nonsymmetric linear systems with dynamic estimation of parameters, UIUCDCS-R-75-758, University of Illinois at Urbana-Champaign, Illinois, 1975.

    Google Scholar 

  50. P.P. Fedorenko, The speed of convergence of one iterative method, Zh. Vychislit. Mat. Fiz. 4 (1964), 559–564.

    MathSciNet  Google Scholar 

  51. P.O. Fredrickson, Fast approximate inversion of large sparse linear systems, Mathematics Report # 7-75, Lakehead University, 1975.

    Google Scholar 

  52. P. Concus, G.H. Golub, D.P. O'Leary, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, STAN-CS-76-533, Stanford University, 1976.

    Google Scholar 

  53. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10 (1973), 345–363.

    Article  MathSciNet  MATH  Google Scholar 

  54. A. George, Numerical experiments using dissection methods to solve n by n grid problems, Research Report CS-75-07, University of Waterloo, Canada.

    Google Scholar 

  55. R.L. Fox, E.L. Stanton, Developments in structured analysis by direct energy minimization, AIAA Journal 6 (1968), 1036–1042.

    Article  MATH  Google Scholar 

  56. P. Pohl, Iterative improvement without double precision in a boundary value problem, BIT 14 (1974), 361–365.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Sciences, Chalmers University of Technology, S 402 20, Gothenburg, Sweden

    Owe Axelsson

Authors
  1. Owe Axelsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. A. Barker

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

Axelsson, O. (1977). Solution of linear systems of equations: Iterative methods. In: Barker, V.A. (eds) Sparse Matrix Techniques. Lecture Notes in Mathematics, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0116614

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08130-2

  • Online ISBN: 978-3-540-37430-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation