Fast multipole methods for particle dynamics
From MaRDI portal
Convolution, factorization for one variable harmonic analysis (42A85) Computational methods for problems pertaining to mechanics of particles and systems (70-08) (n)-body problems (70F10) Motion of charged particles (78A35) Computational methods for problems pertaining to quantum theory (81-08) Molecular physics (81V55) Interacting particle systems in time-dependent statistical mechanics (82C22)
Recommendations
Cites work
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A fast adaptive multipole algorithm in three dimensions
- A fast algorithm for particle simulations
- A multipole-based algorithm for efficient calculation of forces and potentials in macroscopic periodic assemblies of particles
- A portable parallel particle program
- An Implementation of the Fast Multipole Method without Multipoles
- An Improved Fast Multipole Algorithm for Potential Fields
- An optimized Ewald method for long-ranged potentials
- Comments on P\(^3\)M, FMM, and the Ewald method for large periodic Coulombic systems
- Communications overlapping in fast multipole particle dynamics methods
- Error estimates for the fast multipole method
- Ewald summation techniques in perspective: A survey
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- Fast parallel algorithms for short-range molecular dynamics
- Greengard’s N-Body Algorithm is not Order N
- scientific article; zbMATH DE number 4080996 (Why is no real title available?)
- scientific article; zbMATH DE number 3743203 (Why is no real title available?)
- scientific article; zbMATH DE number 41859 (Why is no real title available?)
- scientific article; zbMATH DE number 44502 (Why is no real title available?)
- scientific article; zbMATH DE number 46317 (Why is no real title available?)
- scientific article; zbMATH DE number 46777 (Why is no real title available?)
- scientific article; zbMATH DE number 193953 (Why is no real title available?)
- scientific article; zbMATH DE number 862958 (Why is no real title available?)
- scientific article; zbMATH DE number 274379 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
- Massively parallel implementation of a fast multipole method for distributed memory machines
- Multipole Ewald sums for the fast multipole method
- Parallel many-body simulations without all-to-all communication
- Skeletons from the treecode closet
- The Parallel Multipole Method on the Connection Machine
Cited in
(31)- Yet another fast multipole method without multipoles -- pseudoparticle multipole method
- Calculating complex interactions in molecular dynamics simulations employing Lagrangian particle tracking schemes
- Efficient methods for handling long-range forces in particle-particle simulations
- Communications overlapping in fast multipole particle dynamics methods
- An efficient algorithm for polarizable interactions: a uniformly distributed one-dimensional case
- A multipole-based algorithm for efficient calculation of forces and potentials in macroscopic periodic assemblies of particles
- Coarse-graining the electrostatic potential via distributed multipole expansions
- Fast neighbor lists for adaptive-resolution particle simulations
- The rapid assessment for three-dimensional potential model of large-scale particle system by a modified multilevel fast multipole algorithm
- A new algorithm for electrostatic interactions in Monte Carlo simulations of charged particles
- An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation
- Efficient Fourier basis particle simulation
- NFFT based Ewald summation for electrostatic systems with charges and dipoles
- Relativistic space-charge field calculation by interpolation-based treecode
- Efficient algorithms for electrostatic interactions including dielectric contrasts
- Fast exact evaluation of particle interaction vectors in the finite volume particle method
- Fast algorithms for classical physics
- Building upon fast multipole methods to detect and model organizations
- An improved fast multipole method for electrostatic potential calculations in a class of coarse-grained molecular simulations
- Characterization of the accuracy of the fast multipole method in particle simulations
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- scientific article; zbMATH DE number 953046 (Why is no real title available?)
- scientific article; zbMATH DE number 833680 (Why is no real title available?)
- Error estimates for calculating the non-bonded interactions in molecular dynamics simulations
- FMMTL: FMM Template Library A Generalized Framework for Kernel Matrices
- Fast updating multipole coulombic potential calculation
- Efficient computational algorithms for fast electrostatics and molecular docking
- A fast algorithm for particle simulations
- Multiplicity of couple solution for a fractional (, )-like system
- Fast electrostatic force calculation on parallel computer clusters
- Application of the fast multipole method for the evaluation of magnetostatic fields in micromagnetic computations
This page was built for publication: Fast multipole methods for particle dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437369)
