Papers › Multiple timestep reversible N-body integrators for close encounters in planetary systems
Multiple timestep reversible N-body integrators for close encounters in planetary systems
David M. Hernandez, Walter Dehnen
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present new almost time-reversible integrators for solution of planetary systems consisting of "planets" and a dominant mass ("star"). The algorithms can be considered adaptive generalizations of the Wisdom--Holman method, in which all pairs of planets can be assigned timesteps. These timesteps, along with the global timestep, can be adapted time-reversibly, often at no appreciable additional compute cost, without sacrificing any of the long-term error benefits of the Wisdom--Holman method. The method can also be considered a simpler and more flexible version of the \texttt{SYMBA} symplectic code. We perform tests on several challenging problems with close encounters and find the reversible algorithms are up to $2.6$ times faster than a code based on \texttt{SYMBA}. The codes presented here are available on Github. We also find adapting a global timestep reversibly and discretely must be done in block-synchronized manner or similar.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections