The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. A diagonally implicit symplectic nine-stages Runge-Kutta method with algebraic order 6 and dispersion order 8 is presented. Numerical experiments with some Hamiltonian oscillatory problems are presented to show the proposed method is as competitive as the existing same type Runge-Kutta methods.

We analyze explicit Runge–Kutta schemes in time combined with stabilized finite elements in space to approximate evolution problems with a first-order linear differential operator in space of Friedrichs-type. For the time discretization, we consider explicit secondand third-order Runge–Kutta schemes. We identify a general set of properties on the spatial stabilization, encompassing continuous a...

A parallelized algorithm of an implicit Runge-Kutta integration scheme, the s-stage Gauss-Legendre Runge-Kutta (GLRK) method of order 2s with i xed-point iterations for solving the resulting nonlinear system of equations is presented. The algorithm is used for numerical solution of molecular dynamics equation on the distributed memory computers in the ring topology. It is designed for the two-s...

This paper presents a family of Runge{Kutta type integration schemes of arbitrarily high order for diierential equations evolving on manifolds. We prove that any classical Runge{Kutta method can be turned into an invariant method of the same order on a general homogeneous manifold, and present a family of algorithms that are relatively simple to implement.

An error analysis of Runge-Kutta convolution quadrature is presented for a class of nonsectorial operators whose Laplace transform satisfies, besides the standard assumptions of analyticity in a half-plane Re s > σ0 and a polynomial bound O(s 1) there, the stronger polynomial bound O(s2) in convex sectors of the form | arg s| ≤ π/2 − θ < π/2 for θ > 0. The order of convergence of the Runge-Kutt...

In this paper we develop numerical techniques of order 2, 4 and 6 for the solution of a fourth order linear equation. A priori error bound is obtained for the fourth order method to prove the convergence of the finite difference scheme. A sufficient condition guaranteeing the uniqueness of the solution of the boundary value problem is also given. Numerical illustrations are tabulated and result...

In this paper we analyze the consistency and stability properties of Runge-Kutta discrete adjoints. Discrete adjoints are very popular in optimization and control since they can be constructed automatically by reverse mode automatic differentiation. The consistency analysis uses the concept of elementary differentials and reveals that the discrete Runge-Kutta adjoint method has the same order o...

In this work we consider Symplectic Runge Kutta Nyström methods with five stages. A new fourth algebraic order method with phase-lag order eight is presented. Also the symplectic Runge Kutta Nyström of Calvo and Sanz Serna with five stages and fourth order is modified to produce a phase-fitted method. We apply the new methods on several Hamiltonian systems and on the computation of the eigenval...

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