Skip to main content
SpringerLink
Log in

A note on the “nested iterations” method

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. Kronsjö and G. Dahlquist,On the Design of Nested Iterations for Elliptic Difference Equations, BIT 11 (1971), 63–71.

    Google Scholar 

  2. V. Pereyra,Accelerating the Convergence of Discretization Algorithms, SIAM J. Numer. Anal., 4, No. 4, (1967).

  3. R. P. Fedorenko,A Relaxation Method of Solution of Elliptic Difference Equations, J. of Comp. Maths. and Math. Phys., 1, No. 5 (1961), 922–927 (Russian).

    Google Scholar 

  4. R. P. Fedorenko,On Convergence of an Iteration Process, J. of Comp. Maths. and Math. Phys., 4, No. 3 (1964), 559–564 (Russian).

    Google Scholar 

  5. N. S. Bachvalov,Convergence of a Relaxation Method under Natural Constraints on an Elliptic Operator, J. of Comp. Maths. and Math. Phys., 6, No. 5 (1966), 861–883 (Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Centre, University of Birmingham, B15 2TT, Birmingham, England

    Lydia Kronsjö

Authors
  1. Lydia Kronsjö
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kronsjö, L. A note on the “nested iterations” method. BIT 15, 107–110 (1975). https://doi.org/10.1007/BF01933003

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation