NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Fast Updating Multipole Coulombic Potential Calculation
Published
Author(s)
Thomas Hoft, Bradley Alpert
Abstract
We present a numerical method to efficiently and accurately re-compute the Coulomb potential of a large ensemble of charged particles after a subset of the particles undergoes a change of position. Errors are bounded even after a large number of such shifts, making it practical for use in Monte Carlo Markov chain methods in molecular dynamics, computational astrophysics, computational chemistry, and other applications. The method uses truncated multipole expansions of the potential and a tree decomposition of the computational domain to reduce the computational complexity. Computational costs scale logarithmically in the size of the problem. Scaling, accuracy, and efficiency are confirmed with numerical experiments. The new method outperforms a direct calculation for moderate problem sizes.
Hoft, T.
and Alpert, B.
(2017),
Fast Updating Multipole Coulombic Potential Calculation, Siam Journal on Scientific Computing, [online], https://doi.org/10.1137/16M1096189, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=921841
(Accessed October 14, 2025)