@Article{JCM-41-6,
author = {Matthieu, Aussal and Marc, Bakry},
title = {A Fast Free Memory Method for an Efficient Computation of Convolution Kernels},
journal = {Journal of Computational Mathematics},
year = {2023},
volume = {41},
number = {6},
pages = {1093--1116},
abstract = {<p style="text-align: justify;">We introduce the Fast Free Memory method (FFM), a new implementation of the Fast
Multipole Method (FMM) for the evaluation of convolution products. The FFM aims at
being easier to implement while maintaining a high level of performance, capable of handling industrially-sized problems. The FFM avoids the implementation of a recursive tree
and is a kernel independent algorithm. We give the algorithm and the relevant complexity estimates. The quasi-linear complexity enables the evaluation of convolution products
with up to one billion entries. We illustrate numerically the capacities of the FFM by solving Boundary Integral Equations problems featuring dozen of millions of unknowns. Our
implementation is made freely available under the GPL 3.0 license within the Gypsilab
framework.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2202-m2021-0324},
url = {https://global-sci.com/article/84157/a-fast-free-memory-method-for-an-efficient-computation-of-convolution-kernels}
}