Optimizing the adaptive fast multipole method for fractal sets
Hadi Pouransari, Eric Darve

TL;DR
This paper analyzes and optimizes the adaptive fast multipole method (FMM) for fractal point distributions, introducing a new complexity analysis, parameter optimization, and a subdividing double-threshold method to enhance performance.
Contribution
It provides a comprehensive framework for adaptive FMM on fractal sets, demonstrating ${ m O}(N)$ complexity and introducing new parameter tuning techniques.
Findings
Adaptive FMM achieves ${ m O}(N)$ complexity for fractal distributions.
New subdividing double-threshold method improves performance.
Optimal parameters depend on fractal dimension of point sets.
Abstract
We have performed a detailed analysis of the fast multipole method (FMM) in the adaptive case, in which the depth of the FMM tree is non-uniform. Previous works in this area have focused mostly on special types of adaptive distributions, for example when points accumulate on a 2D manifold or accumulate around a few points in space. Instead, we considered a more general situation in which fractal sets, e.g., Cantor sets and generalizations, are used to create adaptive sets of points. Such sets are characterized by their dimension, a number between 0 and 3. We introduced a mathematical framework to define a converging sequence of octrees, and based on that, demonstrated how to increase . A new complexity analysis for the adaptive FMM is introduced. It is shown that the complexity is achievable for any distribution of particles, when a modified adaptive FMM…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
