A fast solver for Poisson problems on infinite regular lattices

  • Authors:

  • A. Gillman;P. G. Martinsson

  • Affiliations:

  • -;-

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2014

Quantified Score

Hi-index 7.29

Visualization

Abstract

The Fast Multipole Method (FMM) provides a highly efficient computational tool for solving constant coefficient partial differential equations (e.g. the Poisson equation) on infinite domains. The solution to such an equation is given as the convolution between a fundamental solution and the given data function, and the FMM is used to rapidly evaluate the sum resulting upon discretization of the integral. This paper describes an analogous procedure for rapidly solving elliptic difference equations on infinite lattices. In particular, a fast summation technique for a discrete equivalent of the continuum fundamental solution is constructed. The asymptotic complexity of the proposed method is O(N"s"o"u"r"c"e), where N"s"o"u"r"c"e is the number of points subject to body loads. This is in contrast to FFT based methods which solve a lattice Poisson problem at a cost O(N"@WlogN"@W) independent of N"s"o"u"r"c"e, where @W is an artificial rectangular box containing the loaded points and N"@W is the number of lattice points in @W.