Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Optimized M2L Kernels for the Chebyshev Interpolation based Fast Multipole Method

Abstract : A fast multipole method (FMM) for asymptotically smooth kernel functions (1/r, 1/r^4, Gauss and Stokes kernels, radial basis functions, etc.) based on a Chebyshev interpolation scheme has been introduced in [Fong et al., 2009]. The method has been extended to oscillatory kernels (e.g., Helmholtz kernel) in [Messner et al., 2012]. Beside its generality this FMM turns out to be favorable due to its easy implementation and its high performance based on intensive use of highly optimized BLAS libraries. However, one of its bottlenecks is the precomputation of the multiple-to-local (M2L) operator, and its higher number of floating point operations (flops) compared to other FMM formulations. Here, we present several optimizations for that operator, which is known to be the costliest FMM operator. The most efficient ones do not only reduce the precomputation time by a factor up to 340 but they also speed up the matrix-vector product. We conclude with comparisons and numerical validations of all presented optimizations.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Matthias Messner Connect in order to contact the contributor
Submitted on : Tuesday, November 20, 2012 - 1:44:16 AM
Last modification on : Friday, November 18, 2022 - 9:24:18 AM
Long-term archiving on: : Thursday, February 21, 2013 - 11:50:42 AM


Files produced by the author(s)


  • HAL Id : hal-00746089, version 2
  • ARXIV : 1210.7292



Matthias Messner, Bérenger Bramas, Olivier Coulaud, Eric Darve. Optimized M2L Kernels for the Chebyshev Interpolation based Fast Multipole Method. [Research Report] 2012, pp.22. ⟨hal-00746089v2⟩



Record views


Files downloads