A Keplerian-based Hamiltonian splitting for gravitational N-body simulations

G Gonçalves Ferrari, T Boekholt… - Monthly Notices of the …, 2014 - academic.oup.com
G Gonçalves Ferrari, T Boekholt, SF Portegies Zwart
Monthly Notices of the Royal Astronomical Society, 2014academic.oup.com
We developed a Keplerian-based Hamiltonian splitting for solving the gravitational N-body
problem. This splitting allows us to approximate the solution of a general N-body problem by
a composition of multiple, independently evolved two-body problems. While the Hamiltonian
splitting is exact, we show that the composition of independent two-body problems results in
a non-symplectic non-time-symmetric first-order map. A time-symmetric second-order map is
then constructed by composing this basic first-order map with its self-adjoint. The resulting …
Abstract
We developed a Keplerian-based Hamiltonian splitting for solving the gravitational N-body problem. This splitting allows us to approximate the solution of a general N-body problem by a composition of multiple, independently evolved two-body problems. While the Hamiltonian splitting is exact, we show that the composition of independent two-body problems results in a non-symplectic non-time-symmetric first-order map. A time-symmetric second-order map is then constructed by composing this basic first-order map with its self-adjoint. The resulting method is precise for each individual two-body solution and produces quick and accurate results for near-Keplerian N-body systems, like planetary systems or a cluster of stars that orbit a supermassive black hole. The method is also suitable for integration of N-body systems with intrinsic hierarchies, like a star cluster with primordial binaries. The superposition of Kepler solutions for each pair of particles makes the method excellently suited for parallel computing; we achieve ≳64 per cent efficiency for only eight particles per core, but close to perfect scaling for 16 384 particles on a 128 core distributed-memory computer. We present several implementations in sakura, one of which is publicly available via the amuse framework.
Oxford University Press
以上显示的是最相近的搜索结果。 查看全部搜索结果