Strong stability preserving (SSP) high order Runge–Kutta time discretizations were developed for use with semi-discrete method of lines approximations of hyperbolic partial differential equations, and have proven useful in many other applications. These high order time discretization methods preserve the strong stability properties of first order explicit Euler time stepping. In this paper we a...

Block Runge-Kutta formulae suitable for the approximate numerical integration of initial value problems for first order systems of ordinary differential equations are derived. Considered in detail are the problems of varying both order and stepsize automatically. This leads to a class of variable order block explicit Runge-Kutta formulae for the integration of nonstiff problems and a class of v...

Practical, structure-preserving methods for integrating classical Heisenberg spin systems are discussed. Two new integrators are derived and compared, including (1) a symmetric energy and spin-length preserving integrator based on a Red-Black splitting of the spin sites combined with a staggered timestepping scheme and (2) a (Lie-Poisson) symplectic integrator based on Hamiltonian splitting. Th...

We examine the potential for parallelism in Runge-Kutta (RK) methods based on formulas in standard one-step form. Both negative and positive results are presented. Many of the negative results are based on a theorem that bounds the order of a RK formula in terms of the minimum polynomial for its coeecient matrix. The positive results are largely examples of prototypical formulas which ooer a po...

Although Runge–Kutta and partitioned Runge–Kutta methods are known to formally satisfy discrete multisymplectic conservation laws when applied to multi-Hamiltonian PDEs, they do not always lead to well-defined numerical methods. We consider the case study of the nonlinear Schrödinger equation in detail, for which the previously known multisymplectic integrators are fully implicit and based on t...

This study utilized combination of phase plots,time steps distribution and adaptive time steps Runge-Kutta and f if th order algorithms to investigate a harmonically Duff ing oscillator.The object is to visually compare fourth and f if th order Runge-Kutta algorithms performance as tools for seeking the chaotic solutions of a harmonically excited Duffing oscillator.Though fif th order algorithm...

Recently, the Runge-Kutta methods, obtained via Taylor’s expansion is exist in the literature. In this study, we have derived explicit methods for problems of the form y′ = f(y) including second and third derivatives , by considering available Two-Derivative Runge-Kutta methods (TDRK). The methods use one evaluation of first derivative, one evaluation of second derivative and many evaluations o...

In the present paper, the modified Runge-Kutta method is constructed, and it is proved that the modified Runge-Kutta method preserves the order of accuracy of the original one. The necessary and sufficient conditions under which the modified Runge-Kutta methods with the variable mesh are asymptotically stable are given. As a result, the θ-methods with 1 2 ≤ θ ≤ 1, the odd stage Gauss-Legendre m...

Recently Ch. Lubich proved convergence results for Runge-Kutta methods applied to stii mechanical systems. The present paper discusses the new ideas necessary to extend these results to general linear methods, in particular BDF and multistep Runge-Kutta methods. Stii mechanical systems arise in the modelling of mechanical systems containing strong springs and (or) elastic joints. A typical exam...

The study of the sensitivity of the solution of a system of differential equations with respect to changes in the initial conditions leads to the introduction of an adjoint system, whose discretisation is related to reverse accumulation in automatic differentiation. Similar adjoint systems arise in optimal control and other areas, including classical Mechanics. Adjoint systems are introduced in...