Abstract
In the previous chapter we derived a simple finite difference method, namely the explicit Euler method, and we indicated how this can be analysed so that we can make statements concerning its stability and order of accuracy. If Euler’s method is used with constant time step h then it is convergent with an error of order O(h) for all sufficiently smooth problems. Thus, if we integrate from 0 to 1 with step \(h = 1{0}^{-5}\), we will need to perform 105 function evaluations to complete the integration and obtain a solution with error O(h). To achieve extra accuracy using this method we could reduce the step size h. This is not in general efficient and in many cases it is preferable to use higher order methods rather than decreasing the step size with a lower order method to obtain higher accuracy. One of the main differences between Euler’s and higher order methods is that, whereas Euler’s method uses only information involving the value of y and its derivative (slope) at the start of the integration interval to advance to the next integration step, higher order methods use information at more than one point. There exist two important classes of higher order methods that we will describe here, namely Runge-Kutta methods and linear multistep methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Notwithstanding these intermediate stages or steps, you should not be tempted to call a Runge-Kutta method a “multistep” method. This terminology is reserved for a totally different type of method (Sect. 2.2).
References
Aceto, L., & Magherini, C. (2009). On the relations between \(\mathrm{{B}}_{2}\mathrm{VMs}\) and Runge-Kutta collocation methods. Journal of Computational and Applied Mathematics, 231(1), 11–23.
Ascher, U. M., & Petzold, L. R. (1998). Computer methods for ordinary differential equations and differential-algebraic equations. Philadelphia: SIAM.
Ascher, U. M., Mattheij, R. M. M., & Russell, R. D. (1995). Numerical solution of boundary value problems for ordinary differential equations. Philadelphia: SIAM.
Axelsson, A. O. H., & Verwer, J. G. (1985). Boundary value techniques for initial value problems in ordinary differential equations. Mathematics of Computation, 45(171), 153–171, S1–S4.
Björck, Ȧ., & Dahlquist, G. (1974). Numerical methods. Englewood Cliffs: Prentice-Hall (Translated from the Swedish by Ned Anderson, Prentice-Hall Series in Automatic Computation).
Bogacki, P., & Shampine, L. F. (1989). A 3(2) pair of Runge–Kutta formulas. Applied Mathematics Letters, 2, 1–9.
Brugnano, L., & Magherini, C. (2004). The BiM code for the numerical solution of ODEs. Journal of Computational and Applied Mathematics, 164–165, 145–158.
Brugnano, L., & Trigiante, D. (1998). Solving differential problems by multistep initial and boundary value methods: Vol. 6. Stability and control: Theory, methods and applications. Amsterdam: Gordon and Breach Science Publishers.
Butcher, J. C. (1987). The numerical analysis of ordinary differential equations, Runge–Kutta and general linear methods (Vol. 2). Chichester/New York: Wiley.
Cash, J. R. (1980). On the integration of stiff systems of ODEs using extended backward differentiation formulae. Numerische Mathematik, 34, 235–246.
Cash, J. R., & Considine, S. (1992). An MEBDF code for stiff initial value problems. ACM Transactions on Mathematical Software, 18(2), 142–158.
Cash, J. R., & Karp, A. H. (1990). A variable order Runge–Kutta method for initial value problems with rapidly varying right-hand sides. ACM Transactions on Mathematical Software, 16, 201–222.
Curtiss, C. F., & Hirschfelder, J. O. (1952). Integration of stiff systems. Proceedings of the National Academy of Science, 38, 235–243.
Dahlquist, G. (1963). A special stability problem for linear multistep methods. BIT, 3, 27–43.
Dormand, J. R., & Prince, P. J. (1980). A family of embedded Runge–Kutta formulae. Journal of Computational and Applied Mathematics, 6, 19–26.
Dormand, J. R., & Prince, P. J. (1981). High order embedded Runge–Kutta formulae. Journal of Computational and Applied Mathematics, 7, 67–75.
Fehlberg, E. (1967). Klassische Runge–Kutta formeln funfter and siebenter ordnung mit schrittweiten-kontrolle. Computing (Arch. Elektron. Rechnen), 4, 93–106.
Fox, L. (1954). A note on the numerical integration of first-order differential equations. The Quarterly Journal of Mechanics and Applied Mathematics, 7, 367–378.
Gear, C. W. (1971). Numerical initial value problems in ordinary differential equations. Englewood Cliffs: Prentice-Hall.
Hairer, E., & Wanner, G. (1996). Solving ordinary differential equations II: Stiff and differential-algebraic problems. Heidelberg: Springer.
Hairer, E., Norsett, S. P., & Wanner, G. (2009). Solving ordinary differential equations I: Nonstiff problems (2nd rev. ed.). Heidelberg: Springer.
Henrici, P. (1962). Discrete variable methods in ordinary differential equations. New York: Wiley.
Hindmarsh, A. C. (1980). LSODE and LSODI, two new initial value ordinary differential equation solvers. ACM-SIGNUM Newsletter, 15, 10–11.
Iavernaro, F., & Mazzia, F. (1998). Solving ordinary differential equations by generalized Adams methods: Properties and implementation techniques. Applied Numerical Mathematics, 28(2–4), 107–126. ( Eighth Conference on the Numerical Treatment of Differential Equations, Alexisbad, 1997).
Iavernaro, F., & Mazzia, F. (1999) Block-boundary value methods for the solution of ordinary differential equations. SIAM Journal on Scientific Computing, 21(1), 323–339 (electronic).
Krogh, F. T. (1969) VODQ/SVDQ/DVDQ, Variable order integrators for the numerical solution of ordinary differential equations. Pasadena, Calif: Jet Propulsion Laboratory.
Krogh, F. T. (1969). A variable step, variable order multistep method for the numerical solution of ordinary differential equations. In Information processing 68 (Proceedings of the IFIP congress, Edinburgh, 1968): Vol. 1. Mathematics, software (pp. 194–199). Amsterdam: North-Holland.
Kutta, W. (1901). Beitrag zur naeherungsweisen integration totaler differentialgleichungen. Zeitschrift fur Mathematik und Physik, 46, 435–453.
Lambert, J. D. (1973). Computational methods in ordinary differential equations. London/New York: Wiley.
Petzold, L. R. (1982). A description of DASSL: a differential/algebraic system solver. IMACS Transactions on Scientific Computation.
Petzold, L. R. (1983). Automatic selection of methods for solving stiff and nonstiff systems of ordinary differential equations. SIAM Journal on Scientific and Statistical Computing, 4, 136–148.
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1992) Numerical recipes in FORTRAN. The art of scientific computing (2nd ed.). New York: Cambridge University Press.
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (2007) Numerical recipes (3rd ed.). Cambridge/New York: Cambridge University Press.
Runge, C. (1895). Ueber die numerische aufloesung von differentialgleichungen. Mathematische Annalen, 46, 167–178.
Rutishauser, H. (1952). uber die instabilitat von methoden zur integration gewohnlicher differentialgleichungen. Zeitschrift fur angewandte Mathematik und Physik, 3, 65–74.
Shampine, L. F. (1977). Stiffness and nonstiff differential equation solvers. ii detecting stiffness with Runge–Kutta methods. ACM Transactions on Mathematical Software, 3, 44–53.
Shampine, L. F. (1979). Type-insensitive ODE codes based on implicit A-stable formulas (pp. 79–244). Livermore: SAND, Sandia National Laboratories.
Shampine, L. F. (1980). Lipschitz constants and robust ODE codes. In Computational methods in nonlinear mechanics (pp. 47–449). Amsterdam: North Holland.
Shampine, L. F., & Gordon, M. K. (1975). Computer solution of ordinary differential equations. The initial value problem. San Francisco: W.H. Freeman.
Shampine, L. F., & Hiebert, K. L. (1977). Detecting stiffness with the Fehlberg (4, 5) formulas. Computers and Mathematics with Applications, 3(1), 41–46.
Shampine, L. F., & Watts, H. A. (1969). Block implicit one-step methods. Mathematics of Computation, 23, 731–740.
Skelboe, S. (1977). The control of order and steplength for backward differentiation methods. BIT, 17, 91–107.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soetaert, K., Cash, J., Mazzia, F. (2012). Initial Value Problems. In: Solving Differential Equations in R. Use R!. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28070-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-28070-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28069-6
Online ISBN: 978-3-642-28070-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)