A kernel-independent adaptive fast multipole algorithm in two and three dimensions

  title={A kernel-independent adaptive fast multipole algorithm in two and three dimensions},
  author={Lexing Ying and George Biros and Denis Zorin},
  journal={Journal of Computational Physics},
A fast multipole method for the three-dimensional Stokes equations
An Adaptive Fast Multipole Method-Based PDE Solver in Three Dimensions
An adaptive fast volume solver is presented using a new version of the Fast Multipole Method, incorporated with a pre-existing boundary integral formulation for the development of an adaptive embedded boundary solver.
A free-space adaptive fmm-based pde solver in three dimensions
A kernel-independent, adaptive fast multipole method of arbitrary order accuracy for solving elliptic PDEs in three dimensions with radiation boundary conditions is presented and numerical examples for the Laplace, modified Helmholtz and Stokes equations are presented.
A A Distributed Memory Fast Multipole Method for Volume Potentials
A Fast Multipole Method (FMM) for computing volume potentials and use them to construct spatially-adaptive solvers for the Poisson, Stokes and Helmholtz problems, and a fast scheme for 2:1 balancing.
Fast Multipole Method Using the Cauchy Integral Formula
This paper presents a novel kernel independent FMM, which leads to diagonal multipole-to-local operators and results in a significant reduction in the computational cost, in particular when high accuracy is needed.
An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
A version of the fast multipole method (FMM) is described for charge distributions on the line, utilizing the matrix compression scheme described in [H. Cheng, Z. Gimbutas, P. Martinsson, and V. Rokhlin].
High performance BLAS formulation of the adaptive Fast Multipole Method
A parallel fast multipole method for elliptic difference equations
A method to compute periodic sums
A kernel independent fast multipole algorithm for radial basis functions


An Improved Fast Multipole Algorithm for Potential Fields on the Line
A new version of the fast multipole method for the evaluation of potential fields on the line is introduced, based on generalized Gaussian quadratures, which is roughly twice as fast as previously published algorithms.
A fast, high-order algorithm for the solution of surface scattering problems: basic implementation, tests, and applications
The present algorithm can evaluate accurately in a personal computer scattering from bodies of acoustical sizes of several hundreds and exhibits super-algebraic convergence; it can be applied to smooth and nonsmooth scatterers, and it does not suffer from accuracy breakdowns of any kind.
A Generalized Fast Multipole Method for Nonoscillatory Kernels
This work presents a modification of the fast multipole method (FMM) in two dimensions that approximates appropriately chosen parts of the kernel with "tensor products" of Legendre expansions and uses the singular value decomposition (SVD) to compress the resulting representations.
A new version of the fast multipole method for screened Coulomb interactions in three dimensions
A new version of the fast multipole method (FMM) for screened Coulomb interactions in three dimensions relies on an expansion in evanescent plane waves, with which the amount of work can be reduced to 40p2 + 6p3 operations per box.
An Implementation of the Fast Multipole Method without Multipoles
An implementation is presented of the fast multipole method, which uses approximations based on Poisson’s formula, and results are given that show the importance of good level selection.
Fast Fourier Transform Accelerated Fast Multipole Algorithm
A new block decomposition of the multipole expansion data that provides numerical stability and efficient computation in the Fourier domain using the fast Fourier transform (FFT) is described.
Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
This paper presents a preconditioned, Krylov-subspace iterative algorithm, where a modified multipole algorithm with a novel adaptation scheme is used to compute the iterates for solving dense matrix
Grid-Multipole Calculations
New high-order, momentum conserving methods for spreading charge to and interpolating potential from the mesh allow efficient grid-based algorithms to be used in high- order accurate n-body particle codes such as the fast multipole algorithm of Greengard and Rokhlin.
A precorrected-FFT method for electrostatic analysis of complicated 3-D structures
A new algorithm for accelerating the potential calculation which occurs in the inner loop of iterative algorithms for solving electromagnetic boundary integral equations, which can be superior to the fast multipole based schemes by more than an order of magnitude.