NHSE Software Catalog

PMTA - Parallel Multipole Tree Algorithms

url

ftp://ftp.ee.duke.edu/pub/SciComp/src/PMTA_4.0.tar.Z

author

William T. Rankin / wrankin@ee.duke.edu

version

4.0

abstract

The program is designed to efficiently execute various
multipole-accelerated algorithms for the N-body problem.
This particular release can execute three different
algorithms: the Fast Multipole Algorithm (FMA), and
O(n) algorithm developed by Greengard and Rokhlin, the
Multipole Treecode Algorithm (MTA), an O(n log(n)) method
developed at Duke, and the Enhanced Multipole Treecode
Algorithm (Enhanced MTA), an O(n) method which is
also developed at Duke. MTA is a generalization of the tree code
developed by Barnes and Hut (BH). MTA computes interaction
lists for all cells at the lowest level of spatial decomposition
using a Barnes-Hut-like Multipole Acceptance Criterion (MAC).

description

http://www.ee.duke.edu/~wrankin/software.html

reference

ftp://ftp.ee.duke.edu/pub/SciComp/docs/PMTA_doc.ps

contact

William T. Rankin / wrankin@ee.duke.edu

keywords

fast multipole algorithm; application program

application

electrostatic N-body problem