Order conditions for G-symplectic methods
- 190 Downloads
General linear methods for the solution of ordinary differential equations are both multivalue and multistage. The order conditions will be stated and analyzed using a B-series approach. However, imposing the G-symplectic structure modifies the nature of the order conditions considerably. For Runge–Kutta methods, rooted trees belonging to the same tree have equivalent order conditions; if the trees are superfluous, they are automatically satisfied and can be ignored. For G-symplectic methods, similar results apply but with a more general interpretation. In the multivalue case, starting conditions are a natural aspect of the meaning of order; unlike the Runge–Kutta case for which “effective order” or “processing” or “conjugacy” has to be seen as having an artificial meaning. It is shown that G-symplectic methods with order 4 can be constructed with relatively few stages, \(s=3\), and with only \(r=2\) inputs to a step.
KeywordsG-symplectic methods Order conditions Conformability Trees Rooted trees
Mathematics Subject Classification65L05 65L06
The authors acknowledge the support of the Marsden Fund. Furthermore, they thank the referees for their valuable comments.
- 4.Butcher, J.C.: Dealing with parasitic behaviour in G-symplectic integrators, in recent developments in the numerics of nonlinear hyperbolic conservation laws. Springer, Heidelberg (2013)Google Scholar
- 8.Imran, G.: Accurate and efficient methods for differential systems with special structures. PhD. Thesis, University of Auckland, NZGoogle Scholar
- 9.Lopez-Marcos, M., Sanz-Serna, J.M., Skeel, R.D.: Cheap enhancement of symplectic integrators. In: Griffiths, D.F., Watson G.A. (eds.) Numerical Analysis, pp.107–122 (1996)Google Scholar