Volume 2, pp. 194-204, 1994.

Reducibility and characterization of symplectic Runge-Kutta methods

Peter Görtz and Rudolf Scherer


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 and transposed methods. The property of DJ–irreducibility ensures symplectic methods having nonvanishing weights. A characterization of symplectic methods is deduced, from which many attributes of such methods and hints for their construction follow. Order conditions up to order four can be checked easily by simplifying assumptions. For symplectic singly–implicit Runge–Kutta methods the order barrier is shown to be two.

Full Text (PDF) [204 KB], BibTeX

Key words

Hamiltonian system, symplectic method, Runge–Kutta and partitioned Runge–Kutta method, DJ–reducibility.

AMS subject classifications


< Back