On preference of Yoshida construction over Forest–Ruth fourth-order symplectic algorithm
- 170 Downloads
The Forest–Ruth fourth-order symplectic algorithm is identical to the Yoshida triplet construction when all component integrators of both algorithms are exactly known. However, this equality no longer holds in general when some or all of the components are inexact and when they are second-order with odd-order error structures. The former algorithm is only second-order accurate in most cases, whereas the latter can be fourth-order accurate. These analytical results are supported by numerical simulations of partially separable but globally inseparable Hamiltonian systems, such as the post-Newtonian Hamiltonian formulation of spinless compact binaries. Therefore, the Yoshida construction has intrinsic merit over the concatenated Forest–Ruth algorithm when inexact component integrators are used.
KeywordsEnergy Error Symplectic Integrator Symplectic Method Compact Binary Symmetric Composition
We are very grateful to a referee for true comments and useful suggestions. This research is supported by the Natural Science Foundation of China under Grant Nos. 11173012, 11178002 and 11178014.
- 1.E. Hairer, C. Lubich, G. Wanner, Geometric Numerical Integration (Springer, Berlin, 1999) Google Scholar
- 6.K. Feng, M.Z. Qin, Symplectic Geometric Algorithms for Hamiltonian Systems (Zhejiang Science and Technology Publishing House, Hangzhou China, Springer, New York, 2009) Google Scholar