A Fast Adaptive Multipole Algorithm for Particle Simulations
J. Carrier, Leslie Greengard, Vladimir Rokhlin · SIAM Journal on Scientific and Statistical Computing · 1988
This paper describes an algorithm for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are described by Coulomb’s law. Unlike previously published schemes, the algorithm of this paper has an asymptotic CPU time estimate of $O(N)$, where N is the number of particles in the simulation, and does not depend on the statistics of the distribution for its efficient performance. The numerical examples we present indicate that it should be an algorithm of choice in many situations of practical interest.
Cited by 617 works. doi:10.1137/0909044
Authors
References
- A fast algorithm for particle simulations
- Computer Simulation Using Particles
- Numerical study of slightly viscous flow
- Rapid solution of integral equations of classical potential theory
- An Efficient Program for Many-Body Simulation
- A method of local corrections for computing the velocity field due to a distribution of vortex blobs