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

Abstract

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.