The optimum Runge-Kutta method of a particular order is the one whose truncation error is a minimum. Various measures of the size of the truncation error are considered. The optimum method is practically independent of the measure being used. Moreover, among methods of the same order which one might consider using the difference in size of the estimated error is not more than a factor of 2 or 3...

In this paper we are concerned with the development of an explicit Runge-Kutta scheme for the numerical solution of delay diierential equations (DDEs) where one or more delay lies in the current Runge-Kutta interval. The scheme presented is also applicable to the numerical solution of Volterra functional equations (VFEs), although the theory is not covered in this paper. We also derive the stab...

In Burrage and Burrage (1996) it was shown that by introducing a very general formulation for stochastic Runge-Kutta methods, the previous strong order barrier of order one could be broken without having to use higher derivative terms. In particular, methods of strong order 1.5 were developed in which a Stratonovich integral of order one and one of order two were present in the formulation. In ...

We describe the derivation of order conditions, without restrictions on stage order, for general linear methods for ordinary differential equations. This derivation is based on the extension of Albrecht approach proposed in the context of Runge-Kutta and composite and linear cyclic methods. This approach was generalized by Jackiewicz and Tracogna to two-step Runge-Kutta methods, by Jackiewicz a...

The implementation of implicit Runge{Kutta methods requires the solution of large systems of non-linear equations. Normally these equations are solved by a modiied Newton process, which can be very expensive for problems of high dimension. The recently proposed triangularly implicit iteration methods for ODE-IVP solvers 5] substitute the Runge{Kutta matrix A in the Newton process for a triangul...

In this paper, we analyze the stability of the fourth order Runge-Kutta method for integrating semi-discrete approximations of time-dependent partial differential equations. Our study focuses on linear problems and covers general semi-bounded spatial discretizations. A counter example is given to show that the classical four-stage fourth order Runge-Kutta method can not preserve the one-step st...

The e ciency and accuracy of several time integration schemes are investigated for the unsteady Navier-Stokes equations. This study focuses on the e ciency of higher-order Runge-Kutta schemes in comparison with the popular Backward Di erencing Formulations. For this comparison an unsteady two-dimensional laminar ow problem is chosen, i.e. ow around a circular cylinder at Re=1200. It is conclude...

New Runge–Kutta methods for method of lines solution of systems of ordinary differential equations arising from discretizations of spatial derivatives in hyperbolic equations, by Chebyshev or modified Chebyshev methods, are introduced. These Runge–Kutta methods optimize the time step necessary for stable solutions, while holding dispersion and dissipation fixed. It is found that maximizing disp...