Efficient and Scalable Electrostatics via Spherical Grids and Treecode Summation

02 September 2022, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

Evaluation of noncovalent electrostatic interactions is the dominant bottleneck in classical molecular dynamics simulations, and evaluation of Coulombic matrix elements similarly limits quantum mechanical self consistent field calculations. These difficulties are a result of the Coulomb operator’s slow decay, which necessitates the evaluation of large numbers of interactions. In this work, we use a combination of cubature techniques to factorize the Coulomb operator, and devise a hierarchical summation scheme, arriving at a novel technique that requires O(N log(N)) effort to evaluate electrostatic interactions. The factorization may be made arbitrarily accurate, allowing full control between computational expense and accuracy. By avoiding the fast Fourier transform to evaluate terms, the resulting algorithm bears a resemblance to that of the fast multipole method and offers many opportunities for highly scalable parallel implementations.

Keywords

Electrostatics
Coulomb
Noncovalent interactions
Electron Repulsion Integrals

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.