scientific article; zbMATH DE number 4213512
From MaRDI portal
Recommendations
Cited in
(20)- 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
- Skeletons from the treecode closet
- A heap-based algorithm for the study of one-dimensional particle systems.
- Variable order revised binary treecode
- Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
- Projection-tree reduced-order modeling for fast \(N\)-body computations
- Towards an adaptive treecode for \(N\)-body problems
- A force evaluation free method to \(N\)-body problems: binary interaction approximation
- Multibody multipole methods
- Parametric S-tree method and its generalizations.
- scientific article; zbMATH DE number 18257 (Why is no real title available?)
- Grid-Multipole Calculations
- scientific article; zbMATH DE number 833683 (Why is no real title available?)
- Treecode algorithms for computing nonbonded particle interactions
- Compression of particle data from hierarchical approximate methods
- A modified tree code: Don't laugh; it runs
- A fast algorithm for particle simulations
- DEM simulations of toner particles with an O(N N) hierarchical tree code algorithm
- A hierarchical \({\mathcal O}(N)\) force calculation algorithm
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 Q3359807)
