Skip to main content

Step Size Bounds for a Class of Multiderivative Explicit Runge–Kutta Methods

  • Conference paper
Modeling and Simulation in Engineering, Economics and Management (MS 2012)

Abstract

A class of 3-Stage Multiderivative Explicit Runge-Kutta Methods was developed for the solution of Initial Value Problems (IVPs) in Ordinary Differential Equations. In this work, we present the bounds on the step size required for the implementation of this family of methods. This bound is one of the parameter required in the design of program codes for solving IVPs. A comparison of the step size bound was made vis-a-vis the existing Explicit Runge-Kutta Methods using some standard problems. The computation shows that the family of methods competes well with the popular methods.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Akanbi, M.A., Okunuga, S.A., Sofoluwe, A.B.: Error Bounds for 2-stage Multiderivative Explicit Runge-Kutta Methods. Adv. in Modelling & Analysis, A.M.S.E. 45(2), 57–72 (2008)

    MathSciNet  Google Scholar 

  2. Akanbi, M.A., Okunuga, S.A.: On Region of Absolute Stability and Convergence of 3-stage Multiderivative Explicit Runge-Kutta Methods. Journal Sci. Res. & Dev. 10, 83–100 (2005/2006)

    Google Scholar 

  3. Bulirsh, R., Steor, J.: Asymptotic Upper and Lower Bounds for Results of Extrapolation Methods. Numerische Mathematik 8, 93–104 (1966)

    Article  MathSciNet  Google Scholar 

  4. Butcher, J.C.: Numerical methods for Ordinary Differential Equations in the 20th century. J. Comput. Appl. Math. 125, 1–29 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Butcher, J.C.: Numerical methods for Ordinary Differential Equations, 2nd edn. John Wiley & Sons Ltd., Chichester (2008)

    Book  MATH  Google Scholar 

  6. Fatunla, S.O.: Numerical Methods for IVPs in ODEs. Academic Press Inc., USA (1988)

    Google Scholar 

  7. Henrici, P.: Discrete Variable Methods in ODE. John Wiley & Sons, New York (1962)

    Google Scholar 

  8. Lambert, J.D.: Computational Methods in ODEs. John Wiley & Sons, New York (1973)

    Google Scholar 

  9. Lambert, J.D.: Numerical Methods for Ordinary Differential Systems: The Initial Value Problem. John Wiley & Sons, England (1991)

    MATH  Google Scholar 

  10. Lotkin, W.: On the Accuracy of R-K Methods. MTAC 5, 128–132 (1951)

    MathSciNet  MATH  Google Scholar 

  11. Shampine, L.F., Baca, L.S.: Global Error Estimates for ODEs based on Extrapolation Methods. SIAM Journal on Scientific and Statistical Computing 6, 1–14 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akanbi, M.A., Okunuga, S.A., Sofoluwe, A.B. (2012). Step Size Bounds for a Class of Multiderivative Explicit Runge–Kutta Methods. In: Engemann, K.J., Gil-Lafuente, A.M., Merigó, J.M. (eds) Modeling and Simulation in Engineering, Economics and Management. MS 2012. Lecture Notes in Business Information Processing, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30433-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30433-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30432-3

  • Online ISBN: 978-3-642-30433-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics