arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.05600math.NAcs.NA
收藏

卷积核高效计算的快速免存储方法

The Fast and Free Memory Method for the efficient computation of convolution kernels

Matthieu Aussal, Marc Bakry

摘要:

本文介绍了一种新的计算卷积积的快速方法--快速自由存储法(FFM)。FFM继承了快速多极子方法,是一种仅下降且与核无关的算法。我们给出了完整的算法和相关的复杂性分析。虽然密集矩阵通常出现在这样的计算中,但线性存储复杂性和准线性计算复杂性使得能够评估具有高达十亿个条目的卷积产品。我们展示了我们如何能够解决复杂的散射问题,使用边界积分方程与数以百万计的未知数。我们的实现在Gypsilab框架内根据GPL 3.0许可证免费提供。

英文摘要:

We introduce the Fast Free Memory method (FFM), a new fast method for the numerical evaluation of convolution products. Inheriting from the Fast Multipole Method, the FFM is a descent-only and kernel-independent algorithm. We give the complete algorithm and the relevant complexity analysis. While dense matrices arise normally in such computations, the linear storage complexity and the quasi-linear computational complexity enable the evaluation of convolution products featuring up to one billion entries. We show how we are able to solve complex scattering problems using Boundary Integral Equations with dozen of millions of unknowns. Our implementation is made freely available within the Gypsilab framework under the GPL 3.0 license.

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

↑