A performance comparison of tree data structures for \(N\)-body simulation
From MaRDI portal
Publication:1601543
DOI10.1006/jcph.2001.6943zbMath1042.70001OpenAlexW1966383678MaRDI QIDQ1601543
Publication date: 2002
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.2001.6943
Computational methods for problems pertaining to mechanics of particles and systems (70-08) (n)-body problems (70F10) Computational methods for problems pertaining to astronomy and astrophysics (85-08)
Related Items (4)
A linearly fourth order multirate Runge-Kutta method with error control ⋮ High-order predictor--corrector of exponential fitting for the \(N\)-body problems ⋮ On improving the algorithm efficiency in the particle-particle force calculations ⋮ Search algorithm, and simulation of elastodynamic crack propagation by modified smoothed particle hydrodynamics (MSPH) method
Uses Software
Cites Work
- Comparison of two different tree algorithms
- A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
- Skeletons from the treecode closet
- Tree Data Structures forN-Body Simulation
- A fast algorithm for particle simulations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A performance comparison of tree data structures for \(N\)-body simulation
