A fast algorithm for particle simulations

@article{Greengard1987AFA,
  title={A fast algorithm for particle simulations},
  author={Leslie Greengard and Vladimir Rokhlin},
  journal={Journal of Computational Physics},
  year={1987},
  volume={73},
  pages={325-348}
}

Figures and Tables from this paper

A FAST ADAPTIVE MULTIPOLE ALGORITHM FOR PARTICLE SIMULATIONS *
TLDR
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.
Rapid Evaluation of Potential Fields in Three Dimensions
Abstract : This paper describes a three dimensional version of the fast multipole algorithm for the rapid evaluation of the potential and force fields in systems of particles whose interactions are
Fast multipole methods for particle dynamics
TLDR
The basic mathematics behind fast summations applied to long ranged forces is presented along with advanced techniques for accelerating the solution, including the most recent developments.
Efficient Methods for Handling Long-Range Forces in Particle—Particle Simulations
A number of problems arise when long-range forces, such as those governed by Bessel functions, are used in particle?particle simulations. If a simple cutoff for the interaction is used, the system
Fast Updating Multipole Coulombic Potential Calculation
We present a numerical method to efficiently and accurately re-compute the Coulomb potential of a large ensemble of charged particles after a subset of the particles undergoes a change of position.
Particle-particle, particle-scaling function algorithm for electrostatic problems in free boundary conditions.
TLDR
An algorithm for fast calculation of the Coulombic forces and energies of point particles with free boundary conditions is proposed, which has lower crossover point with the full O(N(2)) direct summation than the fast multipole method.
Fast Summation Algorithms for the Particle Simulation of Far-Field Potential and Rapidly-Decaying Potential
Fast summation algorithms for the particle simulation are presented. The diffusion velocity, which appears in the vortex methods, is treated as an example of rapidly-decaying potential and the
A particle-particle, particle-density algorithm for the calculation of electrostatic interactions of particles with slablike geometry.
We present a fast and accurate method to calculate the electrostatic energy and forces of interacting particles with the boundary conditions appropriate to surfaces, i.e., periodic in the two
Multi-scale methods in time and space for particle simulations
  • W. Fong
  • Physics, Computer Science
  • 2009
TLDR
This dissertation will formulate a class of integrators called asynchronous variational integrators (AVI) in the context of particle simulations that allows for time steps to be chosen in arbitrary ratio.
...
...

References

SHOWING 1-10 OF 19 REFERENCES
A FAST ADAPTIVE MULTIPOLE ALGORITHM FOR PARTICLE SIMULATIONS *
TLDR
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.
A Fast Adaptive Multipole Algorithm for Particle Simulations
TLDR
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, which has an asymptotic CPU time estimate of $O(N)$ and does not depend on the statistics of the distribution for its efficient performance.
An Efficient Program for Many-Body Simulation
TLDR
This paper describes both the particular program and the methodology underlying such speedups that reduced the running time of a large problem $(N = 10,000)$ by a factor of four hundred.
Computer simulation using particles
Computer experiments using particle models A one-dimensional plasma model The simulation program Time integration schemes The particle-mesh force calculation The solution of field equations
Numerical study of slightly viscous flow
  • A. Chorin
  • Physics
    Journal of Fluid Mechanics
  • 1973
A numerical method for solving the time-dependent Navier–Stokes equations in two space dimensions at high Reynolds number is presented. The crux of the method lies in the numerical simulation of the
reported at a later date
  • reported at a later date
cal examples presented in Section 5 indicate that even
  • cal examples presented in Section 5 indicate that even
Computer Simulation Using Particles (McGraw–Hill
  • New York,
  • 1981
...
...