Oct 27, 2012 · Here, we present several optimizations for that operator, which is known to be the costliest FMM operator. The most efficient ones do not only ...
Nov 20, 2012 · The fast multipole method (FMM) is a method first designed in [7] to reduce the cost of matrix-vector products from O(N2) to O(N) or O(N log N) ...
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 ...
Here, several optimizations for the multiple-to-local (M2L) operator are presented, known to be the costliest FMM operator, to reduce the precomputation ...
[PS] Optimized M2L Kernels for the Chebyshev Interpolation based ...
inria.hal.science › docs › paper
Oct 27, 2012 · 4 Optimizing the M2L operators. In all fast multipole methods the M2L operator adds the largest contribution to the overall computational.
For interpolation based on Chebyshev polynomials, in[4] important optimizations are proposed reducing complexity and computation time (pre-calculation, ...
For a study of their individual weaknesses and strenghts we refer to a forthcoming paper titled "Optimized M2L Kernels for the Chebyshev Interpolation based ...
People also ask
What is the fast Multipole method in CUDA?
Optimized M2L Kernels for the Chebyshev Interpolation based Fast Multipole Method · Berenger Bramas, Matthias Messner. 2012. A fast multipole method (FMM) for ...
In this paper we present algorithmic improvements for BLAS based M2L translation operator and benchmark them against FFT based M2L translation operators.
The multipole-to-local (M2L) operator then consists in evaluating the field due to particles lo- cated at Chebyshev nodes. This operation can be done ...