Skip to main content

Gradient alternating-direction methods

  • Conference paper
  • First Online:
Book cover Equadiff IV

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

  • 375 Accesses

Abstract

The gradient methods considered are not better than the algorithms based on the minimization of the spectral radius of the transition operator as far as the asymptotic rate of convergence is concerned. At the same time they are somewhat worse as concerns the economy of computation. On the other hand, our opinion is that the bounds and illustrative numerical experiments presented indicate that their efficiency is sufficiently good. Gradient methods possess suitable relaxation properties for small values of n (including also singular matrices). Apparently the nonlinear problem of the choice of parameters τ n from variational considerations needs further investigation.

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. Birkhof G., Varga R., Young D. Alternating direction implicit methods. Advances in computers, 1962, v.4, 140–274.

    Google Scholar 

  2. Samarskii A.A. Introduction into the Theory of Difference Schemes. Nauka, Moscow 1972. (Russian)

    Google Scholar 

  3. Marčuk G.I., Kuznecov J.A. Iteration Methods and Quadratic Functionals. Nauka, Novosibirsk 1972. (Russian)

    Google Scholar 

  4. Il'in V.P. Difference Methods for the Solution of Elliptic Equations. Izd. NGU, Novosibirsk 1970. (Russian)

    Google Scholar 

  5. Il'in V.P. Some bounds for the conjugate gradient methods. Ž. Vyčisl. Mat. i Mat. Fiz. 16 (1976), 847–855. (Russian)

    Google Scholar 

  6. Kantorovič L.V. On the method of steepest descent. Dokl. Akad. Nauk SSSR 3 (1947), 233–236. (Russian)

    MathSciNet  Google Scholar 

  7. Krasnosel'skii M.A., Krein S.G. An iteration process with minimum residuals. Mat. Sb. 31 (73) (1952), 315–334. (Russian)

    MathSciNet  Google Scholar 

  8. Hestenes M., Stiefel E. Method of conjugate gradient for solving linear systems. J. Res. Nat. Bur. Standarta, 1952, 49, 409–436.

    Article  MathSciNet  MATH  Google Scholar 

  9. Hestenes M. The conjugate gradient method for solving linear systems. Proc. Sympos. Appl. Math., v.6, New-York-Toronto-London, 1956, 83–102.

    Google Scholar 

  10. Godunov S.K., Prokopov G.P. On the solution of the Laplace difference equation. Ž. Vyčisl. Mat. i Mat. Fiz. 9 (1969), 462–468. (Russian)

    MathSciNet  Google Scholar 

  11. Gorbenko N.I., Il'in V.P. On gradient alternating-direction methods. In: Nekotorye problemy vyčislitel'noi i prikladnoi matematiki, Nauka, Novosibirsk 1975, 207–214. (Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jiří Fábera

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Spring-Verlag

About this paper

Cite this paper

Il'in, V. (1979). Gradient alternating-direction methods. In: Fábera, J. (eds) Equadiff IV. Lecture Notes in Mathematics, vol 703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067269

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09116-5

  • Online ISBN: 978-3-540-35519-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics