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 consider the parallel solution of nonstii ordinary diierential equations with two diierent classes of Runge-Kutta (RK) methods providing embedded solutions: classical embedded RK methods and iterated RK methods which were constructed especially for parallel execution. For embedded Runge-Kutta methods, mainly the potential system parallelism is exploited. Iterated RK methods pr...

In this paper, based on the classical Fourth-Order Runge-Kutta method, the modified FourthOrder Runge-Kutta method is presented for solving nonlinear vibration of axially travelling string system, that is to solve time varying and nonlinear differential equations. The classical Fourth-Order Runge-Kutta method can only be used to solve first-order linear differential equations. Its main idea is ...

The cubic spline interpolation method, the Runge–Kutta method, and the Newton–Raphson method are extended to dual versions (developed in the context of dual numbers). This extension allows the calculation of the derivatives of complicated compositions of functions which are not necessarily defined by a closed form expression. The code for the algorithms has been written in Fortran and some exam...

The purpose of this study is the design of efficient methods for the solution of an ordinary differential system of equations arising from the semidiscretization of a hyperbolic partial differential equation. Jameson recently introduced the use of one-step Runge-Kutta methods for the numerical solution of the Euler equations. Improvements in efficiency up to 80% may be achieved by using two-ste...

Iterative solvers in combination with multi-grid have been used extensively to solve large algebraic systems. One of the best known is the Runge-Kutta iteration. Previously [4] we reformulated the Runge-Kutta scheme and established a model of a complete V-cycle which was used to optimize the coefficients of the multi-stage scheme and resulted in a better overall performance. We now look into as...

We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, methods with an effective order of accuracy are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. We show that this allows the construction of four-stag...

We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...