Fast algorithms for Helmholtz Green's functions

The formal representation of the quasi- periodic Helmholtz Green's function obtained by the method of images is only conditionally convergent and, thus, requires an appropriate summation convention for its evaluation. Instead of using this formal sum, we derive a candidate Green's function as a sum of two rapidly convergent series, one to be applied in the spatial domain and the other in the Fourier domain (as in Ewald's method). We prove that this representation of Green's function satisfies the Helmholtz equation with the quasi- periodic condition and, furthermore, leads to a fast algorithm for its application as an operator. We approximate the spatial series by a short sum of separable functions given by Gaussians in each variable. For the series in the Fourier domain, we exploit the exponential decay of its terms to truncate it. We use fast and accurate algorithms for convolving functions with this approximation of the quasi- periodic Green's function. The resulting method yields a fast solver for the Helmholtz equation with the quasi- periodic boundary condition. The algorithm is adaptive in the spatial domain and its performance does not significantly deteriorate when Green's function is applied to discontinuous functions or potentials with singularities. We also construct Helmholtz Green's functions with Dirichlet, Neumann or mixed boundary conditions on simple domains and use a modi. cation of the fast algorithm for the quasi- periodic Green's function to apply them. The complexity, in dimension d >= 2, of these algorithms is O(k(d) log k+C(log epsilon(-1))(d)), where e is the desired accuracy, k is proportional to the number of wavelengths contained in the computational domain and C is a constant. We illustrate our approach with examples.