Fast convolution with free-space Green's functions

22Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

Abstract

We introduce a fast algorithm for computing volume potentials – that is, the convolution of a translation invariant, free-space Green's function with a compactly supported source distribution defined on a uniform grid. The algorithm relies on regularizing the Fourier transform of the Green's function by cutting off the interaction in physical space beyond the domain of interest. This permits the straightforward application of trapezoidal quadrature and the standard FFT, with superalgebraic convergence for smooth data. Moreover, the method can be interpreted as employing a Nystrom discretization of the corresponding integral operator, with matrix entries which can be obtained explicitly and rapidly. This is of use in the design of preconditioners or fast direct solvers for a variety of volume integral equations. The method proposed permits the computation of any derivative of the potential, at the cost of an additional FFT.

Cite

CITATION STYLE

APA

Vico, F., Greengard, L., & Ferrando, M. (2016). Fast convolution with free-space Green’s functions. Journal of Computational Physics, 323, 191–203. https://doi.org/10.1016/j.jcp.2016.07.028

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free