Mesh-refined P3M - A fast adaptive N-body algorithm

Details Mesh-refined P3M - A fast adaptive N-body algorithm Mesh-refined P3M - A fast adaptive N-body algorithm

Feb 1991

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1991apj...368l..23c&link_type=abstract

Astrophysical Journal, Part 2 - Letters (ISSN 0004-637X), vol. 368, Feb. 20, 1991, p. L23-L26. Research supported by NSERC.

Statistics

Computation

222

Computational Astrophysics, Computational Grids, Galactic Clusters, Many Body Problem, Particle Density (Concentration), Algorithms, Fourier Transformation

Scientific paper

Substantial improvements in the performance of 'particle-particle-particle-mesh' (P3M) algorithms may be achieved by allowing spatially adaptive mesh refinements in regions of high particle density. The cycle time under heavy clustering is about five times that for a uniform particle distribution: about 10-20 times faster than conventional P3M. The algorithm is roughly 50 percent faster than a 'tree code' while requiring significantly less memory.

Affiliated with

Also associated with

No associations

Rating

Mesh-refined P3M - A fast adaptive N-body algorithm 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 Mesh-refined P3M - A fast adaptive N-body algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mesh-refined P3M - A fast adaptive N-body algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1316134