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
The purpose of this thesis is to study the factors involved in determining a most efficient method f...
Fully parallel Runge-Kutta-Nyström methods are introduced and their properties of accuracy, stabilit...
AbstractA variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work p...
AbstractConsiderable work has been done comparing the relative efficiencies of linear multi-step, Ru...
Ordinary differential equations (ODEs), and the systems of such equations, are used for describing m...
The numerical solution of ordinary differential equations (ODE's) can be a computationally intensive...
In this thesis, we compute approximate solutions to initial value problems of first-order linear ODE...
Benchmarking of ODE methods has a long tradition. Several sets of test problems have been developed ...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration of ...
In this paper I solved three first-order ordinary differential equations (ode) both analytically and...
Numerical methods for ordinary initial value problems that do not depend on special properties of th...
AbstractWe investigate the potential for efficient implementation of two-step Runge-Kutta methods (T...
Abstract. We provide a theoretical analysis of the processing technique for the numerical integratio...
A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step)...
The purpose of this thesis is to study the factors involved in determining a most efficient method f...
Fully parallel Runge-Kutta-Nyström methods are introduced and their properties of accuracy, stabilit...
AbstractA variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work p...
AbstractConsiderable work has been done comparing the relative efficiencies of linear multi-step, Ru...
Ordinary differential equations (ODEs), and the systems of such equations, are used for describing m...
The numerical solution of ordinary differential equations (ODE's) can be a computationally intensive...
In this thesis, we compute approximate solutions to initial value problems of first-order linear ODE...
Benchmarking of ODE methods has a long tradition. Several sets of test problems have been developed ...
Abstract. Implicit integration schemes for ODEs, such as Runge-Kutta and Runge-Kutta-Nyström method...
In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration of ...
In this paper I solved three first-order ordinary differential equations (ode) both analytically and...
Numerical methods for ordinary initial value problems that do not depend on special properties of th...
AbstractWe investigate the potential for efficient implementation of two-step Runge-Kutta methods (T...
Abstract. We provide a theoretical analysis of the processing technique for the numerical integratio...
A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step)...
The purpose of this thesis is to study the factors involved in determining a most efficient method f...
Fully parallel Runge-Kutta-Nyström methods are introduced and their properties of accuracy, stabilit...
AbstractA variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work p...