scientific article; zbMATH DE number 1057776
From MaRDI portal
Publication:4352832
Three algorithms for the three-dimensional \(N\)-body problem are compared in this paper: the Barnes-Hut algorithm, Greengard's fast multipole method, and the parallel multipole tree algorithm. The scope of the paper is to determine which of the algorithms performs best in practice. The \(N\)-body algorithms have numerous applications in such areas as astrophysics, molecular dynamics and plasma physics. For the entire collection see [Zbl 0863.00043].
Recommendations
Cited in
(15)- Distribution-independent hierarchical algorithms for the \(N\)-body problem
- A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
- Variable order revised binary treecode
- A Treecode for Accurate Force Calculations
- Hypercube Algorithms for Direct N-Body Solvers for Different Granularities
- Dynamic compressed hyperoctrees with application to the N-body problem
- scientific article; zbMATH DE number 1759203 (Why is no real title available?)
- The complexity of N-body simulation
- Comparisons of integrators on a diverse collection of restricted three-body test problems
- scientific article; zbMATH DE number 833687 (Why is no real title available?)
- Greengard’s N-Body Algorithm is not Order N
- Heterogeneous architectures for computational intensive applications: a cost-effectiveness analysis
- Weak asymptotic methods for 3-D self-gravitating pressureless fluids. Application to the creation and evolution of solar systems from the fully nonlinear Euler-Poisson equations
- A methodology towards automatic implementation of \(N\)-body algorithms
- On well-separated sets and fast multipole methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352832)
