Fast Algorithms for Classical Physics

Science  12 Aug 1994:
Vol. 265, Issue 5174, pp. 909-914
DOI: 10.1126/science.265.5174.909


Some of the recently developed fast summation methods that have arisen in scientific computing are described. These methods require an amount of work proportional to N or N log N to evaluate all pairwise interactions in an ensemble of N particles. Traditional methods, by contrast, require an amount of work proportional to N2. As a result, largescale simulations can be carried out using only modest computer resources. In combination with supercomputers, it is possible to address questions that were previously out of reach. Problems from diffusion, gravitation, and wave propagation are considered.