High-performance BLAS formulation of the adaptive Fast Multipole Method

Olivier Coulaud 1 Pierre Fortin 2 Jean Roman 1
1 HiePACS - High-End Parallel Algorithms for Challenging Numerical Simulations
LaBRI - Laboratoire Bordelais de Recherche en Informatique, Inria Bordeaux - Sud-Ouest
2 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In a previous work, we have presented a new formulation of the uniform version of the Fast Multipole Method (FMM) for the Laplace equation by using matrix products that can be efficiently computed thanks to the BLAS (Basic Linear Algebra Subprograms) routines. We propose here to extend this formulation to the adaptive version of the FMM: this requires the conception of a new data structure for the octree, namely the octree with indirections, which is efficient for both uniform and non-uniform distributions, as well as a detection mechanism of the available uniform areas in non-uniform distributions. In comparison with other M2L computation schemes (block FFT, rotations and plane wave expansions) in the case of non-uniform distributions of particles, our BLAS version appears to be the fastest for the common precisions used when one solves the Laplace equation.
Document type :
Journal articles
Complete list of metadatas

Contributor : Lip6 Publications <>
Submitted on : Tuesday, April 28, 2015 - 2:48:32 PM
Last modification on : Wednesday, May 15, 2019 - 3:43:35 AM

Links full text



Olivier Coulaud, Pierre Fortin, Jean Roman. High-performance BLAS formulation of the adaptive Fast Multipole Method. Mathematical and Computer Modelling, Elsevier, 2010, 51 (3-4), pp.177-188. ⟨10.1016/j.mcm.2009.08.039⟩. ⟨hal-01146520⟩



Record views