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

view Abstract Citations (273) References (4) Co-Reads Similar Papers Volume Content Graphics Metrics Export Citation NASA/ADS Mesh-refined P 3M: A Fast Adaptive N-Body Algorithm Couchman, H. M. P. Abstract Substantial improvements in the performance of "particle-particle- particle-mesh" (P³M) algorithms may be achieved by allowing spatially adaptive mesh refinements in regions of high particle density. The cycle time under heavy clustering is ~ 5 times that for a uniform particle distribution: ~ 10-20 times faster than conventional P³M. The algorithm is roughly 50% faster than a "tree code" while requiring significantly less memory. Publication: The Astrophysical Journal Pub Date: February 1991 DOI: 10. 1086/185939 Bibcode: 1991ApJ. . . 368L. . 23C Keywords: Computational Astrophysics; Computational Grids; Galactic Clusters; Many Body Problem; Particle Density (Concentration) ; Algorithms; Fourier Transformation; Astrophysics; COSMOLOGY; GALAXIES: CLUSTERING; NUMERICAL METHODS full text sources ADS | Related Materials (1) Source Software: 2011ascl. soft03011C