Pseudo-Runge-Kutta Methods of the Fifth Order
William Gruttke
Abstract
Open-access reader
William Gruttke
Abstract
Open-access reader
A family of fifth-order pseudo-Runge-Kutta methods for the numerical solution of systems of ordinary differential equations is presented. A procedure for determining an “optimal” set of parameters is given, and several examples are considered. The principal advantage of these methods is that, for a fixed stepsize, they require two less function evaluations at each step than do the corresponding fifth-order Runge-Kutta methods. Their principal disadvantage is that they are not self-starting; they require two initial values. Numerically, pseudo-Runge-Kutta and Runge-Kutta methods seem to be comparable.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A family of fifth-order pseudo-Runge-Kutta methods for the numerical solution of systems of ordinary differential equations is presented. A procedure for determining an “optimal” set of parameters is given, and several examples are considered. The principal advantage of these methods is that, for a fixed stepsize, they require two less function evaluations at each step than do the corresponding fifth-order Runge-Kutta methods. Their principal disadvantage is that they are not self-starting; they require two initial values. Numerically, pseudo-Runge-Kutta and Runge-Kutta methods seem to be comparable.
Key concepts: Runge–Kutta methods, Ordinary differential equation, Mathematics, Applied mathematics, Set (abstract data type), Function (biology), Principal (computer security), Differential equation