Eur. Phys. J. C (2024) 84: 76
https://doi.org/10.1140/epjc/s10052-024-12432-2

Regular Article - Experimental Physics

Explicit near-symplectic integrators for post-Newtonian Hamiltonian systems

¹ School of Mathematics, Yunnan Normal University, 650500, Kunming, China
² Yunnan Key Laboratory of Modern Analytical Mathematics and Applications, Yunnan Normal University, 650500, Kunming, China
³ Purple Mountain Observatory, Chinese Academy of Sciences, 210023, Nanjing, China
⁴ School of Astronomy and Space Science, University of Science and Technology of China, 230026, Hefei, China

^b lihuang@pmo.ac.cn

Received: 5 October 2023
Accepted: 11 January 2024
Published online: 24 January 2024

Abstract

Explicit symplectic integrators are powerful and widely used for Hamiltonian systems. However, once the post-Newtonian (PN) effect is considered to provide more precise modeling for the N-body problem, explicit symplectic methods cannot be constructed due to the nonseparability of the Hamiltonian. Thus, the available symplectic method is either fully implicit or semi-implicit, which decreases the efficiency because of the implicit iteration used during the evolution. In this paper, we aim to explore efficient explicit methods whose performance is mostly like symplectic methods for PN Hamiltonian systems. Taking the small parameter $\epsilon$ appearing in PN terms into consideration, we replace the implicit symplectic solver with explicit solvers in the mixed symplectic method to solve the PN term and then derive three explicit methods. It is theoretically shown that the proposed methods are respectively second-order, fourth-order, and pseudo-fourth-order, and that their closeness to the corresponding symplectic methods are $\mathcal{O}({\epsilon }^3{h}^3),$$\mathcal{O}({\epsilon }^5{h}^5),$ and $\mathcal{O}({\epsilon }^3{h}^3).$ That is, they are explicit near-symplectic methods with the presence of the small parameter $\epsilon .$ Numerical experiments with the Hamiltonian problem of spinning compact binaries show that the energy errors and orbital errors of the proposed explicit near-symplectic methods are indistinguishable from the corresponding mixed semi-implicit symplectic methods. The very small magnitude of the difference between the proposed explicit near-symplectic methods and the mixed symplectic methods confirms our theoretical analysis of their closeness to symplecticity. Finally, the much less CPU time consumed by the proposed methods highlights their most important advantage of high efficiency over the mixed symplectic methods.