Fast multipole methods for particle dynamics
From MaRDI portal
Publication:3437369
DOI10.1080/08927020600991161zbMath1113.81135WikidataQ37080258 ScholiaQ37080258MaRDI QIDQ3437369
Jakub Kurzak, B. Montgomery Pettitt
Publication date: 9 May 2007
Published in: Molecular Simulation (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2634295
82C22: Interacting particle systems in time-dependent statistical mechanics
70-08: Computational methods for problems pertaining to mechanics of particles and systems
81-08: Computational methods for problems pertaining to quantum theory
42A85: Convolution, factorization for one variable harmonic analysis
81V55: Molecular physics
78A35: Motion of charged particles
70F10: (n)-body problems
Related Items
FMMTL: FMM Template Library A Generalized Framework for Kernel Matrices, Fast Updating Multipole Coulombic Potential Calculation, Application of the fast multipole method for the evaluation of magnetostatic fields in micromagnetic computations, An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation, Relativistic space-charge field calculation by interpolation-based treecode
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Massively parallel implementation of a fast multipole method for distributed memory machines
- Ewald summation techniques in perspective: A survey
- Comments on P\(^3\)M, FMM, and the Ewald method for large periodic Coulombic systems
- Multipole Ewald sums for the fast multipole method
- Error estimates for the fast multipole method
- Skeletons from the treecode closet
- An optimized Ewald method for long-ranged potentials
- Fast parallel algorithms for short-range molecular dynamics
- A portable parallel particle program
- Communications overlapping in fast multipole particle dynamics methods
- A fast adaptive multipole algorithm in three dimensions
- Parallel many-body simulations without all-to-all communication
- Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
- A multipole-based algorithm for efficient calculation of forces and potentials in macroscopic periodic assemblies of particles
- The Parallel Multipole Method on the Connection Machine
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- An Implementation of the Fast Multipole Method without Multipoles
- An Improved Fast Multipole Algorithm for Potential Fields
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- Greengard’s N-Body Algorithm is not Order N
- A fast algorithm for particle simulations
