DPMTA - Distributed Parallel Multipole Tree Algorithms <author>William T. Rankin / wrankin@ee.duke.edu <version>2.0.4 <abstract> The purpose of DPMTA is to provide user applications with flexible implementation of numerous multipole algorithms to efficiently comput N-body interactions for a wide variety of system sizes and particle configurations. The DPMTA code was written using the PVM distributed computing toolset and runs on a variety of platforms, from networks of workstations to parallel supercomputers. <description><url>http://www.ee.duke.edu/~wrankin/software.html</url> <reference><url>ftp://ftp.ee.duke.edu/pub/SciComp/docs/DPMTA.ps</url> <contact>William T. Rankin / wrankin@ee.duke.edu <keywords>fast multipole algorithm; workstation cluster <category>application <publication-date>13 January 1995 <environment> The DPMTA code was written using the PVM distributed computing toolset. <method> <application>electrostatic N-body problem <comments> </urc>

ftp://ftp.ee.duke.edu/pub/SciComp/src/DPMTA_2.0.4.tar.Z DPMTA - Distributed Parallel Multipole Tree Algorithms <author>William T. Rankin / wrankin@ee.duke.edu <version>2.0.4 <abstract> The purpose of DPMTA is to provide user applications with flexible implementation of numerous multipole algorithms to efficiently comput N-body interactions for a wide variety of system sizes and particle configurations. The DPMTA code was written using the PVM distributed computing toolset and runs on a variety of platforms, from networks of workstations to parallel supercomputers. <description><url>http://www.ee.duke.edu/~wrankin/software.html</url> <reference><url>ftp://ftp.ee.duke.edu/pub/SciComp/docs/DPMTA.ps</url> <contact>William T. Rankin / wrankin@ee.duke.edu <keywords>fast multipole algorithm; workstation cluster <category>application <publication-date>13 January 1995 <environment> The DPMTA code was written using the PVM distributed computing toolset. <method> <application>electrostatic N-body problem <comments> </urc>