Automatic Synthesis of Low-Complexity Translation Operators for the Fast Multipole Method

by   Isuru Fernando, et al.

We demonstrate a new, hybrid symbolic-numerical method for the automatic synthesis of all families of translation operators required for the execution of the Fast Multipole Method (FMM). Our method is applicable in any dimensionality and to any translation-invariant kernel. The Fast Multipole Method, of course, is the leading approach for attaining linear complexity in the evaluation of long-range (e.g. Coulomb) many-body interactions. Low complexity in translation operators for the Fast Multipole Method (FMM) is usually achieved by algorithms specialized for a potential obeying a specific partial differential equation (PDE). Absent a PDE or specialized algorithms, Taylor series based FMMs or kernel-independent FMM have been used, at asymptotically higher expense. When symbolically provided with a constant-coefficient elliptic PDE obeyed by the potential, our algorithm can automatically synthesize translation operators requiring O(p^d) operations, where p is the expansion order and d is dimension, compared with O(p^2d) operations in a naive approach carried out on (Cartesian) Taylor expansions. This is achieved by using a compression scheme that asymptotically reduces the number of terms in the Taylor expansion and then operating directly on this “compressed” representation. Judicious exploitation of shared subexpressions permits formation, translation, and evaluation of local and multipole expansions to be performed in O(p^d) operations, while an FFT-based scheme permits multipole-to-local translations in O(p^d-1log(p)) operations. We demonstrate computational scaling of code generation and evaluation as well as numerical accuracy through numerical experiments on a number of potentials from classical physics.


page 1

page 2

page 3

page 4


Neural Q-learning for solving elliptic PDEs

Solving high-dimensional partial differential equations (PDEs) is a majo...

Solidfmm: A highly optimised library of operations on the solid harmonics for use in fast multipole methods

We present solidfmm, a highly optimised C++ library for the solid harmon...

JAX-DIPS: Neural bootstrapping of finite discretization methods and application to elliptic problems with discontinuities

We present a scalable strategy for development of mesh-free hybrid neuro...

Fast Computation of Electrostatic Potentials for Piecewise Constant Conductivities

We present a novel numerical method for solving the elliptic partial dif...

Learning PDE Solution Operator for Continuous Modeling of Time-Series

Learning underlying dynamics from data is important and challenging in m...

High Performance Evaluation of Helmholtz Potentials using the Multi-Level Fast Multipole Algorithm

Evaluation of pair potentials is critical in a number of areas of physic...

Please sign up or login with your details

Forgot password? Click here to reset