A note on pseudo-symplectic Runge-Kutta methods
- 72 Downloads
Aubry and Chartier introduced (1998) the concept of pseudo-symplecticness in order to construct explicit Runge-Kutta methods, which mimic symplectic ones. Of particular interest are methods of order (p, 2p), i.e., of orderp and pseudo-symplecticness order 2p, for which the growth of the global error remains linear. The aim of this note is to show that the lower bound for the minimal number of stages can be achieved forp=4 andp=5.
AMS subject classification65L05,65L06
Key wordsHamiltonian systems pseudo-symplecticness conditions tensor products
Unable to display preview. Download preview PDF.
- 2.J. C. Butcher,The Numerical Analysis of Ordinary Differential Equations, Wiley, 1987.Google Scholar