A Parallel CUDA Implementation of the Gauss-Legendre-Spherical-t Method for Electrostatic Interactions

14 February 2025, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

Computing electrostatic interactions remains the bottleneck of molecular dynamics (MD) simulations despite more than a century of effort in developing methods to accelerate the calculation. Previously we have developed the Spherical Grid and Treecode (SGT) and Gauss-Legendre-Spherical-t (GLST) algorithms for electrostatic interactions. Here we explain the computational details and discuss the performance of GLST. The GLST algorithm achieves O(N) scaling and should be less demanding in parallel communication when compared with the widely used particle mesh Ewald (PME) method, and likely comparable to the communication costs of the fast multipole method (FMM). We find that GLST is suitable for rapid calculation of long-range electrostatic interactions in MD simulations as it has highly tunable accuracy and should scale well on massively parallel computing architectures. The GLST software presented here is available as a standalone library on GitHub.

Keywords

Long-range electrostatics
Gauss-Legendre-Spherical-t
Molecular dynamics simulation
CUDA Parallelization

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.