Abstract
A family of three stage symplectic Runge–Kutta methods are derived with effective order 4. The methods are constrained so that the coefficient matrix A has only real eigenvalues. This restriction enables transformations to be introduced into the implementation of the method so that, for large Hamiltonian problems, there is a significant gain in efficiency.
Similar content being viewed by others
References
Burrage, K.: A special family of Runge–Kutta methods for solving stiff differential equations. BIT 18, 22–41 (1978)
Butcher, J.C.: The effective order of Runge–Kutta methods. Lect. Notes Math. 109, 133–139 (1969)
Butcher, J.C.: A transformed implicit Runge–Kutta method. J. ACM 26, 731–738 (1979)
Butcher, J.C.: Numerical Methods for Ordinary Differential Equations, 2nd edn. Wiley, New York (2008)
Butcher, J.C., Chartier, P.: A generalization of singly-implicit Runge–Kutta methods. Appl. Numer. Math. 24, 343–350 (1997)
Butcher, J.C., Chartier, P.: The effective order of singly-implicit Runge–Kutta methods. Numer. Algorithms 20, 269–284 (1999)
Chan, T.M.H.: Algebraic structures for the analysis of numerical methods. Thesis (PhD–Mathematics)–University of Auckland (1998)
Cooper, G.J.: Stability of Runge–Kutta methods for trajectory problems. IMA J. Numer. Anal. 7, 1–13 (1987)
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 (1995)
Sanz-Serna, J.M.: Symplectic integrators for Hamiltonian problems. Acta Numer. 1, 123–124 (1992)
Stetter, H.J.: Local estimation of the global discretization error. SIAM J. Numer. Anal. 8, 512–523 (1971)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Butcher, J.C., Imran, G. Symplectic effective order methods. Numer Algor 65, 499–517 (2014). https://doi.org/10.1007/s11075-013-9789-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-013-9789-5