Pseudo-symplectic Runge-Kutta methods (Q1272872): Difference between revisions

The aim of the paper is the construction of explicit \(s\)-stage Runge-Kutta methods of order \((p,2p)\), that is of linear order \(p\) and pseudo-symplecticness order \(2p\), \(p= 2,3,4\) for Hamiltonian systems. (A Runge-Kutta method is said to be of linear order \(p\), if it is of order \(p\) for linear problems.) The concept of pseudo-symplecticness is introduced and using the theory of trees and \(B\)-series, pseudo-symplecticness conditions up to order 6 are given. A simplification of assumptions is also found. Numerical experiments show that pseudo-symplectic methods seem to offer a good accuracy and efficiency.