arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.04732math.NAcs.NA
收藏

任意周期静电势的快速Ewald求和

Fast Ewald summation for electrostatic potentials with arbitrary periodicity

Davood Saffar Shamshirgar, Joar Bagge, Anna-Karin Tornberg

摘要:

本文提出了一种统一的处理方法,用于在任意三维空间中或无三维空间中对受周期边界条件影响的静电势进行快速和光谱精确的计算。Ewald分解用于将问题分解为实空间和傅立叶空间部分,基于FFT的谱Ewald(SE)方法用于加速后者的计算。在统一的治疗的一个关键组成部分是一个基于FFT的解决方案技术的自由空间泊松问题的三维,二维或一维,这取决于非周期性方向的数量。计算成本进一步降低,采用自适应FFT的双周期和单周期的情况下,允许不同的本地上采样因子。SE方法对于三重周期性的情况总是最有效的,因为计算FFT的成本将是最小的,而算法的其余部分的计算成本基本上与周期性无关。我们表明,从三个方向中的一个或两个方向去除周期边界条件的成本只会适度增加总运行时间。我们的比较还表明,在自由空间的情况下,SE方法的计算成本是大约四倍的三倍周期的情况下。在这里,将先前在SE方法中使用的高斯窗函数与Kaiser-Bessel窗函数的分段多项式近似进行比较。利用基于该新窗函数的误差估计选择的仔细调整的形状参数,可以进一步减少SE方法的运行时间。此外,我们考虑了不同的方法来计算力,并比较了SE方法的运行时间与快速多极子方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑