2016
DOI: 10.1016/j.jcp.2016.07.028
|View full text |Cite
|
Sign up to set email alerts
|

Fast convolution with free-space Green's functions

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 smoot… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
112
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 84 publications
(113 citation statements)
references
References 18 publications
0
112
0
1
Order By: Relevance
“…To the best of our knowledge, this observation has to be attributed to Vainikko [31] but has then been revitalized by Vico et al [34]. It is essential to a proper discretization of the Lippmann-Schwinger equation (1).…”
Section: Green's Function Discretization For the Volume: Gmentioning
confidence: 97%
“…To the best of our knowledge, this observation has to be attributed to Vainikko [31] but has then been revitalized by Vico et al [34]. It is essential to a proper discretization of the Lippmann-Schwinger equation (1).…”
Section: Green's Function Discretization For the Volume: Gmentioning
confidence: 97%
“…Consequently, the only remaining difficulty is the computation of the convolution in (18), which however is a ubiquitous problem in computational physics and scientific computing in general. In fact, the solution of (18) A variety of efficient numerical methods has been developed to solve the Poisson equation in unbounded domains [50][51][52][53][54][55][56][57]. While most of them are based on formulation (18) it is also possible to employ (19) directly.…”
Section: B Evaluation Of the Dipolar Interaction Potentialmentioning
confidence: 99%
“…However, in our application these limitations are not an issue which is why we employ the second algorithm. The second algorithm is based on the observation that the solution of (18) is indistinguishable from the solution of is an entire function [56] (and thus C ∞ ). Application of the convolution theorem to (20) yields…”
Section: B Evaluation Of the Dipolar Interaction Potentialmentioning
confidence: 99%
See 1 more Smart Citation
“…For our next example, we consider a lens problem based on one in [58]. We use this example to demonstrate the method on a problem with more complicated spatial variation of permittivity and also to show how the method behaves when increasing the frequency of the problem relative to the size of the domain.…”
Section: Eaton Lensmentioning
confidence: 99%