The Fast and Free Memory Method for the efficient computation of convolution kernels
From MaRDI portal
Publication:6325171
arXiv1909.05600MaRDI QIDQ6325171FDOQ6325171
Authors: Matthieu Aussal, Marc Bakry 
Publication date: 12 September 2019
Abstract: 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.
Numerical methods for integral equations (65R20) Numerical methods for discrete and fast Fourier transforms (65T50) Applications to the sciences (65Z05)
This page was built for publication: The Fast and Free Memory Method for the efficient computation of convolution kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325171)
