Fast updating multipole coulombic potential calculation
From MaRDI portal
Recommendations
Cites work
- A direct solver with O(N) complexity for variable coefficient elliptic PDEs discretized via a high-order composite spectral collocation method
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A fast adaptive multipole algorithm in three dimensions
- A fast algorithm for particle simulations
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A technique for updating hierarchical skeletonization-based factorizations of integral operators
- Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems
- Fast multipole methods for particle dynamics
- scientific article; zbMATH DE number 4080996 (Why is no real title available?)
- scientific article; zbMATH DE number 46317 (Why is no real title available?)
- scientific article; zbMATH DE number 1064576 (Why is no real title available?)
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- On the Compression of Low Rank Matrices
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Randomized algorithms for the low-rank approximation of matrices
- Rapid solution of integral equations of classical potential theory
- Understanding the Hastings algorithm
Cited in
(10)- Accurate and efficient computation of nonlocal potentials based on Gaussian-sum approximation
- Simulating Coulomb and log-gases with hybrid Monte Carlo algorithms
- A new algorithm for electrostatic interactions in Monte Carlo simulations of charged particles
- A fast simple algorithm for computing the potential of charges on a line
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- A small box fast Fourier transformation method for fast Poisson solutions in large systems
- An Iterative PPPM Method for Simulating Coulombic Systems on Distributed Memory Parallel Computers
- On the precision increasing in calculation of potential for the systems of interactive atoms
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- Fast relative approximation of potential fields.
This page was built for publication: Fast updating multipole coulombic potential calculation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268992)
