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