The Fast Multipole Algorithm

Authors:
John Board;Klaus Schulten
Affiliations:
-;-
Venue:
Computing in Science and Engineering
Year:
2000

Citing 2
Cited 6

A fast algorithm for particle simulations

Journal of Computational Physics
Scientific Simulations with Special Purpose Computers: The Grade Systems

Scientific Simulations with Special Purpose Computers: The Grade Systems

Parallel multigrid summation for the N-body problem

Journal of Parallel and Distributed Computing
Multilevel fast multipole algorithm for elastic wave scattering by large three-dimensional objects

Journal of Computational Physics
Diagnosis, Tuning, and Redesign for Multicore Performance: A Case Study of the Fast Multipole Method

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
A treecode for accurate force calculations

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Brief announcement: towards a communication optimal fast multipole method and its implications at exascale

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A CPU: GPU Hybrid Implementation and Model-Driven Scheduling of the Fast Multipole Method

Proceedings of Workshop on General Purpose Processing Using GPUs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Accurate computation of the mutual interactions of N particles through electrostatic or gravitational potential has impeded progress in many areas of simulation science. The Fast Multipole Algorithm provides an efficient scheme for reducing computational complexity.