Fast Algorithms for Classical Physics

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Science (American Association for the Advancement of Science) Ročník 265; číslo 5174; s. 909 - 914
Hlavný autor: Greengard, Leslie
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Washington, DC American Society for the Advancement of Science 12.08.1994
American Association for the Advancement of Science
The American Association for the Advancement of Science
Predmet:
ISSN:0036-8075, 1095-9203
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 N$^2$. 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.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0036-8075
1095-9203
DOI:10.1126/science.265.5174.909