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. © 2012 Springer-Verlag.
CITATION STYLE
Akanbi, M. A., Okunuga, S. A., & Sofoluwe, A. B. (2012). Step size bounds for a class of multiderivative explicit Runge-Kutta methods. In Lecture Notes in Business Information Processing (Vol. 115 LNBIP, pp. 188–197). Springer Verlag. https://doi.org/10.1007/978-3-642-30433-0_19
Mendeley helps you to discover research relevant for your work.