Fast algorithms for classical physics

Research output: Contribution to journalArticle


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, large-scale 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.

Original languageEnglish (US)
Pages (from-to)909-914
Number of pages6
Issue number5174
StatePublished - Jan 1 1994


ASJC Scopus subject areas

  • General

Cite this