Skip to main content
Log in

Remarks on Picard-Lindelöf iteration

Part I

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The paper discusses Picard-Lindelöf iteration for systems of autonomous linear equations on finite intervals, as well as its numerical variants. Most of the discussion is under a model assumption which roughly says that the coupling terms are of moderate size compared with the slow time scales in the problem. It is shown that the speed of convergence is quite independent of the step sizes already for very large time steps. This makes it possible to design strategies in which the mesh gets gradually refined during the iteration in such a way that the iteration error stays essentially on the level of discretization error.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. W. H. Beyer, ed.:CRC Standard Mathematical Tables, CRC Press, Inc., Boca Ration, 27th Edition, 1986.

    Google Scholar 

  2. G. Dahlquist:G-stability is equivalent to A-stability, BIT 18 (1978), 384–401.

    Google Scholar 

  3. I. S. Gradshteyn, I. M. Ryzhik:Table of Integrals, Series and Products. English edition. Scripta Technica, Inc. New York, London, 1965.

    Google Scholar 

  4. E. Hairer, S. P. Nørsett, G. Wanner:Solving Ordinary Differential Equations I, Springer-Verlag, Berlin-Heidelberg, 1987.

    Google Scholar 

  5. P. Henrici:Discrete Variable Methods in Ordinary Differential Equations, John Wiley & Sons, Inc., New York-London-Sydney, 1962.

    Google Scholar 

  6. E. Lelarasmee, A. E. Ruehli, A. L. Sangiovanni-Vincentelli:The waveform relaxation methods for time-domain analysis of large scale integrated circuits, IEEE Trans, on CAD of IC and Syst.,1, 3 (1982), 131–145.

    Google Scholar 

  7. R. J. LeVeque, L. N. Trefethen:On the resolvent condition in the Kreiss matrix theorem, BIT24, (1984), 584–591.

    Google Scholar 

  8. E. Lindelöf:Sur l'application des méthodes d'approximations successives à l'étude des intégrales réelles des équations differentielles ordinaires, J. de Math. Pures et Appl, 4e série,10 (1984), 117–128.

    Google Scholar 

  9. Ch. Lubich, A. Ostermann:Multigrid dynamic iteration for parabolic equations, BIT27 (1987), 216–234.

    Google Scholar 

  10. U. Miekkala:Dynamic iteration methods applied to linear DAE systems, Helsinki University of Technology, Report-Mat-A252 (1987), to appear in Journal CAM.

  11. U. Miekkala, O. Nevanlinna:Convergence of dynamic iteration methods for initial value problems, SIAM J. Sci. Stat. Comput.,8 (1987), 459–482.

    Google Scholar 

  12. U. Miekkala, O. Nevanlinna:Sets of convergence and stability regions, BIT 27 (1987), 554–584.

    Google Scholar 

  13. W. E. Milne:Numerical Solution of Differential Equations, John Wiley & Sons, Inc., London 1953.

    Google Scholar 

  14. D. Mitra:Asynchronous relaxations for the numerical solution of differential equations by parallel processors, SIAM J. Sci. Stat. Comput.8 (1987), s43-s58.

    Google Scholar 

  15. O. Nevanlinna, F. Odeh:Remarks on the convergence of waveform relaxation method, Numer. Funct. Anal. Optimiz.,9 (1987), 435–445.

    Google Scholar 

  16. E. Picard:Sur l'application des méthodes d'approximations successives à l'étude de certaines équations différentielles ordinaires, J. de Math. Pures et Appl. 4e série,9 (1893), 217–271.

    Google Scholar 

  17. J. White, F. Odeh, A. S. Vincentelli, A. Ruehli:Waveform relaxation: theory and practice, UC Berkeley, Memorandum No UCB/ERL M85/65 (1985).

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by the Academy of Finland and by the Institute for Mathematics and its Applications (IMA, Minneapolis with funds provided by NSF). Ulla Miekkala visited IMA with a grant from Tekniikan edisstämissäätiö and carried out the numerical tests.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nevanlinna, O. Remarks on Picard-Lindelöf iteration. BIT 29, 328–346 (1989). https://doi.org/10.1007/BF01952687

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Subject classifications AMS

Keywords

Navigation