Skip to main content
  • 535 Accesses

Abstract

The one-step finite-difference methods of the previous chapter, with the possible exception of the trapezoidal rule method, are basically rather too uneconomic for general use. Their local truncation error is of rather low order, with the result that to achieve good accuracy we need to use either: (a) a rather small step-by-step interval, involving many steps to cover a specified range; or (b) one of our correcting devices which involve some additional computation and more computer programming. The special one-step methods of the previous chapter, the Taylor series method and the explicit Runge-Kutta methods, do not share these disadvantages, but they involve extra computer storage, the Taylor series method involves a possibly large amount of non-automatic differentiation, and with the Runge—Kutta methods we have to compute possibly rather complicated expressions several times in each step. Moreover, both these methods have rather poor partial stability properties.

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 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. J.D. Lambert (1973), Computational Methods in Ordinary Differential Equations, Wiley

    Google Scholar 

  2. C.W. Gear (1971), Numerical Initial-value Problems in Ordinary Differential Equations, Prentice-Hall.

    Google Scholar 

  3. L.F. Shampine and M.K. Gordon (1975), Computer Solution of Ordinary Differential Equations: The Initial-value Problem, Freeman.

    Google Scholar 

  4. G. Hall and J.M. Watt (Eds.) (1976), Modern Numerical Methods for Ordinary Differential Equations (proceedings of Liverpool-Manchester Summer School), Clarendon Press, Oxford

    Google Scholar 

  5. I. Gladwell and D. Sayers (Eds.) (1980), Computational Techniques for Ordinary Differential Equations (proceedings of an I.M.A. Symposium), Academic Press.

    Google Scholar 

  6. A.R. Curtis (1980), The FACSIMILE numerical integrator for stiff initial- value problems.

    Google Scholar 

  7. D. Barton, J.M. Willers and R.V.M. Zahar (1972), Taylor series method for ordinary differential equations (in Mathematical Software, Ed. J.R. Rice), Academic Press.

    Google Scholar 

  8. D. Barton (1980), On Taylor series and stiff systems. TOMS, 6, 280–294.

    Article  Google Scholar 

  9. G. Corliss and Y.F. Chang (1982) Solving ordinary differential equations using Taylor series. TOMS, 8, 114–144.

    Google Scholar 

  10. J.R. Cash (1983), Block Runge-Kutta methods for the numerical integration of initial-value problems in ordinary differential equations. I The non-stiff case. Math. Comp ., 40, 175–191.

    Google Scholar 

  11. J.R. Cash (1983), Block Runge-Kutta methods for the numerical integration of initial-value problems in order differential equations. II The stiff case. Math. Comp ., 40, 193–206.

    Google Scholar 

  12. J.C. Butcher, K. Burrage and F.H. Chipman (1979), STRIDE: Stable Runge-Kutta integration for differential equations. Report Series No. 150 (Computational Mathematics No. 20), Dept. of Mathematics, University of Auckland.

    Google Scholar 

  13. L. Fox and E.T. Goodwin (1949), Some new methods for the numerical integration of ordinary differential equations. Proc. Camb. Phil Soc ., 45, 373–388.

    Article  Google Scholar 

  14. R.K. Jain, N.S. Kambo and R. Goel (1984), A sixth-order P-stable symmetric multi-step method for periodic initial-value problems of second- order differential equations. I.M.A.J. Num. Anal., 4, 117–125.

    Google Scholar 

  15. L. Fox, D.F. Mayers, J.R. Ockendon and A.B. Taylor (1971), On a functional differential equation. J. Inst. Maths. Applies., 8, 271–307.

    Article  Google Scholar 

  16. C.W. Cryer (1972), Numerical methods for functional differential equations, pp. 97–102 of Delay and Functional Differential Equations and Their Applications. (Ed. K. Schmitt), Academic Press.

    Google Scholar 

  17. E. Hansen (Ed.) (1969), Topics in Interval Analysis, Clarendon Press, Oxford.

    Google Scholar 

  18. Kruckeberg (1969), Ordinary differential equations (from reference [27]).

    Google Scholar 

  19. K.L.E. Nickel (1980),Interval Mathematics. Academic Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Fox and Mayers

About this chapter

Cite this chapter

Fox, L., Mayers, D.F. (1987). Initial-value problems: multi-step methods. In: Numerical Solution of Ordinary Differential Equations. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3129-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-3129-9_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7907-5

  • Online ISBN: 978-94-009-3129-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics