Skip to main content
Proceedings. Mathematical, Physical, and Engineering Sciences logoLink to Proceedings. Mathematical, Physical, and Engineering Sciences
. 2016 Jul;472(2191):20160255. doi: 10.1098/rspa.2016.0255

Superalgebraically convergent smoothly windowed lattice sums for doubly periodic Green functions in three-dimensional space

Oscar P Bruno 1, Stephen P Shipman 2,, Catalin Turc 3, Stephanos Venakides 4
PMCID: PMC4971249  PMID: 27493573

Abstract

This work, part I in a two-part series, presents: (i) a simple and highly efficient algorithm for evaluation of quasi-periodic Green functions, as well as (ii) an associated boundary-integral equation method for the numerical solution of problems of scattering of waves by doubly periodic arrays of scatterers in three-dimensional space. Except for certain ‘Wood frequencies’ at which the quasi-periodic Green function ceases to exist, the proposed approach, which is based on smooth windowing functions, gives rise to tapered lattice sums which converge superalgebraically fast to the Green function—that is, faster than any power of the number of terms used. This is in sharp contrast to the extremely slow convergence exhibited by the lattice sums in the absence of smooth windowing. (The Wood-frequency problem is treated in part II.) This paper establishes rigorously the superalgebraic convergence of the windowed lattice sums. A variety of numerical results demonstrate the practical efficiency of the proposed approach.

Keywords: scattering, periodic Green function, lattice sum, smooth truncation, super-algebraic convergence, boundary-integral equations

1. Introduction

The numerical solution of problems of electromagnetic, acoustic and elastic wave scattering by doubly periodic structures entails significant difficulties. Assuming harmonic temporal dependence with frequency ω, the scattered fields can be obtained by means of numerical methods based on integral equations—provided that a viable numerical scheme is used to evaluate the classical radiating quasi-periodic Green function Gqper for the three-dimensional scalar Helmholtz operator H[u]=Δu+k2u (k=ω/c, where c is the propagation speed). The difficulties arise, to a significant extent, from challenges posed by the evaluation of the quasi-periodic Green function.

The quasi-periodic Green function Gqper can be constructed as an infinite sum of free-space Green functions (Helmholtz monopoles) with doubly periodically distributed monopole singularities. Let v1 and v2 denote two independent vectors in R2 that characterize the periodicity, and let v1 and v2 be the dual vectors, that is vivj=δij. The Bloch wavevector will be denoted by k=αv1+βv2, where α and β are the Bloch wavenumbers. With the notation |⋅| for vector norm and x=(x,y,z) and x~=(x,y) and

rmn2=|x~+mv1+nv2|2+z2, 1.1

the quasi-periodic Green function can be expressed in the form

Gqper(x)=14πm,nZeikrmnrmneik(mv1+nv2). 1.2

Note that k⋅(mv1+nv2)=αm+βn. The function Gqper(x) possesses the quasi-periodic property

Gqper(x~+mv1+nv2,z)=Gqper(x~,z)ei(αm+βn). 1.3

The series expansion (1.2) possesses notoriously poor convergence properties. Various methods to accelerate its convergence, notably the Ewald method [13], have been proposed. A survey in these regards is given in [4], and a comprehensive discussion of lattice summation techniques can be found in [5]. A few remarks concerning the computational costs associated with previous accelerated methods for evaluation of the Green function (1.2) are made below in this section.

In the approach proposed presently, the infinite sum (1.2) is evaluated by multiplying its (m,n)th term by the value χa(r~mn) of a slow-rise smooth windowing function χa which, evaluated at the cylindrical radius

r~mn=|x~+mv1+nv2|, 1.4

restricts the sum to values of m and n satisfying 0r~mna. (Note that r~mn=rmn if and only if z=0.) The function χa=χa(r~) is obtained as a scaled version of an infinitely smooth real-valued function χ(r~) that equals zero for r~>1 and equals 1 for r~<c, where c<1 is an adequately selected positive number. (For the numerical experiments presented in this paper, the value c=0.5 was used.) The function χa is then defined by

χa(r~)=χ(r~a). 1.5

The function χa decreases from 1 to 0 in a slow and smooth manner: its derivatives tend to zero as a throughout the region of decrease car~a.

The main results in this contribution include (i) A proof, presented in §2, establishing that, as the truncation radius a tends to +, the smoothly truncated Green function converges faster than any negative power of a—at least for arrangements of the period, frequency and Bloch wavenumbers that lie away from certain ‘Wood configurations’ (for which the Green function Gqper ceases to exist); as well as (ii) a new accelerated integral-equation solver presented in §3 which, relying on the aforementioned windowed Green function, gives rise to a highly efficient overall solution method for the problems at hand. Theorem 2.1 establishes the super-algebraically fast convergence of the truncated sum to the three-dimensional quasi-periodic Green function away from Wood configurations; a corresponding convergence theorem for one-dimensional periodic diffraction gratings in R2 was presented in [6] (cf. also [7]). Figures 1 and 2 demonstrate the convergence of the windowed series both near and away from Wood configurations. The numerical methods presented in §3, in turn, integrate the windowed Green function in the context of fast integral-equation solvers [8,9]. Interestingly, the structure of the acceleration methodology inherent in these solvers is exploited to completely avoid evaluation of the windowed Green function at pairs of surface points, using instead a much smaller number of values of the Green function on a certain three-dimensional Cartesian grid. A variety of numerical results presented in §4 demonstrate the character of the resulting solvers for doubly periodic scattering problems. Green function methods that are valid even at and around Wood configurations are presented in [7,10] for two-dimensional configurations, and in part II for the three-dimensional case.

Figure 1.

Figure 1.

The error in the approximation of the quasi-periodic Green function by multiplying the lattice sum (1.2) (with x replaced by xx′) by a smooth truncation function χ(|x+m|/a)χ(|y+n|/a), in which χ(s)=exp(2e1/(1s)/(s2)) for 1<s<2; and χ(s)=1 for s<1; and χ(s)=0 for s>2. The plots show maxxK|Gi+1Gi| as a function of ai on a loglog scale, in which a truncated lattice sum Gi is computed for a=ai=1.2i, x′=(00,1) and K is a grid of evenly spaced points in [00.6]×[00.6]×[0.6,1.4], excluding x=x′. The lattice vectors are v1=(1,00) and v2=(0,1,0), the Bloch wavenumbers are (α=0,β=0), and the frequencies are k=0.4,0.8,0.95 (first row) and k=0.99,2.24,2.5 (second row). Both k=1.0 and k≈2.23607 are Wood frequencies, at which convergence is not available. (Online version in colour.)

Figure 2.

Figure 2.

These plots are similar to those in figure 1 except that the Bloch wavenumbers are (α=0.4, β=−0.3), and the frequencies are k=0.3,0.93,1.1. There is a Wood frequency at k≈0.921954. (Online version in colour.)

As is well known, for certain wavenumbers k and certain Bloch wavenumbers (α,β), the lattice sum (1.2) does not converge. This can be seen in the spectral representation of the Green function that results by applying the Poisson Summation Formula to the series (1.2). Let A=∥v1×v2∥. Then

Gqper(x~,z)=i2Aj,Z1γjei[(2πjv1+2πv2)+k]x~eiγj|z|, 1.6

in which the propagation constants γj are defined by

vj=(2πjv1+2πv2)+kandγj=(k2vj2)1/2. 1.7

(The branch of the square root that defines γj is selected in such a way that 1=1 and that the branch cut is the negative imaginary semiaxis.) The lattice sum (1.2) converges if and only if γj≠0 for all integer pairs (j,ℓ). Configurations (k,α,β) for which γj vanishes for one or more integer pairs (j,ℓ) are known as Wood configurations, or Wood anomalies. Clearly, expression (1.6) is not meaningful if γj=0 for some integer pair (j,ℓ). Wood anomalies were first noticed by Wood [11] and first treated mathematically by Rayleigh [12]; a brief discussion concerning historical aspects can be found in [7], Remark 2.2. As shown in [7] and part II, Green function methods can still be used at Wood anomalies provided appropriately defined Green functions are used.

In view of the branch used in equation (1.7) for the square root function, Rayleigh waves either decay as |z| increases (evanescent modes) or are outgoing travelling waves (propagating modes). There exist finitely many propagating modes for any given configuration. Wood frequencies are also called ‘cut-off frequencies’, because the corresponding Rayleigh wave eivjx~eiγj|z| switches from propagating to evanescent as the frequency descends below a Wood value. Rayleigh waves for which γj is small impinge upon the periodic structure at ‘grazing incidence’, and they dominate sum (1.6). In the limit of a particular combination of k and (α,β), at which one or more γj are zero, the product of the sum multiplied by any one of the vanishing γj’s tends to a z-independent linear combination of exactly grazing waves of the form eivjx~.

Challenges in the calculation of the Green function arise from two main sources, namely,

  1. The lattice sum (1.2) does not converge absolutely. This sum does converge conditionally away from Wood anomalies [13], but its convergence, which results from cancellations among slowly decreasing terms, is too slow to be useful from a computational standpoint.

  2. At Wood configurations, the lattice sum (1.2) does not converge and a denominator in the Rayleigh-wave expansion (1.6) exactly vanishes. Additionally, the convergence of the series (1.2) increasingly deteriorates as the parameters in the problem are varied in such a way that a Wood configuration is approached.

The first of these challenges is addressed in this article, and the second is treated in [7] for the two-dimensional case, and in part II [14] for three dimensions.

As mentioned above, the proposed approach for summation of the series is based on smooth windowing of the series (1.2). A similar windowed-summation technique can be applied to the spectral series (1.6) with similar super-algebraic convergence. A study of the potential advantages offered by such a strategy is left for future work.

Previous accelerated procedures based on either or both of the spatial and spectral representations for the Green function Gqper give rise to significantly faster algorithms than does direct summation of either expression (1.2) or (1.6). The two-dimensional algorithms (e.g. [15], section 3.8.2 and [16]) can be perfectly adequate, but in the three-dimensional context algorithms for evaluation of quasi-periodic Green functions have remained inefficient. As a significant reference in these regards, we mention one of the most advanced hybrid approaches previously put forth for evaluation of periodic Green functions [17], which is based on use of a combination of spatial and spectral representations as well as Kummer and Shanks transforms. The hybrid algorithm [17] has been reported [18] (cf. also [17]) to require several milliseconds per evaluation point. Thus, even for a small discretization consisting of N=6×16×16 points (assuming a total of six patches are used to represent a given scattering surface S, and 6×6 discretization points are used in each patch) the number 2×106 of evaluations of periodic Green functions which are necessary to evaluate one matrix–vector product requires a computational time of at least 2×103 s. By contrast, as it can be seen in table 2, in the case of periodic two-dimensional arrays of spheres discretized by means of such a 6×16×16 mesh, our solvers require less than 10 s per matrix–vector product (an improvement factor of a least 100)—and can produce full scattering results with an error of the order of 10−4 in a total of 55 s.

Table 2.

Convergence of the periodic solvers using Ga for increasing values of the truncation radius a for doubly periodic arrays of spherical and bean-shaped scatterers under normal incidence. The reference solution for computing ε1 has a=120 and conservation of energy error ε≈10−5.

computational times
scatterer k N a ε ε1 iter set-up time/it total
sphere 0.75 1350 20 5.0×10−3 6.4×10−3 5 14 s 0.4 s 16 s
sphere 0.75 1350 30 4.7×10−4 1.6×10−3 5 29 s 0.4 s 31 s
sphere 0.75 1350 40 2.4×10−5 2.2×10−4 5 51 s 0.4 s 53 s
sphere 9 5766 20 5.0×10−3 3.6×10−3 13 14 s 3.4 s 57 s
sphere 9 5766 30 1.1×10−3 1.3×10−3 13 29 s 3.4 s 1 min 14 s
sphere 9 5766 40 7.0×10−5 2.1×10−4 13 51 s 3.4 s 1 min 35 s
bean 0.75 1350 20 3.3×10−3 5.5×10−3 10 14 s 1.2 s 26 s
bean 0.75 1350 30 1.9×10−3 1.4×10−3 10 29 s 1.2 s 42 s
bean 0.75 1350 40 3.2×10−4 3.4×10−4 10 51 s 1.2 s 1 min 5 s
bean 9 5766 20 6.1×10−3 4.0×10−3 17 14 s 5.35 s 1 min 45 s
bean 9 5766 30 1.1×10−3 9.9×10−4 17 29 s 5.35 s 2 min 0 s
bean 9 5766 40 3.2×10−5 1.7×10−4 17 51 s 5.35 s 2 min 30 s

Boundary-integral equations based on the proposed Green function methods are presented in §3. In particular, §3 describes the numerical methods used to implement the proposed fast lattice sums and forward maps (matrix–vector products) which, upon use of an iterative linear algebra solver (GMRES) produces the densities in certain boundary-integral representations of the scattered field. In all numerical examples, it was assumed the scatterers satisfy sound-soft (Dirichlet) boundary conditions. Section 4 demonstrates the resulting method by means of a variety of numerical results. A few concluding remarks are presented in §5.

2. Proof of fast convergence of smoothly truncated lattice sums

Our smooth truncation method proceeds by multiplying the (m,n)th term of the series (1.2) by the scaled cut-off function χ(r~mn/a) defined in equation (1.5); the smoothly truncated series is thus given by the finite sum

Ga(x,y,z):=14πm,nZeikrmnrmneik(mv1+nv2)χ(r~mna)Gqper(x,y,z), 2.1

where of rmn and r~mn are given by (1.1) and (1.4), respectively. The following theorem establishes the super-algebraic convergence of the truncated lattice sum to the quasi-periodic Green function for triples (k,α,β) that are not Wood configurations.

Theorem 2.1 (Windowed Green function at non-Wood frequencies: super-algebraic convergence). —

Let χ(r) be an infinitely smooth truncation function which equals to 1 for rr1 and equals 0 for rr2 (0<r1<r2). If γjℓ≠0 for all (j,)Z2, then the functions

Ga(x,y,z)=14πm,nZeikrmnrmneik(mv1+nv2)χ(r~mna)

converge to the radiating quasi-periodic Green function Gqper(x,y,z) super-algebraically fast as the truncation radius a tends to infinity. In detail, for each positive integer n, there exist constants Cn=Cn(k,α,β) such that

|Gka(x,y,z)Gqper(x,y,z)|<Cn(k,α,β)an, 2.2

when a is sufficiently large. The inequality holds uniformly for all points (x,y,z), excluding the singularities of the Green function for which rmn=0 for some (m,n)Z2. At these points, a term that is common to Gka and Gqper is infinite. If Gka and Gqper are modified by excluding this term, then the correspondingly modified version of equation (2.2) remains valid.

An analogous estimate holds for Gka(x,y,z)Gqper(x,y,z).

Proof. —

Denote by Λ={mv1+nv2:m,nZ} the lattice of singularities of the Green function, and denote by Λ={jv1+v2:j,Z} the dual lattice. The dual vectors v1 and v2 are defined by vivj=δij. Initially, we assume that the shift x~=(x,y) from these positions as well as the Bloch wavenumbers α and β are equal to zero. Setting ε=a−1, we have for the full and the truncated sums

4πGqper=rΛexp(ik|r|2+z2)|r|2+z2 2.3

and

4πGa=rΛχ(ε|r|)exp(ik|r|2+z2)|r|2+z2. 2.4

With the intention of using the Poisson summation formula to calculate the truncated sum we introduce a smooth function ϕ(|r|) that vanishes in a neighbourhood of |r|=0 and is equal to 1 for |r|≥r1. For ε<1, the sum is broken into two pieces:

rΛχ(ε|r|)exp(ik|r|2+z2)|r|2+z2=0rΛ(1ϕ(|r|))exp(ik|r|2+z2)|r|2+z2+rΛϕ(|r|)χ(ε|r|)exp(ik|r|2+z2)|r|2+z2. 2.5

In the first sum on the right, χ is omitted as a factor as it equals unity when ϕ≠1. The term is thus independent of the truncation variable ε. It is easy to check that the fraction in the second term can be expressed as a product of an exponential function and a Laurent expansion:

exp(ikr2+z2)r2+z2=eikrrg(r),g(r)=1+j=1ajrj. 2.6

The coefficients aj are functions of z and the expansion is convergent when r>|z|.

We re-express the second sum in (2.5) by means of the Poisson summation formula:

rΛϕ(|r|)χ(ε|r|)g(|r|)eik|r||r|=1AξΛF[ϕ(|r|)χ(ε|r|)g(|r|)eik|r||r|](ξ), 2.7

where A=∥v1×v2∥. In what follows we re-express the Fourier transform on the right-hand side of this equation (which, for brevity, we denote by F(ξ)) in terms of suitable contour integrals. To do this, we represent the spatial and Fourier variables in polar coordinates, r=(r,θ) and ξ=(ξ,γ), and we let f(r)=ϕ(r)g(r), and we thus obtain

F(ξ)=0ππf(r)χ(εr)ei(k2πξcos(θγ))rdθdr=20f(r)χ(εr)0πei(k2πξcosθ)rdθdr=20f(r)χ(εr)11ei(k2πξs)rds1s2dr=20f(r)χ(εr)(11iei(k2πξs)rds1s2dr11iei(k2πξs)rds1s2dr). 2.8

The last equality is valid by contour integration in the complex s-plane in view of the exponential decay of the integrand as Im(s). We have thus obtained

F(ξ)=2(11iI(s)ds1s211iI(s)ds1s2), 2.9

where

I(s)=0f(r)χ(εr)ei(k2πξs)rdr. 2.10

Integrand (2.10) decays exponentially fast at infinity since Im(s)<0. Thus, integration by parts (in which the boundary terms vanish because f(r) vanishes near r=0) yields

I(s)=1i(k2πξs)0[f(r)+f(r)(χ(εr)1)+εf(r)χ(εr)]ei(k2πξs)rdr=I0(s)+Iε(s), 2.11

where

I0(s)=1i(k2πξs)0f(r)ei(k2πξs)rdr=1[i(k2πξs)]n0f(n)(r)ei(k2πξs)rdr, 2.12

and where, noting that {χ=1}{ϕ1} for ε<1, we have χ−1=0, χ′=0 and f(r)=g(r) in the region {χ=1}, and, thus

Iε(s)=1i(k2πξs)0[g(r)(χ(εr)1)+εg(r)χ(εr)]ei(k2πξs)rdr. 2.13

Thus, introducing a rescaled version gε of the function g,

gε(ρ)=g(ρε)=ρρ2+(εz)2exp(ikz2ερ+ρ2+(εz)2)=1+j=1ajεjρj 2.14

the integrals Iε(s) become

Iε(s)=εi(k2πξs)0[gε(εr)(χ(εr)1)+gε(εr)χ(εr)]ei(k2πξs)rdr=1i(k2πξs)0[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)]ei(k2πξs)ρ/εdρ=(1)nεn[i(k2πξs)]n+10dndρn[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)]ei(k2πξs)ρ/εdρ.

In view of (2.9), the splitting I(s)=I0(s)+Iε(s) effects the splitting

F(ξ)=F0(ξ)+Fε(ξ), 2.15

for F(ξ), where letting

S±(ρ)=±1±1iei(k2πξs)ρ/ε[i(k2πξs)]n+1ds1s2=2i0e(i(k2πξ)2πξt2)ρ/ε[i(k2πξ)2πξt2]n+1dt±2i+t2 2.16

(the last expression of which incorporates the changes of variables s=±1−it2) we have denoted

F0(ξ)=20f(n)(r)(11iei(k2πξs)r[i(k2πξs)]nds1s2dr11iei(k2πξs)r[i(k2πξs)]nds1s2dr) 2.17

and

Fε(ξ)=2(1)nεn0dndρn[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)](S(ρ)S+(ρ))dρ. 2.18

Assume now that ξ≠0; the case ξ=0 will be treated separately. In view of the hypothesis k−2πξ≠0 the integral |S+| admits the finite upper bound

|S+(ρ)|02e2πξt2ρ/εdt[(k2πξ)2+(2πξt2)2](n+1)/2(4+t4)1/402e2πξt2ρ/εdt|k2πξ|n+1 2.19
=(ερξ)1/21|k2πξ|n+10eπt2dt=12(ερξ)1/21|k2πξ|n+1. 2.20

Analogously, in view of the assumption k+2πξ≠0, we obtain

|S(ρ)|12(ερξ)1/21|k+2πξ|n+1. 2.21

Returning to the expression for Fε(ξ) above, observe that, since χ(ρ)=1 for ρr1, and χ(ρ)=0 for ρr2, the integral in ρ from 0 to in (2.18) can be re-expressed in the form Fε(ξ)=Fε1(ξ)+Fε2(ξ), where

Fε1(ξ)=2(1)nεnr1r2dndρn[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)](S(ρ)S+(ρ))dρ

and

Fε2(ξ)=2(1)n+1εnr2gε(n+1)(ρ)(S(ρ)S+(ρ))dρ.

The bounds (2.19) and (2.21) thus imply

|Fε1(ξ)|εn+1/2ξ1/2(1|k2πξ|n+1+1|k+2πξ|n+1)r1r2|dndρn[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)]|dρρ1/2. 2.22

Clearly, as ε→0 the functions gε(ρ) converge to 1 uniformly over the interval [r1,r2], and thus integral (2.22) converges to r1r2χ(n+1)(ρ)ρ1/2dρ in this limit. In particular, these integrals are bounded by a constant Cn1>0 for all ε<1 and we have

|Fε1(ξ)|Cn1εn+1/2ξ1/2(1|k2πξ|n+1+1|k+2πξ|n+1). 2.23

Similarly, for Fε2(ξ) we have

|Fε2(ξ)|εn+1/2ξ1/2(1|k2πξ|n+1+1|k+2πξ|n+1)r2|gε(n+1)(ρ)|dρρ1/2. 2.24

But from (2.14), we obtain

gε(n+1)(ρ)=(1)n+1ρn+1j=1aj(j+n)!(j1)!εjρj, 2.25

and, we thus see that, for ε sufficiently small, r2|gε(n+1)(ρ)|ρ1/2dρ is bounded by a certain constant Cn2, so that

|Fε2(ξ)|Cn2εn+1/2ξ1/2(1|k2πξ|n+1+1|k+2πξ|n+1). 2.26

Combining the estimates Fε1(ξ) and Fε2(ξ), we thus find that there exists a constant Cn3 such that

|Fε(ξ)|εn+1/2Cn3ξ1/2(1|k2πξ|n+1+1|k+2πξ|n+1). 2.27

For ξ=0, in turn, we have

F(0)=0ππf(r)χ(εr)eikrdθdr=2π0f(r)χ(εr)eikrdr=2πik0f(r)eikrdr2πik0[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)]eikρ/εdρ=2πik0f(r)eikrdr+(1)n2πik(εik)n+10dndρn[gε(ρ)(χ(ρ)1)+gε(ρ)χ(ρ)]eikρ/εdρ=F0(0)+Fε(0). 2.28

Again, F0(0) is independent of ε and the integral in Fε(0) has a limit as ε→0. Thus, one obtains constants Cn0>0 such that |Fε(0)|Cn0εn+1.

The estimates above now allow us to now establish the convergence as ε→0 of the series on the right-hand side of equation (2.7). If n≥1, then as long as 2π|ξ|≠|k| for all ξΛ*, the sum of |Fε(ξ)| over all ξΛ* is convergent, and one obtains

ξΛ|Fε(ξ)|Cnεn+1/2. 2.29

The Poisson Summation Formula now gives

ArΛϕ(|r|)χ(ε|r|)g(|r|)eik|r||r|=ξΛF0(ξ)+ξΛFε(ξ). 2.30

But the first term on the right-hand side of this equation is independent of ε, and, in view of (2.29), the second term on the right-hand side tends to zero super-algebraically fast. It follows that the sum on the left-hand side of (2.30) converges super-algebraically fast, as needed.

Inclusion of the Bloch quasi-periodicity factors in the lattice sum can now be accomplished by replacing the expression exp(ik|r|2+z2)/|r|2+z2 by

exp(ik|r|2+z2)|r|2+z2eikr, 2.31

where k=αv1+βv2. Equation (2.30) becomes

ArΛϕ(|r|)χ(ε|r|)g(|r|)eik|r||r|eikr=ξΛF0(ξ+k2π)+ξΛFε(ξ+k2π), 2.32

The bound (2.27), shifted by k/2π, is

|Fε(ξ+k2π)|εn+1/2Cn3ξ1/2(1|k2π|ξ+k/(2π)||n+1+1|k+2π|ξ+k/(2π)||n+1),

which is valid whenever

k2|2πξ+k|2. 2.33

The validity of (2.33) for all ξZ2 is exactly the condition that (k,α,β) is not a Wood triple.

Inclusion of a shift in r by a fixed vector r′=(x,y). Consider the lattice sum of the quantities

exp(ik|rr|2+z2)|rr|2+z2, 2.34

in which we have taken k=0. The case k≠0 is again treated by shifting the Fourier variable ξ as shown above. As the cut-off functions ϕ and χ are also shifted, there ensues a mere exponential factor in the Fourier transform, and equation (2.30) becomes

ArΛϕ(|rr|)χ(ε|rr|)g(|rr|)eik|rr||rr|=ξΛF0(ξ)e2πiξr+ξΛFε(ξ)e2πiξr. 2.35

The bound (2.29) persists

|ξΛFε(ξ)e2πiξr|Cnεn+1/2, 2.36

and one again obtains super-algebraic convergence.

Error bound for the gradient of the Green function. The gradient of the monopole eikr/r is given by the equations

xeikrr=(ikcosθcosθr)eikrr,yeikrr=(iksinθsinθr)eikrr 2.37

and

zeikrr=(ikzrzr2)eikrr. 2.38

It suffices to show that the error bound proven in the theorem remains true, if the monopole eikr/r is replaced in the proof by any of the terms of the above equations. These terms are products of the monopole multiplied by r−1, or by cosθ, or by sinθ or by a selection of two of these factors. The bound is clearly preserved when multiplying the monopole by z, because the latter factors out of the summation that constitutes the Green function.

Multiplying the monopole by r−1 or r−2 corresponds to introducing the factor ε/ρ or (ε/ρ)2, respectively, in the subsequent integration over ρ, thus enhancing the error bound by one or two orders in ε. The integrand is zero (see explanation following (2.18)) when ρ<r1, thus the denominator ρ is no cause of concern.

The following observations show that the error bound is preserved in the terms in which the monopole is multiplied by cosθ or sinθ.

  • — The first double integral of (2.8) acquires the factors cosθ or sinθ in its integrand. Thus, the second double integral in (2.8) (obtained by the change of the integration variable θθ+γ) exhibits the factors cos(θ+γ) or sin(θ+γ) that can be split into a linear combination of cosθ and sinθ, with the corresponding splitting of the integral.

  • — The double integral that contains the factor sinθ is equal to zero; the integrand of the integration with respect to θ is an exact derivative and the integration is over the closed loop from −π to π.

  • — What is left is the second double integral in (2.8) with the extra factor cosθ in the integrand. The change of the variable of integration cosθ=s leads to having an extra factor s in the subsequent integrals with respect to s. This introduces the extra factor |s|=|±1−it2| into the numerator of the first integral in (2.19).

  • — Following the change of variable s=±1−it2, the factor |s| is replaced by its upper bound 1+t2 and the integral is split accordingly into a sum of two integrals. The first integral is exactly the one that provides the error bound of the theorem. The extra factor t2 in the second integral provides the extra factor ε/ξρ in the bounds (2.19) and (2.21) when ξ≠0. Thus, the error bound of the theorem is preserved in this case.

  • — If ξ=0, the first integral in (2.28) has the factor cosθ or sinθ that integrates to zero.

 ▪

3. Fast high-order integral solvers for problems of scattering by doubly periodic structures

For definiteness, we restrict our treatment to diffractive structures consisting of arrays of separated obstacles arranged in a two-dimensional periodic fashion in three-dimensional space. Denoting by an open set ΩR3 the region occupied by a ‘reference obstacle’ (which could be given by the union of a number of connected components) and letting S=∂Ω denote its boundary (the reference scattering boundary), the overall three-dimensional doubly periodic scattering structure and its boundary are given by

Ωper=m,nZΩmnandSper=m,nZSmn, 3.1

where we have set Ωmn=Ωmv1nv2 and Smn=Smv1nv2, m,nZ. It will be assumed that the sets Ωmn, as well as their boundaries, are pairwise disjoint. Consider the sound-soft scattering problem

Δu+k2u=0inR3Ωperandu=uinconΩper,} 3.2

in which an incident plane wave

uinc(x)=exp[i(kx~γz)], 3.3

with |k|2+γ2=k2 and x=(x~,z) illuminates the structure from above and thus gives rise to a scattered field u. Owing to the periodicity of the domain Ωper, in the regions Ω+ and Ω above and below the array (Ω+={(x~,z):z>maxz,(x~,z)Ωper} and Ω={(x~,z):z<minz,(x~,z)Ωper}) the fields satisfy radiation conditions expressed in terms of the classical Rayleigh expansions: the scattered fields u+ and u in the regions Ω+ and Ω must be ‘outgoing’, that is, they must admit Rayleigh expansions of the form

u+(x)=j,ZBj+exp[i(2πjv1+2πv2+k)x~]exp[iγjz],xΩ+ 3.4

and

u(x)=j,ZBjexp[i(2πjv1+2πv2+k)x~]exp[iγjz],xΩ, 3.5

wherein no waves in Ω+ propagate downward, and no waves in Ω propagate upward.

Using the outgoing free-space Green function Gk(x)=eik|x|/4π|x|, the scattered field u is sought in the form of a combined-field layer potential

u(x)=SperGk(xx)n(x)φqper(x)ds(x)+iηSperGk(xx)φqper(x)ds(x) 3.6

with unknown surface density φqper. Here n is the outer unit normal to Sper and ηR denotes a coupling constant. The unknown density φqper is the solution of the combined-field integral equation

12φqper(x)+SperGk(xx)n(x)φqper(x)ds(x)+iηSperGk(xx)φqper(x)ds(x)=exp[i(kx~γz)],xSper 3.7

which enforces the sound-soft boundary condition. The well-known term 12φqper in (3.7) arises as a singular contribution of the first integral in (3.6) in the limit as x approaches the boundary.

Equations (3.7) can be rewritten in a form that involves integration over the reference boundary S only. The corresponding integral equations make use of the (α,β)-quasi-periodic Green function (1.2), in which x is replaced by the difference xx′ between source and influence points

Gkqper(xx)=m,n=Gk(x~x~+mv1+nv2,zz)eik(mv1+nv2). 3.8

Integral equation (3.7) can equivalently be expressed in the form

12φqper(x)+m,nZSmnG(xx)φqper(x)ds(x)=exp[i(kx~γz)],xSper, 3.9

where

G(xx)=Gk(xx)n(x)+iηGk(xx). 3.10

Denoting by φ the restriction of φqper to the reference boundary S and taking into account the quasi-periodicity of the density φqper, integral equation (3.7) can be re-expressed in the form

φ(x)2+SGkper(xx)n(x)φ(x)ds(x)+iηSGkper(xx)φ(x)ds(x)=exp[i(kx~γz)],xS. 3.11

Thus, solution of either equation (3.9) or (3.11) produces the density φ(x) which, upon insertion into (3.6) gives rise to the desired quasi-periodic scattered field. Note that, in view of its quasi-periodicity, the unknown φ is determined throughout Sper by its values on the unit cell S—and thus testing on S should suffice to determine φ uniquely. Indeed, the uniqueness of the problem thus posed, which is not pursued here, can be established by using the periodic Green function as in equation (3.11) together with a proof similar to the one for the bounded obstacle case [19].

(a). High-order evaluation of quasi-periodic layer potentials

Our Nyström approach relies on use of high-order quadratures for evaluation of the integral operators

(Kmnφ)(x)=SmnG(xx)φ(x)ds(x)

in equation (3.9) for xS, where φ=φqper is a quasi-periodic integral density defined on Sper. As noted in the previous section, testing (and thus operation evaluation) for xS suffices to determine the solution φ. Once such operators have been discretized and evaluated numerically for a given quasi-periodic function φ the solution of the problem can be obtained by means of an iterative linear algebra solver such as GMRES [20].

We first consider a quadrature algorithm for the operator K=K00, which is given by

(Kφ)(x)=SG(xx)φ(x)ds(x),xS. 3.12

We note that this integral operator coincides with the one introduced in [8] for the problem of acoustic scattering by a bounded obstacle S under sound-soft boundary conditions. In fact, the algorithm we propose for evaluation of the integral operators in (3.11) results as an outgrowth of the fast high-order methods presented in that reference. (Extensions of these methods to sound-hard and electromagnetic problems can be found in [21,22]). Thus, in order to convey the main ideas underlying our periodic-structure solver, we first briefly review the algorithm [8].

The bounded-scatterer algorithm [8] evaluates the integral operator K in two stages: namely (i) evaluation of the adjacent/singular interactions (i.e. integration for x′ in areas close to x) and (ii) accelerated evaluation of non-adjacent interactions (that is, accelerated integration for x′ away from x). The decomposition into adjacent and non-adjacent contributions is effected in this method by means of floating partitions of unity—that is, pairs of functions of the form (ηx(x′),1−ηx(x′)), where ηx is a windowing function with a ‘small’ support, which equals 1 in a neighbourhood of x. Additionally, the approach [8] relies on use of smooth parametrizations of the surface S via a family of overlapping two-dimensional parameter patches P,=1,P along with smooth mappings P from parameter sets H in two-dimensional space (where actual integrations are performed), as well as partitions of unity subordinated to the overlapping patch decomposition of the surface, i.e. smooth functions w supported on P such that w=1 throughout S. This framework allows us to reduce the integration of the density φ over the surface S to integration of smooth functions φ compactly supported in the planar sets H. The latter calculations require analytic resolution of weakly singular Green functions (i.e. the order of the singularity is O(|xx|1)) which is performed via polar changes of variables (whose Jacobian cancels the Green function singularity) together with interpolation procedures that facilitate evaluations of the surface density at radial integration points [8].

(b). Reference acceleration cell

We construct now a ‘reference acceleration cell’, associated with the ‘reference domain’ Ω=Ω00, which equals a cubic domain C of side length W that contains Ω. The cell C is equipped with a certain acceleration infrastructure which is based on a corresponding acceleration technique introduced in [8]. In fact, the reference acceleration cell will be used as an element in a method for fast Fourier transform (FFT) acceleration for the problem of scattering by the complete periodic structure Ωper. Here and to the end of §3, the presentation assumes a degree of familiarity with the acceleration methodology presented in [8].

The acceleration infrastructure presented in that reference, which is designed to enable efficient FFT-based acceleration for the numerical evaluation of the integral operator

SG(xx)φ(x)ds(x),xS, 3.13

(the term m=n=0 in (3.9) restricted to xS) proceeds at first by partitioning the cube C into a number L3 of identical cubic cells ci, where L denotes an integer. The pairs (W,L) of parameters must be adjusted, if necessary, in order to ensure that the cells ci do not admit inner acoustic resonances (eigenfunctions of the Laplace operator with homogeneous Dirichlet boundary conditions).

The acceleration algorithm [8] then constructs approximations which are obtained by substitution of the surface ‘true’ sources within ci (or, more precisely, of the fields that result from discrete integration of the product of the kernel G and the density φ for all discretization points within ci) by ‘equivalent sources’ on a set Πi (ℓ=1,2,3) which equals the union of a pair of parallel circular domains which contain the faces of ci that are parallel to the plane x=0 (with the notation (x1,x2,x3)=(x,y,z)). There are three different such approximations. In all three cases, the acoustic fields generated by the ci-equivalent sources approximate with high-order accuracy the fields produced by the true ci sources at all cells cj non-adjacent to ci. The precise concept of adjacency in [8] results from a requirement that the approximation corresponding to a given cell ci be valid, with exponentially small errors, outside a concentric cube Si of side three times larger than that of ci. For efficiency, the method relies on use of equivalent sources (acoustic monopoles and dipoles) as described in what follows.

For a given integral density and for each cell ci, a set of equivalent sources (acoustic monopoles ξij(m)Gk(xxij) and dipoles ξij(d)Gk(xxij)/x) are placed at points xij,j=1,,Mequiv contained within the union of two circular domains concentric with and circumscribing the faces of ci, whose radii are selected in accordance with the prescriptions in [8]. The fields ψci,true radiated by the ci-true sources are approximated by fields ψci,eq radiated by the ci equivalent sources

ψ00ci,eq(x)=j=1(1/2)Mequiv(ξij(m)Gk(xxij)+ξij(d)Gk(xxij)x),xSi. 3.14

For a given number Mequiv of equivalent sources (selected so as to maintain a given accuracy), the unknown monopole and dipole intensities in (3.14) are chosen so as to minimize in the mean-square norm the differences (ψci,eq(x)−ψci,true(x)) as x varies over a number ncoll collocation points on Si. Hence, the intensities in (3.14) are obtained in practice as the least-squares solution of an overdetermined linear system Aξ=b, where A is an ncoll×Mequiv matrix. As discussed in §3b(ii),(iii), the method is completed via a sequence of steps which include (1) FFTs (which are used to evaluate the Cartesian convolutions that result from use of equivalent sources); (2) correction of certain errors that arise per step (1), which are inevitable in the FFT-based operation of convolution with the Green function, and which result from ‘incorrect’ use of equivalent sources for near interactions and finally, (3) high-order evaluation of surface values from the values at the FFT grid. But before such discussions, we consider certain specializations of the methods above to the periodic context which, in conjunction with the windowing methodology used in this paper, have proved to be especially efficient.

(i). Green-function contributions from periodic translates of the reference cell

It is easy to check that the set of equivalent sources for the reference scatterer Ω, as computed per the methodology described in §3b, can be used to produce—by means of simple algebraic manipulations—the corresponding equivalent sources for any periodic translation of the unit-cell. Indeed, denoting by (Kmnφqper)(x) the (m,n)th term on the left-hand sum in equation (3.9) and since for xS we have φqper(xmv1nv2)=eik⋅(mv1+nv2)φ(x), it follows that, for xS,

(Kmnφqper)(x)=eik(mv1+nv2)SG(x(xmv1nv2))φ(x)ds(x)=eik(mv1+nv2)SG((x+mv1+nv2)x)φ(x)ds(x). 3.15

Integral (3.13) evaluated at x+mv1+nv2 coincides with the last integral in equation (3.15), and, therefore, this last integral is approximated closely by the equivalent-source expression ψ00ci,eq(x+mv1+nv2), where ψ00ci,eq is defined in equation (3.14). It follows that the quantity (Kmnφqper)(x) can in turn be approximated closely by

ψmnci,eq(x):=eik(mv1+nv2)ψ00ci,eq(x+mv1+nv2)=j=1(1/2)Mequiveik(mv1+nv2)×(ξij(m)Gk(xxij+mv1+nv2)+ξij(d)Gk(xxij+mv1+nv2)x). 3.16

(Again, (x1,x2,x3)=(x,y,z).) Calling ψci,eq(x) the sum of the quantities ψmnci,eq(x) over all integers m and n, in view of equation (3.16) we have that

ψci,eq(x):=m,n=ψmnci,eq(x)=j=1(1/2)Mequiv(ξij(m)Gkqper(xxij)+ξij(d)Gkqper(xxij)x)

provides a close approximation of the quantity

m,nZSmnG(xx)φqper(x)ds(x),xSi. 3.17

The approximating expression (3.17) contains the quasi-periodic Green function Gkqper, and it is at this point that the proposed accelerated algorithm uses the windowed periodic Green function: replacing Gkqper in this expression by its windowed approximation

Ga(xx)=14πm,nZeik(|x~x~+mv1+nv2|2+(zz)2)1/2(|x~x~+mv1+nv2|2+(zz)2)1/2×eik(mv1+nv2)χ(|x~x~+mv1+nv2|a), 3.18

which, as established in theorem 2.1, gives rise to superalgebraic convergence as a+, we obtain the corresponding superalgebraically close approximation

ψci,eq(x):=j=1(1/2)Mequiv(ξij(m)Ga(xxij)+ξij(d)Ga(xxij)x)for (i,x) such that xSi. 3.19

(Note that the k dependence is explicitly displayed in the notation Gk for the free-space Green function, but, for notational simplicity, it is suppressed in the notation Ga for the windowed periodic Green function used in equation (3.19), for example.) Since for a given ℓ, the circular regions Πi are not pairwise disjoint, it is necessary, as indicated in [8], to combine equivalent source intensities for sources supported at a given point x′ that corresponds to two different cells, say, cr and cs for which x=xr,p=xs,q for some integers p and q. We thus define the quantities

ψ()(x)=xΠ(ξx(m)Ga(xx)+ξx(d)Ga(xx)x) 3.20

where ξ(m)ℓx and ξ(d)ℓx denote the sum of all intensities of equivalent sources located at a point x′∈Π:

ξx(m)=xij=xξij(m)andξx(d)=xij=xξij(d).

Note that, while the quantity ψ(*)ℓ contains contributions from cells ci for which the far-field restriction xSi is not satisfied, the algorithmic evaluation of the quantity (3.19) does proceed by evaluating ψ(*)ℓ (by means of an FFT) and then correcting for nearby contributions xSi. These two steps in the algorithm are discussed in the following sections.

(ii). Fast Fourier transform evaluation of the convolutions and correction step

As indicated above, the inaccurate quantity ψ(*)ℓ(x) (equation (3.20)) plays an important role in the proposed accelerated quasi-periodic solver. For each ℓ=1,2,3, the proposed algorithm first evaluates the Cartesian convolutions ψ(*)ℓ(x) (xΠ) by means of the three-dimensional FFT algorithm. The proposed use of the quasi-periodic Green function, which only occurs in the algorithm as part of the acceleration step, provides the additional advantage that, under the strategies mentioned in §3c, the Green function needs to be evaluated at a number on the order of O(N4/3) points only—and not for the O(N2) pairs of discretization points, where O(N) is the number of grid points that are used to discretize the scatterers in the reference cell. As demonstrated in §4, the combined windowed Green function FFT-based algorithm provides a very efficient quasi-periodic solver—at least away from Wood anomalies.

But, as indicated above, corrections are necessary to the pure FFT-based quantity ψ(*)ℓ(x): the incorrect contributions xSi must be subtracted, and corresponding accurate replacements need to be added. In some detail, the quantity ψ(na,eq)ℓ(x), which equals the sum of the values at the point xS of all fields arising from equivalent sources non-adjacent to ci can be obtained by subtracting from ψ(*)ℓ(x) the field arising at x from equivalent sources located within Si, where i is the index for which xci. The ‘corrections’ necessary to produce ψ(na,eq)ℓ(x) from ψ(*)ℓ(x) can also be evaluated efficiently, by means of a sequence of (small) three-dimensional FFTs, since they only involve (small) three-dimensional convolutions and free-space Green functions. Once completed for ℓ=1, 2, 3, this overall procedure results in accurate values, on a mesh that samples the boundaries of all cells ci, of the fields arising from all true sources contained in all cells cj not adjacent to ci.

In order to obtain approximations of the non-adjacent interactions ψ(na,true)(x) (that is, the fields generated at x by the true discrete surface sources contained outside Si) at surface points xSci, the algorithm employs solutions to the Helmholtz equation within ci, with Dirichlet boundary conditions given by ψ(na,eq)ℓ, ℓ=1, 2, 3. These Dirichlet problems can be solved uniquely (in view of our assumption that the wavenumber k is not a resonant frequency), and thus the good approximation properties of the non-adjacent interactions on the boundary of each cell ci translate into good approximations for the non-adjacent interactions on the surface S. Following [8], our algorithm produces the needed solutions of Dirichlet problems by means of approximations of the form

P(x)=j=1nwγjexp(ikujx), 3.21

valid within ci (in terms of plane wave solutions of the Helmholtz equation), for the field ψ(na,true). Here uj are unit vectors that adequately sample the surface of the unit sphere, and the coefficients γj are obtained in such a way that the relation P(x)=ψ(na,true)(x) is satisfied, in the least-squares sense, for all x in an adequately chosen collocation mesh on the cubic surface Si.

(iii). Adjacent interactions

Having evaluated, by means of FFTs and plane wave expansions, accurate approximations of the surface values of the field ψ(na,true)(x) produced by the non-adjacent surface sources (for all discretization points xS), surface values of the total field are then obtained by direct addition of necessary singular and non-singular adjacent surface sources. Briefly, the fields that need to be added to (the approximations just obtained for) the field ψ(na,true)(x) (for a point xS) include (i) adjacent regular sources, that is, trapezoidal-rule contributions to the integral operator from sources lying outside the support of the floating POU ηx but inside Si (none of which are included in ψ(na,true)(x)) and (ii) adjacent singular sources, that is, the local contributions to the integral operator considered in stage (a) of §3a.

(c). Computational cost

It is easy to estimate the computational cost of the proposed windowed Green function/accelerated algorithm for quasi-periodic scattering problems. The cost of the algorithm is the same as that of its non-periodic counterpart [8] except that now the use of the equivalent-source intensities requires values of the quasi-periodic Green function, as shown in equation (3.20), instead of the free-space Green function in the former algorithm. (Note that the equivalent sources themselves are obtained, even in the periodic context, by means of the free-space Green function Gk, as shown in equation (3.14).) The operation count now proceeds simply. Let the number of grid points used to discretize the scatterers in the reference cell be O(N). The algorithm [8] is reported to require a cost of O(N4/3logN) operations. In addition, the windowed Green function accelerated algorithm requires a precomputation of the Green function Ga(x) and its derivatives along each coordinate direction and at all points x in the accelerator meshes Π,ℓ=1,2,3. These precomputations are performed by direct summation at a cost of O(a2N4/3) operations. The overall cost of the algorithm, including all necessary Green function evaluations, thus amounts to the O(a2N4/3) precomputation cost plus the necessary number of GMRES iterations at a cost of O(N4/3logN) each.

4. Numerical results

To demonstrate the speed and accuracy of the proposed accelerated Nÿstrom algorithm, we present results of applications of this method to problems of scattering by doubly periodic arrays of perfectly conducting obstacles at non-Wood configurations. For simplicity, we consider two-dimensional rectangular lattices of scatterers, that is v1=d1(1,00) and v2=d2(0,1,0). We present two main accuracy indicators, namely certain convergence studies on one hand, and departure from energy conservation in the numerical solution, on the other. The latter test, which derives from the energy conservation satisfied by the exact PDE solution for perfectly conducting scatterers—that the energy flux of the incident field must equal the sum of the energy fluxes of the reflected field and the transmitted field—can be expressed in terms of the Rayleigh coefficients B+j of the scattering problem

(j,)Pγj|Bj+|2+(j,)Pγj|Bj+δj00|2=γ00, 4.1

in which P is the set of propagating harmonics P={(j,):vj<k2} and γj are defined in equation (1.7). The energy defect for numerically computed Rayleigh coefficients B~r,s± is then defined as

ε=1γ00|(j,)Pγj(|B~j+|2+|B~j+δj00|2)γ00|, 4.2

where δj00 equals 1 for (j,ℓ)=(0,0) and zero otherwise. Experiments based on fully converged solutions (as verified by means of convergence studies) suggest that the energy defect is an excellent indicator of solution accuracy for the integral solvers under consideration.

All of the numerical examples presented in this section concern problems of scattering by periodic arrangements of either spherical or bean-shaped scatterers [8], both of which have diameter equal to 2. In all cases, the periods are given by d1=d2=4, and plane-wave incident fields with incidence angles ψ=ϕ=0 (that is, normal incidence) and ψ=ϕ=π/3 (oblique incidence) are considered. For these experiments, we have used the accelerator parameters L=3, Mequiv=4, ncoll=8 and nw=4. In all cases, the linear systems resulting from our discretization was solved by means of the GMRES iterative solver with a relative residual tolerance ‘Tol’. The tolerance value Tol=10−8 was used to produce table 1, while the less restrictive ‘adequate-accuracy’ tolerance 10−4 was used for tables 2 and 3. Table 1 showcases the high-order accuracy achieved by our periodic solvers in the case of doubly periodic arrays of spheres under normal incidence. Tables 2 and 3 present results for periodic arrays of spheres and bean-shaped obstacles for various wavenumbers k and various values of the window radius a.

Table 1.

Convergence of the periodic solvers using Ga for increasing values of the truncation radius a for doubly periodic arrays of spheres under normal incidence. The reference solution for computing ε1 has a=400 and conservation of energy error ε=1.2×10−7.

scatterer k N a ε ε1 iter
sphere 1 24 576 25 1.1×10−3 1.9×10−3 11
sphere 1 24 576 50 1.2×10−4 6.1×10−5 11
sphere 1 24 576 75 5.0×10−6 2.1×10−6 11
sphere 1 24 576 150 3.8×10−7 3.5×10−8 11

Table 3.

Convergence of the periodic solvers using Ga for increasing values of the truncation radius a for doubly periodic arrays of spherical and bean-shaped scatterers under oblique incidence ϕ=ψ=π/3. The reference solution for computing ε1 has a=120 and conservation of energy error ε≈10−5.

computational times
scatterer k N a ε ε1 iter set-up time/it total
sphere 9 5766 20 8.0×10−3 5.2×10−3 23 14 s 3.4 s 1 min 31 s
sphere 9 5766 30 3.7×10−3 8.0×10−4 22 29 s 3.4 s 1 min 44 s
sphere 9 5766 50 4.5×10−5 1.7×10−4 22 1 min 25 s 3.4 s 2 min 40 s
bean 9 5766 20 4.4×10−3 7.8×10−3 21 14 s 5.35 s 2 min 6 s
bean 9 5766 30 1.2×10−3 3.1×10−3 21 29 s 5.35 s 2 min 23 s
bean 9 5766 50 3.0×10−5 2.1×10−4 21 1 min 25 s 5.35 s 3 min 17 s

The error ε presented in these tables was evaluated in accordance with equation (4.2). The error ε1 was calculated as the absolute error in the Rayleigh coefficient B+00 (as estimated by comparison with a reference solution obtained by means of a highly refined discretization, a large value a and a sufficiently small tolerance Tol). We also report numbers of iterations and computational times required by the GMRES solvers to reach the tolerance Tol in each case. The results were obtained by means of a C++ implementation of our solvers on a single core of a 2.67 GHz Intel Xeon CPU with 24 Gb of RAM.

5. Conclusion

This paper demonstrates that the previous two-dimensional windowed Green function methodology [7] for quasi-periodic scattering problems can successfully be extended to the three-dimensional context. In particular, this paper presents the first rigorous proof of super-algebraic convergence of the windowed Green function method in three-dimensional space. An accelerated windowed Green function algorithm is presented, which possesses excellent properties. Comparisons, in simple examples, with one of the most advanced techniques for evaluation of periodic Green functions [17] (which is based on a combination of resummation and partitioning techniques) suggests that the proposed methodology can be orders of magnitude less expensive than former approaches.

Data accessibility

All data applicable to this paper are included in the article.

Authors' contributions

All authors are equally considered co-contributors in this article.

Competing interests

There are no competing interests relevant to this article.

Funding

The authors gratefully acknowledge support from AFOSR and NSF under contracts FA9550-15-1-0043 and DMS-1411876 (O.P.B.); NSF DMS-0807325 (S.P.S.); NSF DMS-1008076 (C.T.) and NSF DMS-0707488 and NSF DMS-1211638 (S.V.).

References

  • 1.Ewald PP. 1921. Die Berechnung optischer und elektrostatischer Gitterpotentiale. Ann Phys. 369, 253–287. (doi:10.1002/andp.19213690304) [Google Scholar]
  • 2.Capolino F, Wilton DR, Johnson WA. 2007. Efficient computation of the 3D Green’s function for the Helmholtz operator for a linear array of point sources using the Ewald method. J. Comp. Phys. 223, 250–261. (doi:10.1016/j.jcp.2006.09.013) [Google Scholar]
  • 3.Papanicolaou VG. 1999. Ewald’s method revisited: rapidly convergent series representations of certain Green’s functions. J. Comp. Anal. Appl. 1, 105–114. (doi:10.1023/A:1022622721152) [Google Scholar]
  • 4.Linton CM. 2010. Lattice sums for the Helmholtz equation. SIAM Rev. 52, 630–674. (doi:10.1137/09075130X) [Google Scholar]
  • 5.Borwein JM, Glasser ML, McPhedran RC, Wan JG, Zucker IJ. 2013. Lattice sums then and now. Encyclopedia of mathematics and its applications, vol. 150. New York, NY: Cambridge University Press.
  • 6.Monro JA. 2007. A super-algebraically convergent, windowing-based approach to the evaluation of scattering from periodic rough surfaces. PhD dissertation, California Institute of Technology.
  • 7.Bruno OP, Delourme B. 2014. Rapidly convergent two-dimensional quasi-periodic Green function throughout the spectrum—including Wood anomalies. J. Comput. Phys. 262, 262–290. (doi:10.1016/j.jcp.2013.12.047) [Google Scholar]
  • 8.Bruno OP, Kunyansky L. 2001. A fast, high-order algorithm for the solution of surface scattering problems: basic implementation, tests and applications. J. Comput. Phys. 169, 80–110. (doi:10.1006/jcph.2001.6714) [Google Scholar]
  • 9.Bruno OP, Kunyansky LA. 2001. Surface scattering in three dimensions: an accelerated high-order solver. Proc. R. Soc. Lond. A 457, 2921–2934. (doi:10.1098/rspa.2001.0882) [Google Scholar]
  • 10.Barnett A, Greengard L. 2011. A new integral representation for quasi-periodic scattering problems in two dimensions. BIT Numer. Math. 51, 67–90. (doi:10.1007/s10543-010-0297-x) [Google Scholar]
  • 11.Wood RW. 1902. On a remarkable case of uneven distribution of light in a diffraction grating spectrum. Philos. Mag. 4, 396–402. (doi:10.1080/14786440209462857) [Google Scholar]
  • 12.Rayleigh L. 1907. Note on the remarkable case of diffraction spectra described by Prof. Wood. Philos. Mag. 14, 60–65. [Google Scholar]
  • 13.Bruno OP, Reitich F. 1992. Solution of a boundary-value problem for the Helmholtz equation via variation of the boundary into the complex domain. Proc. R. Soc. Edinburgh 122A, 317–340. (doi:10.1017/S0308210500021132) [Google Scholar]
  • 14.Bruno OP, Shipman S, Turc C, Venakides S. 2016. Efficient evaluation of doubly periodic Green functions in 3D scattering, part II: Wood Anomaly Frequencies. Preprint. [DOI] [PMC free article] [PubMed]
  • 15.Maystre D. 1980. Integral methods. In Electromagnetic theory of gratings (ed. R Petit), ch. 3, pp. 63–100. Berlin, Germany: Springer-Verlag.
  • 16.Veysoglu ME, Yueh HA, Shin RT, Kong JA. 1991. Polarimetric passive remote sensing of periodic surfaces. J. Electromagn. Waves Appl., 5, 267–280. (doi:10.1163/156939391X00040) [Google Scholar]
  • 17.Guerin S, Enoch S, Tayeb G. 2001. Combined method for the computation of the doubly periodic Green functions. J. Electromagn. Waves Appl. 15, 205–221. (doi:10.1163/156939301X01363) [Google Scholar]
  • 18.Bleszynski EH, Bleszynski MK, Jaroszewicz T. 2010. Rigorous modeling of electromagnetic wave interactions with large dense discrete scatterers. In Ultra-wideband, short pulse electromagnetics 9, part 1, pp. 65–77 (doi:10.1007/978-0-387-77845-7_8)
  • 19.Colton D, Kress R. 1983. Integral equation methods in scattering theory. New York, NY: John Wiley & Sons. [Google Scholar]
  • 20.Saad Y, Schultz MH. 1986. GMRES A generalized minimal residual algorithm for solving non-symmetric linear systems. SIAM J. Sci. Stat. Comput. 3 7, 856–869. (doi:10.1137/0907058) [Google Scholar]
  • 21.Bruno O, Elling T, Paffenroth R, Turc C. 2009. Electromagnetic integral equations requiring small numbers of Krylov-subspace iterations. J. Comput. Phys. 228, 6169–6183. (doi:10.1016/j.jcp.2009.05.020) [Google Scholar]
  • 22.Bruno O, Elling T, Turc C. 2012. Regularized integral equations and fast high–order solvers for sound–hard acoustic scattering problems. Int. J. Numer. Methods Eng. 91, 1045–1072. (doi:10.1002/nme.4302) [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

All data applicable to this paper are included in the article.


Articles from Proceedings. Mathematical, Physical, and Engineering Sciences / The Royal Society are provided here courtesy of The Royal Society

RESOURCES