A fast solver for Poisson problems on infinite regular lattices

From MaRDI portal
Publication:2252191

DOI10.1016/J.CAM.2013.09.003zbMATH Open1294.65104arXiv1105.3505OpenAlexW2005861355MaRDI QIDQ2252191FDOQ2252191


Authors: A. Gillman, P. G. Martinsson Edit this on Wikidata


Publication date: 16 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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 extit{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(Nmsource), where Nmsource 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(NOmegalogNOmega) independent of Nmsource, where Omega is an artificial rectangular box containing the loaded points and NOmega is the number of points in Omega.


Full work available at URL: https://arxiv.org/abs/1105.3505




Recommendations




Cites Work


Cited In (12)





This page was built for publication: A fast solver for Poisson problems on infinite regular lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252191)