A FAST FREE MEMORY METHOD FOR AN EFFICIENT COMPUTATION OF CONVOLUTION KERNELS

作     者：Matthieu Aussal Marc Bakry Matthieu Aussal;Marc Bakry

作者机构：Ecole Polytechnique(CMAP)INRIAInstitut Polytechnique ParisRoute de Saclay 91128PalaiseauFrance 

出 版 物：《Journal of Computational Mathematics》 (计算数学（英文）)

年 卷 期：2023年第41卷第6期

页      面：1093-1116页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：funded by the DGA-AID (Grant No.2018600074) 

主　　题：Convolution product Fast multipole method Boundary integral equations Open-source 

摘      要：We introduce the Fast Free Memory method(FFM),a new implementation of the Fast Multipole Method(FMM)for the evaluation of convolution *** FFM aims at being easier to implement while maintaining a high level of performance,capable of handling industrially-sized *** FFM avoids the implementation of a recursive tree and is a kernel independent *** give the algorithm and the relevant complexity *** quasi-linear complexity enables the evaluation of convolution products with up to one billion *** illustrate numerically the capacities of the FFM by solving Boundary Integral Equations problems featuring dozen of millions of *** implementation is made freely available under the GPL 3.0 license within the Gypsilab framework.