GOTPM: A Parallel Hybrid Particle-Mesh Treecode

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages, 9 figures, submitted to New Astronomy, check out http://www.cita.utoronto.ca/~dubinski/gotpm for more info plus an a

Scientific paper

We describe a parallel, cosmological N-body code based on a hybrid scheme using the particle-mesh (PM) and Barnes-Hut (BH) oct-tree algorithm. We call the algorithm GOTPM for Grid-of-Oct-Trees-Particle-Mesh. The code is parallelized using the Message Passing Interface (MPI) library and is optimized to run on Beowulf clusters as well as symmetric multi-processors. The gravitational potential is determined on a mesh using a standard PM method with particle forces determined through interpolation. The softened PM force is corrected for short range interactions using a grid of localized BH trees throughout the entire simulation volume in a completely analogous way to P$^3$M methods. This method makes no assumptions about the local density for short range force corrections and so is consistent with the results of the P$^3$M method in the limit that the treecode opening angle parameter, $\theta \to 0$. (abridged)

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

GOTPM: A Parallel Hybrid Particle-Mesh Treecode does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with GOTPM: A Parallel Hybrid Particle-Mesh Treecode, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GOTPM: A Parallel Hybrid Particle-Mesh Treecode will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-698742

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.