The existence of symplectic general linear methods

Reference:

Butcher, J. C. and Hewitt, L. L., 2009. The existence of symplectic general linear methods. Numerical Algorithms, 51 (1), pp. 77-84.

Related documents:

Official URL:

http://dx.doi.org/10.1007/s11075-008-9250-3

Abstract

We derive a criterion that any general linear method must satisfy if it is symplectic. It is shown, by considering the method over several steps, that the satisfaction of this condition leads to a reducibility in the method. Linking the symplectic criterion here to that for Runge-Kutta methods, we demonstrate that a general linear method is symplectic only if it can be reduced to a method with a single input value.

Export

Actions (login required)