COULAUD, Olivier; FORTIN, Pierre; ROMAN, Jean

doi:10.1016/j.jcp.2007.09.027

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

COULAUD, Olivier
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

FORTIN, Pierre
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

ROMAN, Jean
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

Idioma

Article de revue

Este ítem está publicado en

Journal of Computational Physics. 2008, vol. 227, n° 3, p. 1836-1862

Elsevier

Resumen en inglés

The multipole-to-local (M2L) operator is the most time-consuming part of the far field computation in the Fast Multipole Method for Laplace equation. Its natural expression, though commonly used, does not respect a sharp error bound: we here first prove the correctness of a second expression. We then propose a matrix formulation implemented with BLAS (Basic Linear Algebra Subprograms) routines in order to speed up its computation for these two expressions. We also introduce special data storages in memory to gain greater computational efficiency. This BLAS scheme is finally compared, for uniform distributions, to other M2L improvements such as block FFT, rotations and plane wave expansions. When considering runtime, extra memory storage, numerical stability and common precisions for Laplace equation, the BLAS version appears as the best one.< Leer menos

Palabras clave en inglés

Fast Multipole Methods

Laplace equation

BLAS routines

error bound

Fast Fourier Transform

rotations

plane waves

uniform distribution

Metadatos

Compartir este ítem

Licencia de uso del documento

High performance BLAS formulation of the multipole-to-local operator in the Fast Multipole Method

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

URI

DOI

Orígen

Centros de investigación