No label defined (Q4824499)

This Authors study the maximum order of symplectic Runge-Kutta (RK) and partitioned Runge-Kutta (PRK) methods whose coefficient matrix has only real eigenvalues. After a short introduction showing that for this kind of methods when the implicit equations of stages are solved by means of a simplified Newton iteration then its computational cost can be greatly reduced by introducing a suitable linear transformation, the authors prove that the order of a symplectic \(s\)-stage Runge-Kutta method with real eigenvalues is \( \leq s \) when \(s\) is even. Further they prove that for partitioned Runge-Kutta methods this property does not hold by constructing explicitly a method of this type with \( s=4\) and order 5. Finally the authors provide a way to construct symplectic partitioned Runge-Kutta methods with real eigenvalues starting with a given symmetric Runge-Kutta method with real eigenvalues.