Multiple time-step reversible N-body integrators for close encounters in planetary systems
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 time-steps. These time-step...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
09 April 2024
|
| In: |
Monthly notices of the Royal Astronomical Society
Year: 2024, Volume: 530, Issue: 4, Pages: 3870-3880 |
| ISSN: | 1365-2966 |
| DOI: | 10.1093/mnras/stae985 |
| Online Access: | Verlag, kostenfrei, Volltext: https://doi.org/10.1093/mnras/stae985
|
| Author Notes: | David M. Hernandez and Walter Dehnen |
| Summary: | 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 time-steps. These time-steps, along with the global time-step, 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 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 symba. The codes presented here are available on Github. We also find adapting a global time-step reversibly and discretely must be done in block-synchronized manner or similar. |
|---|---|
| Item Description: | Gesehen am 09.12.204 |
| Physical Description: | Online Resource |
| ISSN: | 1365-2966 |
| DOI: | 10.1093/mnras/stae985 |