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.
Original language | English |
---|---|
Pages (from-to) | 77-84 |
Number of pages | 8 |
Journal | Numerical Algorithms |
Volume | 51 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2009 |
Keywords
- Reducibility
- General linear methods
- Symplectic