A hierarchical \({\mathcal O}(N)\) force calculation algorithm

DOI10.1006/jcph.2002.7026zbMath1130.85303arXivastro-ph/0202512OpenAlexW3103772912MaRDI QIDQ697691

Walter Dehnen

Publication date: 17 September 2002

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/astro-ph/0202512

Mathematics Subject Classification ID

Applications to the sciences (65Z05) Galactic and stellar dynamics (85A05) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

A Directional Equispaced Interpolation-Based Fast Multipole Method for Oscillatory Kernels ⋮ Variable order revised binary treecode ⋮ How to improve the diagnosis of kinetic energy in \(\delta f\) PIC codes ⋮ Predicting the dark matter velocity distribution in galactic structures: tests against hydrodynamic cosmological simulations ⋮ An improved fast multipole method for electrostatic potential calculations in a class of coarse-grained molecular simulations ⋮ An adaptive error-controlled hybrid fast solver for regularized vortex methods ⋮ Analytic integration of the Newton potential over cuboids and an application to fast multipole methods ⋮ A splitting-free vorticity redistribution method ⋮ A GPU-parallelized interpolation-based fast multipole method for the relativistic space-charge field calculation ⋮ A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal ⋮ A sparse octree gravitational \(N\)-body code that runs entirely on the GPU processor ⋮ Relativistic space-charge field calculation by interpolation-based treecode ⋮ Non-intrusive hierarchical coupling strategies for multi-scale simulations in gravitational dynamics ⋮ A Smooth Partition of Unity Finite Element Method for Vortex Particle Regularization ⋮ Fast algorithms for large dense matrices with applications to biofluids ⋮ Revision of DASHMM: Dynamic Adaptive System for Hierarchical Multipole Methods ⋮ The block-P\(^{3}\)M algorithm ⋮ Fast multipole preconditioners for sparse matrices arising from elliptic equations ⋮ A fast algorithm with error bounds for quadrature by expansion

Uses Software

• HOT
• NEMO
• RatImage

Cites Work

• Unnamed Item
• A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
• Skeletons from the treecode closet
• A portable parallel particle program
• A fast adaptive multipole algorithm in three dimensions
• A fast algorithm for particle simulations