Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6962Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Zhao, Feng | - |
| dc.date | 2004-10-20T20:10:52Z | - |
| dc.date | 2004-10-20T20:10:52Z | - |
| dc.date | 1987-10-01 | - |
| dc.date.accessioned | 2013-10-09T02:47:58Z | - |
| dc.date.available | 2013-10-09T02:47:58Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-995 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6962 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | We develop an algorithm that computes the gravitational potentials and forces on N point-masses interacting in three-dimensional space. The algorithm, based on analytical techniques developed by Rokhlin and Greengard, runs in order N time. In contrast to other fast N-body methods such as tree codes, which only approximate the interaction potentials and forces, this method is exact ?? computes the potentials and forces to within any prespecified tolerance up to machine precision. We present an implementation of the algorithm for a sequential machine. We numerically verify the algorithm, and compare its speed with that of an O(N2) direct force computation. We also describe a parallel version of the algorithm that runs on the Connection Machine in order 0(logN) time. We compare experimental results with those of the sequential implementation and discuss how to minimize communication overhead on the parallel machine. | - |
| dc.format | 4592892 bytes | - |
| dc.format | 3220469 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-995 | - |
| dc.title | An O(N) Algorithm for Three-Dimensional N-Body Simulations | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.