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

快速多极方法低复杂度平移算子的自动综合

Automatic Synthesis of Low-Complexity Translation Operators for the Fast Multipole Method

Isuru Fernando, Chaoqi Lin, Andreas Klöckner

AI总结:

本文提出一种混合符号-数值方法,利用常系数椭圆型PDE自动综合快速多极方法所需的低复杂度平移算子,将运算复杂度从O(p^{2d})降至O(p^d),并通过数值实验验证了其计算规模与精度。

摘要:

我们展示了一种新的混合符号-数值方法,用于自动综合执行快速多极方法(FMM)所需的所有平移算子族。我们的方法适用于任意维度和任意平移不变核。快速多极方法当然是实现长程(例如库仑)多体相互作用评估线性复杂度的领先方法。快速多极方法(FMM)中平移算子的低复杂度通常通过针对满足特定偏微分方程(PDE)的势专门设计的算法来实现。在缺乏PDE或专门算法的情况下,基于泰勒级数的FMM或核无关FMM已被使用,但其渐近代价更高。当以符号方式提供势所满足的常系数椭圆型PDE时,我们的算法可以自动综合需要$\mathrm{O}(p^d)$次运算的平移算子,其中$p$是展开阶数,$d$是维度,而在(笛卡尔)泰勒展开上执行的朴素方法需要$\mathrm{O}(p^{2d})$次运算。这是通过使用一种压缩方案实现的,该方案渐近地减少泰勒展开中的项数,然后直接在这种“压缩”表示上进行操作。对共享子表达式的合理利用使得局部展开和多极展开的形成、平移和评估可以在$\mathrm{O}(p^{d})$次运算内完成,而基于FFT的方案使得多极到局部的平移可以在$\mathrm{O}(p^{d-1}\log(p))$次运算内完成。我们通过对经典物理中若干势的数值实验,展示了代码生成和评估的计算规模以及数值精度。

英文摘要:

The FMM is the leading approach for attaining linear complexity in the evaluation of long-range (e.g. Coulomb) many-body interactions. We demonstrate a new, hybrid symbolic-numerical method for the automatic synthesis of all families of translation operators required for the execution of the Fast Multipole Method (FMM). Our method is dimension-independent (demonstrated in 2D and 3D) and applicable to any translation-invariant kernel. Low complexity in translation operators for the FMM is usually achieved by algorithms specialized for a potential obeying a specific partial differential equation (PDE). Absent a PDE or specialized algorithms, Taylor series based FMMs or kernel-independent FMM have been used, at asymptotically higher expense. When symbolically provided with a constant-coefficient elliptic PDE obeyed by the potential, our algorithm can automatically synthesize translation operators requiring $\mathrm{O}(p^d)$ operations, where $p$ is the expansion order and $d$ is dimension, compared with $\mathrm{O}(p^{2d})$ operations in a naive approach carried out on (Cartesian) Taylor expansions. This is achieved by using a compression scheme that asymptotically reduces the number of terms in the Taylor expansion and then operating directly on this "compressed" representation. Judicious exploitation of shared subexpressions permits formation, translation, and evaluation of local and multipole expansions to be performed in $\mathrm{O}(p^d)$ operations, while an FFT-based scheme permits multipole-to-local translations in $\mathrm{O}(p^{d-1}\log(p))$ operations. We demonstrate computational scaling of code generation and evaluation as well as numerical accuracy through numerical experiments on a number of potentials from classical physics.

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

↑