We apply a Runge-Kutta-based waveform relaxation method to initial-value problems for implicit differential equations. In the implementation of such methods, a sequence of nonlinear systems has to be solved iteratively in each step of the integration process. The size of these systems increases linearly with the number of stages of the underlying Runge-Kutta method, resulting in high linear alg...

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...

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 ...

We present a new class of adaptivity algorithms for time-dependent partial differential equations (PDE) that combines adaptive higher-order finite elements (hp-FEM) in space with arbitrary (embedded, higher-order, implicit) Runge-Kutta methods in time. Weak formulation is only created for the stationary residual of the equation, and the Runge-Kutta method is supplied via its Butcher’s table. Ar...

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...

The aim of this paper is to design a new family of numerical methods of arbitrarily high order for systems of rst-order diierential equations which are to be termed pseudo two-step Runge-Kutta methods. By using collocation techniques, we can obtain an arbitrarily high-order stable pseudo two-step Runge-Kutta method with any desired number of implicit stages in retaining the two-step nature. In ...

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX Runge–Kutta methods in the context of optimal control problems. The analysis of the schemes is based on the continuous optimality system. Using suitable trans...

The RK5GL3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on a combination of a fifth-order Runge-Kutta method and 3-point Gauss-Legendre quadrature. In this paper we describe an effective local error control algorithm for RK5GL3, which uses local extrapolation with an eighth-order Runge-Kutta method in tandem with RK5GL3, and a ...

System theory for numerical analysis has recently become a focus of research. In this paper we regard dynamics of Newton’s method as a nonlinear feedback system and derive convergence conditions, based on the internal model principle and systems of Lur’e type. We then focus our attention on the analysis of the region of absolute stability of Runge-Kutta type methods. We derive a linear matrix i...