A unified treatment for fast and spectrally accurate evaluation of electrostatic potentials subject to periodic boundary conditions in any or none of the three spatial dimensions is presented. Ewald decomposition is used to split the problem into a real-space and a Fourier-space part, and the FFT-based Spectral Ewald (SE) method is used to accelerate the computation of the latter. A key component in the unified treatment is an FFT-based solution technique for the free-space Poisson problem in three, two or one dimensions, depending on the number of non-periodic directions. The computational cost is furthermore reduced by employing an adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling factors. The SE method will always be most efficient for the triply periodic case as the cost of computing FFTs will then be the smallest, whereas the computational cost of the rest of the algorithm is essentially independent of periodicity. We show that the cost of removing periodic boundary conditions from one or two directions out of three will only moderately increase the total runtime. Our comparisons also show that the computational cost of the SE method in the free-space case is around four times that of the triply periodic case.
The Gaussian window function previously used in the SE method, is here compared to a piecewise polynomial approximation of the Kaiser-Bessel window function. With a carefully tuned shape parameter that is selected based on an error estimate for this new window function, runtimes for the SE method can be further reduced. Furthermore, we consider different methods for computing the force, and compare the runtime of the SE method with that of the Fast Multipole Method.
Fast Ewald Summation with Prolates for Charged Systems in the NPT Ensemble
Center for Computational Mathematics, Flatiron Institute(西蒙斯基金会平顿研究所计算数学中心);School of Mathematical Sciences, Shanghai Jiao Tong University(上海交通大学数学科学学院)
Accelerating Molecular Dynamics Simulations using Fast Ewald Summation with Prolates
Center for Computational Mathematics, Flatiron Institute(计算数学中心,Flatiron研究所);School of Mathematical Sciences, Shanghai Jiao Tong University(上海交通大学数学科学学院);Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所)
Fast summation of Stokes potentials using a new kernel-splitting in the DMK framework
Flatiron Institute, Simons Foundation(西蒙斯基金会平顿研究所);Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所);Royal Institute of Technology(皇家理工学院)
Bashkir State University(巴什基尔国立大学);Center for Micro and Nanoscale Dynamics of Dispersed Systems, Bashkir State University(巴什基尔国立大学分散系统微纳动力学中心);Fantalgo, LLC.(Fantalgo有限责任公司);Institute for Advanced Computer Studies(高级计算机研究所);Department of Computer Science(计算机科学系);University of Maryland, College Park(马里兰大学帕克分校)
An Adaptive Fast Algorithm for Periodic Coulomb Lattice Sums in Arbitrary Unit Cells
Center for Computational Mathematics, Flatiron Institute(计算数学中心,平顿研究所);Simons Foundation(西蒙斯基金会);Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所)