arXiv · 2607.15103
A fast summation method for the DFT-D3 dispersion correction
Abstract
The DFT-D3 dispersion correction is routinely added to machine learning force fields (MLFFs) trained on dispersion-deficient functionals such as PBE. Its environment-dependent pair coefficients, however, break the atom-centered separability that fast summation methods require, forcing practitioners either to truncate D3 or to accept a substantial slowdown. We introduce FourierD3, a method that uses a functional low-rank decomposition to restore this separability and enable particle-mesh evaluation in $O(N\log N)$ time without a real-space cutoff on the dispersion sum.
Explore related subjects
Keep this discovery
Victoria Valeeva, Cheuk Hin Ho, Mario Geiger, Franco Pellegrini, Gábor Csányi, Emine Kucukbenli, Christoph Ortner. 2026-07-16. A fast summation method for the DFT-D3 dispersion correction. https://arxiv.org/abs/2607.15103
Cite the original work for its findings. Save a collection to share your selection of sources.