Distributed and Adaptive Fast Multipole Method In Three Dimensions
Numerical Analysis
2020-02-13 v1 Distributed, Parallel, and Cluster Computing
Data Structures and Algorithms
Numerical Analysis
Abstract
We develop a general distributed implementation of an adaptive fast multipole method in three space dimensions. We rely on a balanced type of adaptive space discretisation which supports a highly transparent and fully distributed implementation. A complexity analysis indicates favorable scaling properties and numerical experiments on up to 512 cores and 1 billion source points verify them. The parameters controlling the algorithm are subject to in-depth experiments and the performance response to the input parameters implies that the overall implementation is well-suited to automated tuning.
Cite
@article{arxiv.2002.04894,
title = {Distributed and Adaptive Fast Multipole Method In Three Dimensions},
author = {Jonathan Bull and Stefan Engblom},
journal= {arXiv preprint arXiv:2002.04894},
year = {2020}
}