On well-separated sets and fast multipole methods
arXiv:1006.2269 · doi:10.1016/j.apnum.2011.06.011
Abstract
The notion of well-separated sets is crucial in fast multipole methods as the main idea is to approximate the interaction between such sets via cluster expansions. We revisit the one-parameter multipole acceptance criterion in a general setting and derive a relative error estimate. This analysis benefits asymmetric versions of the method, where the division of the multipole boxes is more liberal than in conventional codes. Such variants offer a particularly elegant implementation with a balanced multipole tree, a feature which might be very favorable on modern computer architectures.
Cited by in corpus (6)
- Adaptive fast multipole methods on the GPU
- A hybrid Eulerian-Lagrangian flow solver
- Dynamic autotuning of adaptive fast multipole methods on hybrid multicore CPU & GPU systems
- A general high order two-dimensional panel method
- Distributed and Adaptive Fast Multipole Method In Three Dimensions
- jaxFMM: An Adaptive, GPU-Parallel Implementation of the Fast Multipole Method in JAX