Abstract
We present a kernel-independent, adaptive fast multipole method (FMM) of arbitrary order accuracy for solving elliptic PDEs in three dimensions with radiation and periodic boundary conditions. The algorithm requires only the ability to evaluate the Green's function for the governing equation and a representation of the source distribution (the right-hand side) that can be evaluated at arbitrary points. The performance is accelerated in three ways. First, we construct a piecewise polynomial approximation of the right-hand side and compute far-field expansions in the FMM from the coefficients of this approximation. Second, we precompute tables of quadratures to handle the near-field interactions on adaptive octree data structures, keeping the total storage requirements in check through the exploitation of symmetries. Third, we employ shared-memory parallelization methods and load-balancing techniques to accelerate the major algorithmic loops of the FMM.We present numerical examples for the Laplace, modified Helmholtz and Stokes equations.
Original language | English (US) |
---|---|
Pages (from-to) | 79-122 |
Number of pages | 44 |
Journal | Communications in Applied Mathematics and Computational Science |
Volume | 6 |
Issue number | 1 |
DOIs | |
State | Published - 2011 |
Keywords
- Adaptive methods
- Fast multipole method
- Kernel-independent fast multipole method
- Poisson solver
- Volume integrals
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics