Fast algorithms for classical physics

Research output: Contribution to journalArticle

Abstract

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 trom diffusion, gravitation, and wave propagation are considered.

Original languageEnglish (US)
Pages (from-to)909-914
Number of pages6
JournalScience
Volume265
Issue number5174
StatePublished - Aug 12 1994

Fingerprint

Physics
Gravitation

ASJC Scopus subject areas

  • General

Cite this

Fast algorithms for classical physics. / Greengard, Leslie.

In: Science, Vol. 265, No. 5174, 12.08.1994, p. 909-914.

Research output: Contribution to journalArticle

Greengard, L 1994, 'Fast algorithms for classical physics', Science, vol. 265, no. 5174, pp. 909-914.
Greengard, Leslie. / Fast algorithms for classical physics. In: Science. 1994 ; Vol. 265, No. 5174. pp. 909-914.
@article{f1256c1b7f8c43d0bc76d47724b31307,
title = "Fast algorithms for classical physics",
abstract = "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 trom diffusion, gravitation, and wave propagation are considered.",
author = "Leslie Greengard",
year = "1994",
month = "8",
day = "12",
language = "English (US)",
volume = "265",
pages = "909--914",
journal = "Science",
issn = "0036-8075",
publisher = "American Association for the Advancement of Science",
number = "5174",

}

TY - JOUR

T1 - Fast algorithms for classical physics

AU - Greengard, Leslie

PY - 1994/8/12

Y1 - 1994/8/12

N2 - 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 trom diffusion, gravitation, and wave propagation are considered.

AB - 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 trom diffusion, gravitation, and wave propagation are considered.

UR - http://www.scopus.com/inward/record.url?scp=0028021598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028021598&partnerID=8YFLogxK

M3 - Article

VL - 265

SP - 909

EP - 914

JO - Science

JF - Science

SN - 0036-8075

IS - 5174

ER -