Fast updating multipole coulombic potential calculation
From MaRDI portal
Publication:5268992
DOI10.1137/16M1096189zbMATH Open1376.31005OpenAlexW2624536438MaRDI QIDQ5268992FDOQ5268992
Authors: Thomas A. Höft, Bradley K. Alpert 
Publication date: 14 June 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1096189
Recommendations
Potentials and capacities, extremal length and related notions in higher dimensions (31B15) Multipole methods applied to problems in optics and electromagnetic theory (78M16)
Cites Work
- Title not available (Why is that?)
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A fast adaptive multipole algorithm in three dimensions
- Randomized algorithms for the low-rank approximation of matrices
- Rapid solution of integral equations of classical potential theory
- Title not available (Why is that?)
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems
- On the Compression of Low Rank Matrices
- A fast algorithm for particle simulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Understanding the Hastings algorithm
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- A direct solver with \(O(N)\) complexity for variable coefficient elliptic PDEs discretized via a high-order composite spectral collocation method
- Fast multipole methods for particle dynamics
- A technique for updating hierarchical skeletonization-based factorizations of integral operators
Cited In (10)
- A fast simple algorithm for computing the potential of charges on a line
- On the precision increasing in calculation of potential for the systems of interactive atoms
- An Iterative PPPM Method for Simulating Coulombic Systems on Distributed Memory Parallel Computers
- A small box fast Fourier transformation method for fast Poisson solutions in large systems
- Accurate and efficient computation of nonlocal potentials based on Gaussian-sum approximation
- Fast relative approximation of potential fields.
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- A new algorithm for electrostatic interactions in Monte Carlo simulations of charged particles
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- Simulating Coulomb and log-gases with hybrid Monte Carlo algorithms
Uses Software
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)
