Efficient and scalable electrostatics via spherical grids and treecode summation

Area of Science:

• Computational chemistry
• Molecular modeling
• Scientific computing

Background:

• Evaluating electrostatic interactions is computationally expensive in molecular dynamics and quantum mechanics.
• The slow decay of the Coulomb operator requires numerous interaction calculations, creating a bottleneck.

Purpose of the Study:

• To develop a novel, efficient method for calculating electrostatic interactions.
• To reduce the computational cost of simulations involving electrostatic forces.

Main Methods:

• Utilized cubature techniques to factorize the Coulomb operator.
• Devised a hierarchical summation scheme for interaction evaluation.
• Developed an algorithm with O(N log N) computational complexity.

Main Results:

• Achieved an O(N log N) method for electrostatic interaction evaluation.
• The technique allows for arbitrary accuracy, balancing computational cost and precision.
• The algorithm avoids the fast Fourier transform, similar to the fast multipole method.

Conclusions:

• The novel technique significantly accelerates simulations by efficiently handling electrostatic interactions.
• The method provides a tunable trade-off between accuracy and computational expense.
• Offers potential for highly scalable parallel implementations in computational science.