A fast recursive coordinate bisection tree for neighbour search and gravity

@article{Gafton2011AFR,
  title={A fast recursive coordinate bisection tree for neighbour search and gravity},
  author={Emanuel Gafton and Stephan Rosswog},
  journal={Monthly Notices of the Royal Astronomical Society},
  year={2011},
  volume={418},
  pages={770-781}
}
  • E. Gafton, S. Rosswog
  • Published 29 July 2011
  • Computer Science
  • Monthly Notices of the Royal Astronomical Society
We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a ‘top-down’ fashion by ‘recursive coordinate bisection’ where on each tree level we split the longest side of a cell through its centre of mass. This procedure continues until the average number of particles in the lowest tree level drops below a prescribed value. To calculate the forces on the particles in each lowest-level cell we split the… 
Finding Neighbors in a Forest: A b-tree for Smoothed Particle Hydrodynamics Simulations
TLDR
This work presents a novel tree structure, named b-tree, which features an adaptive branching factor to reduce the depth of the neighbor search and assess the scalability of the proposed tree-based algorithms through an extensive set of performance experiments in a shared-memory system.
MODA: a new algorithm to compute optical depths in multidimensional hydrodynamic simulations
Aims. We introduce the multidimensional optical depth algorithm (MODA) for the calculation of optical depths in approximate multidimensional radiative transport schemes, equally applicable to
Simulating neutron star mergers with the Lagrangian Numerical Relativity code SPHINCS_BSSN
We present the first neutron star merger simulations performed with the newly developed Numerical Relativity code . This code evolves the spacetime on a mesh using the BSSN formulation, but matter is
SPH Methods in the Modelling of Compact Objects
We review the current status of compact object simulations that are based on the smooth particle hydrodynamics (SPH) method. The first main part of this review is dedicated to SPH as a numerical
Thinking Outside the Box: Numerical Relativity with Particles
The observation of gravitational waves from compact objects has now become an active part of observational astronomy. For a sound interpretation, one needs to compare such observations against
SPHINCS_BSSN: a general relativistic smooth particle hydrodynamics code for dynamical spacetimes
We present a new methodology for simulating self-gravitating general-relativistic fluids. In our approach the fluid is modelled by means of Lagrangian particles in the framework of a
Relativistic effects on tidal disruption kicks of solitary stars
Solitary stars that wander too close to their galactic centres can become tidally disrupted, if the tidal forces due to the supermassive black hole residing there overcome the self-gravity of the
Compressed Neighbour Lists for SPH
TLDR
A novel compression scheme to store neighbour lists for iterative solvers that employ Smoothed Particle Hydrodynamics (SPH) is proposed, showing that the resulting neighbour search outperforms compact hashing in terms of speed and memory consumption.
Compressed Neighbor Lists for SPH
TLDR
A novel compression scheme to store neighbor lists for iterative solvers that employ Smoothed Particle Hydrodynamics (SPH) is proposed, showing that the resulting neighbor search outperforms compact hashing in terms of speed and memory consumption.
...
...

References

SHOWING 1-10 OF 50 REFERENCES
The Tree Particle-Mesh N-Body Gravity Solver
TLDR
The new TPM algorithm (a refinement of that originated by Xu) is tested by comparison with results from Ferrell & Bertschinger's P3M code and it is found that, except in small clusters, the TPM results are at least as accurate as those obtained with the well-established P2M algorithm, while taking significantly less computing time.
TREESPH: A Unification of SPH with the Hierarchical Tree Method
A new, general-purpose code for evolving three-dimensional, self-gravitating fluids in astrophyics, both with and without collisionless matter, is described. In this TREESPH code, hydrodynamic
A hierarchical O(N log N) force-calculation algorithm
TLDR
A novel method of directly calculating the force on N bodies that grows only as N log N is described, using a tree-structured hierarchical subdivision of space into cubic cells, each is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell.
The Cosmological simulation code GADGET-2
We discuss the cosmological simulation code GADGET-2, a new massively parallel TreeSPH code, capable of following a collisionless fluid with the N-body method, and an ideal gas by means of smoothed
An energy‐conserving formalism for adaptive gravitational force softening in smoothed particle hydrodynamics and N‐body codes
In this paper, we describe an adaptive softening length formalism for collisionless N-body and self-gravitating smoothed particle hydrodynamics (SPH) calculations which conserves momentum and energy
A Hierarchical O(N) Force Calculation Algorithm
A novel code for the approximate computation of long-range forces between N mutually interacting bodies is presented. The code is based on a hierarchical tree of cubic cells and features mutual
A Performance Comparison of Tree Data Structures for N-Body Simulation
TLDR
A modified binary tree is presented which is competitive with the Barnes?Hut tree for long-range Physics and superior for short-range physics, and if the local search time is a significant portion of the computational effort, a binary tree could offer performance advantages.
Numerical techniques for large cosmological N-body simulations
Techniques for carrying out large N-body simulations of the gravitational evolution of clustering in the fundamental cube of an infinite periodic universe are described and compared. The accuracy of
A new parallel N body gravity solver: TPM
TLDR
A gravity solver based on combining the well developed Particle-Mesh method and TREE methods, which runs much faster than a pure TREE code with the same number of particles and maintains almost the same resolution in high density regions.
...
...