Communications overlapping in fast multipole particle dynamics methods
โ Scribed by Jakub Kurzak; B. Montgomery Pettitt
- Book ID
- 108163924
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 623 KB
- Volume
- 203
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The numerical solution to N-body problems in gravitation or electrostatics has traditionally been obtained via particle-in-cell methods (PLC) since direct evaluation of all pairwise interparticle forces, requiring t!~( N 2) operations, is too expensive. Recently, hierarchical solvers, which use tree
This work presents a new adaptive node-cluster algorithm for fast multipole method. In the algorithm, we use rectangular boxes instead of cubes, subdivide a box based on its shape, and tighten the child boxes at each subdivision step. More importantly, we determine the number of expansion terms in m
One def'ming characteristic of a fast multipole calculation is the number of tiers (depth of tree) used to group the particles. For three dimensions, the standard boxing scheme restricts the number of lowest level boxes to be a power of eight. We present a method which through a simple scaling of th