PMTA - Parallel Multipole Tree Algorithms

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

DateOfInformation

Thr Sep 25 16:19:06 1997

Domain

Scientific and Engineering Applications

Name

PMTA - Parallel Multipole Tree Algorithms

TargetEnvironment

PVM

Webpage

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

ContactIs

William T. Rankin