Hamiltonian systems arise in many areas of physics, mechanics, and engineering sciences as well as in pure and applied mathematics. To their symplectic integration certain Runge–Kutta– type methods are profitably applied (see Sanz–Serna and Calvo [10]). In this paper Runge–Kutta and partitioned Runge–Kutta methods are considered. Different features of symmetry are distinguished using reflected ...

Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return point estimates. We construct a family of probabilistic numerical methods that instead return a Gauss-Markov process defining a probability distribution over the ODE solution. In contrast to prior work, we construct th...

A new explicit fourth-order six-stage Runge-Kutta scheme with low dispersion and low dissipation properties is developed. This new Runge-Kutta scheme is shown to be more efficient in terms of dispersion and dissipation properties than existing algorithms such as Runge-Kutta temporal schemes developed by Hu et al. (1996), Mead and Renaut (1999), Tselios and Simos (2005). We perform a spectral an...

It often happens that iteration processes used for solving the implicit relations arising in ODE-IVP methods only start to converge rapidly after a certain number of iterations. Fast convergence right from the beginning is particularly important if we want to use so-called step-parallel iteration in which the iteration method is concurrently applied at a number of step points. In this paper, we...