An efficient fast-multipole algorithm based on an expansion in the solid harmonics
The Journal of Chemical PhysicsPublished 15 March 1996
H. Y. Wang, R. LeSar
Citations56
SJR quartileQ1
SJR score0.82
SNIP0.91
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We present an efficient variant of the fast-multipole method for calculating long-range interactions in three-dimensional Coulombic systems. Using a multipole expansion based on the solid harmonics instead of the more common spherical harmonics leads to a greater increase in computational efficiency than a recently-reported fast-Fourier transform method, with none of the overhead associated with that approach.
Keywords
EngineeringPhysics and Astronomy
Computer Simulation of Liquids
20,954 Citations2017Michael P. Allen, Dominic J. Tildesley
This chapter discusses statistical mechanics, Monte Carlo methods, and some applications for computer simulation of molecular dynamics and Brownian dynamics.
Journal of Computational PhysicsA fast algorithm for particle simulations
4,917 Citations1987Leslie Greengard, Vladimir Rokhlin
An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are Coulombic or gravitational in nature, making it considerably more practical for large-scale problems encountered in plasma physics, fluid dynamics, molecular dynamics, and celestial mechanics.
NatureA hierarchical O(N log N) force-calculation algorithm
3,685 Citations1986Josh Barnes, Piet Hut
A novel method of directly calculating the force on N bodies that grows only as N log N is described, using a tree-structured hierarchical subdivision of space into cubic cells, each is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell.
SIAM Journal on Scientific and Statistical ComputingA Fast Adaptive Multipole Algorithm for Particle Simulations
614 Citations1988Jean‐François Carrier, Leslie Greengard +1 more
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.
SIAM Journal on Scientific and Statistical ComputingAn Efficient Program for Many-Body Simulation
535 Citations1985Andrew W. Appel
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.
Journal of Statistical PhysicsImplementing the fast multipole method in three dimensions
226 Citations1991K. E. Schmidt, Michael A. Lee
The Rokhlin-Greengard fast multipole algorithm for evaluating Coulomb and multipole potentials has been implemented and analyzed in three dimensions and the results include timings and error characterizations.
Journal of Computational PhysicsSkeletons from the Treecode Closet
223 Citations1994John K. Salmon, Michael S. Warren
It is found that the conventional Barnes-Hut MAC can introduce potentially unbounded errors unless θ 3 , and that this behavior while rare, is demonstrable in astrophysically reasonable examples.
Chemical Physics LettersAccelerated molecular dynamics simulation with the parallel fast multipole algorithm
192 Citations1992John A. Board, Jeffrey W. Causey +3 more
The fast multipole algorithm of Greengard and Rokhlin is implemented and incorporated into the molecular dynamics program MD, allowing rapid computation of the non-bonded forces acting in dynamical protein systems without truncation or other corruption of the Coulomb force.
Computers & Mathematics with ApplicationsA parallel version of the fast multipole method
148 Citations1990Leslie Greengard, William Gropp
Modifications necessary for implementation of the fast multipole method on parallel architectures are described and it is shown that the expected time requirements grow as log N when using N processors.
The Astrophysical Journal Supplement SeriesError analysis of a tree code
107 Citations1989Joshua E. Barnes, Piet Hut
Philosophical magazine. A/Philosophical magazine. A. Physics of condensed matter. Structure, defects and mechanical propertiesO(<i>N</i>) algorithm for dislocation dynamics
95 Citations1995H. Y. Wang, R. LeSar
SIAM Journal on Scientific and Statistical ComputingThe Parallel Multipole Method on the Connection Machine
83 Citations1991Feng Zhao, S. Lennart Johnsson
This paper reports on a fast implementation of the three-dimensional nonadaptive Parallel Multipole Method (PMM) on the Connection Machine system model CM–2, modeled by a hierarchy of three- dimensional grids forming a pyramid in which parent nodes have degree eight.