AbstractConsiderable work has been done comparing the relative efficiencies of linear multi-step, Runge-Kutta, and extrapolation methods within their respective classes. However, efficiency comparisons between these classes have been relegated to numerical case studies, which can be misleading because they depend on a small set of test problems and particular implementations of the methods. In this paper a unified way of comparing efficiency is presented that makes it possible to assess theoretically the relative efficiencies of methods from the different classes
AbstractThis paper investigates the performance of two explicit pseudo two-step Runge-Kutta methods ...
In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration of ...
In this thesis, we compute approximate solutions to initial value problems of first-order linear ODE...
AbstractConsiderable work has been done comparing the relative efficiencies of linear multi-step, Ru...
AbstractA pair of explicit Runge-Kutta formulas of orders 4 and 5 is derived. It is significantly mo...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
A pair of explicit Runge-Kutta formulas of orders 4 and 5 is derived. It is significantly more effic...
AbstractWe investigate the potential for efficient implementation of two-step Runge-Kutta methods (T...
Ordinary differential equations (ODEs), and the systems of such equations, are used for describing m...
AbstractA very simple way of selecting the step size when solving an initial problem for a system of...
AbstractThe solution of the initial value problem for a system of ordinary differential equations (O...
Report on numerical methods of integration includes the extrapolation methods of Bulirsch-Stoer and ...
A class of Runge-Kutta formulas is examined which permit the calculation of an accurate solution any...
The numerical solution of ordinary differential equations (ODE's) can be a computationally intensive...
As we know Runge-Kutta method is a one step method hence it is quite limited in terms of implementat...
AbstractThis paper investigates the performance of two explicit pseudo two-step Runge-Kutta methods ...
In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration of ...
In this thesis, we compute approximate solutions to initial value problems of first-order linear ODE...
AbstractConsiderable work has been done comparing the relative efficiencies of linear multi-step, Ru...
AbstractA pair of explicit Runge-Kutta formulas of orders 4 and 5 is derived. It is significantly mo...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
A pair of explicit Runge-Kutta formulas of orders 4 and 5 is derived. It is significantly more effic...
AbstractWe investigate the potential for efficient implementation of two-step Runge-Kutta methods (T...
Ordinary differential equations (ODEs), and the systems of such equations, are used for describing m...
AbstractA very simple way of selecting the step size when solving an initial problem for a system of...
AbstractThe solution of the initial value problem for a system of ordinary differential equations (O...
Report on numerical methods of integration includes the extrapolation methods of Bulirsch-Stoer and ...
A class of Runge-Kutta formulas is examined which permit the calculation of an accurate solution any...
The numerical solution of ordinary differential equations (ODE's) can be a computationally intensive...
As we know Runge-Kutta method is a one step method hence it is quite limited in terms of implementat...
AbstractThis paper investigates the performance of two explicit pseudo two-step Runge-Kutta methods ...
In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration of ...
In this thesis, we compute approximate solutions to initial value problems of first-order linear ODE...