A fast algorithm for particle simulations
Journal of Computational Physics
Algorithms in C
Skeletons from the treecode closet
Journal of Computational Physics
Greengard's N-Body Algorithm is Not Order N
SIAM Journal on Scientific Computing
A fast adaptive multipole algorithm in three dimensions
Journal of Computational Physics
Fast multipole methods on graphics processors
Journal of Computational Physics
Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
SIAM Journal on Scientific Computing
Numerical Simulation in Molecular Dynamics: Numerics, Algorithms, Parallelization, Applications
Numerical Simulation in Molecular Dynamics: Numerics, Algorithms, Parallelization, Applications
Parallel accelerated cartesian expansions for particle dynamics simulations
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
High performance BLAS formulation of the adaptive Fast Multipole Method
Mathematical and Computer Modelling: An International Journal
Adaptive fast multipole methods on the GPU
The Journal of Supercomputing
| Hi-index | 0.00 |
The notion of well-separated sets is crucial in fast multipole methods as the main idea is to approximate the interaction between such sets via cluster expansions. We revisit the one-parameter multipole acceptance criterion in a general setting and derive a relative error estimate. This analysis benefits asymmetric versions of the method, where the division of the multipole boxes is more liberal than in conventional codes. Such variants offer a particularly elegant implementation with a balanced multipole tree, a feature which might be very favorable on modern computer architectures.