Abstract
We propose to use finite elements and BDF2 time stepping to solve the problem of computing a solution to the time dependent wave equation with a variable sound speed in an infinite sound hard pipe (waveguide). By using the Laplace transform and an appropriate Dirichlet-to-Neumann (DtN) map for the problem, we can prove that this problem can be reduced to a variational problem on a bounded domain that has a unique solution. This solution can be discretized in space using finite elements (projecting into a Fourier space on the two artificial boundaries to allow the rapid calculation of the DtN map). We discretize in time using the Convolution Quadrature (CQ) approach and in particular BDF2 time-stepping. Thanks to CQ we obtain a stable and convergent discretization of the DtN map, and hence of the fully discrete BDF2-finite element scheme without a CFL condition. We illustrate the method with some numerical results.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Introduction
Simulating sound propagation in pipes (also called waveguides) requires to solve the wave equation in a sound hard acoustic waveguide. In this paper we consider the use of a finite element time domain approach to the problem. We suppose that the waveguide encloses a bounded perturbation assumed to be a region in which the sound speed differs from the background speed in the rest of the waveguide. We refer to the perturbation as the scatterer. A sound wave is incident on this perturbation and produces a scattered wave that needs to be computed. For simplicity we will work in two spatial dimensions, but the algorithm we develop can be used for a true three dimensional pipe with obvious modifications.
Let us consider a waveguide \(P = (0,H) \times \mathbb{R}\), containing an obstacle D which is assumed to be bounded and have a Lipschitz continuous boundary. Denote by n the unit outward normal on ∂ P, i.e. \(\mathbf{n} = (-1,0)\) on x 1 = 0 and the opposite on x 1 = H. Similarly, we use the notation n D for the unit outward normal on ∂ D. Figure 1 shows a graphic of the computational domain.
The refractive index n(x) is assumed to be real and frequency independent, and such that n(x) = 1 if \(\mathbf{x} \in P\setminus \overline{D}\) and n(x) ≠ 1 if x ∈ D. Later in the paper we will comment on impenetrable scatterers and frequency dependent coefficients. The speed of sound in the background waveguide outside D is a constant c 0.
We suppose that a given incident field u inc hits the scatterer. The incident field is a bounded smooth solution of the background wave equation so that it satisfies the wave equation in the free waveguide:
where ∂ tt 2 denotes the second time derivative, and ∂ n denotes the normal derivative. The boundary condition models a sound hard wall. In the sequel we assume that the incident field u inc does not hit the scatterer D before t = 0, that is,
In the time domain, the wave equation and boundary conditions for the total wave u and the scatterer field u sc are
Here n is understood to be a function of positions x. There is no need for a condition at infinity because u sc propagates with finite velocity and so for any t > 0 there is a distance M(t) such that u sc (t, x) = 0 for any x = (x 1, x 2) with x 1 ∈ (0, H), | x 2 | > M(t). Our problem is to approximate u (or equivalently u sc ) and we shall use finite elements in space because they can approximate general boundaries of the scatterer easily.
To use finite elements we introduce a computational domain P 0: = (0, H) × (0, L) for L > 0 big enough to enclose the scatterer, that is, such that \(\overline{D} \subset P_{0}\) (see Fig. 1). Then we can cover P 0 with finite elements (in our case using triangles). The only obstacle to a standard finite element approach in space is the need for a special artificial boundary condition at x 2 = 0 and x 2 = L that takes care of the infinite waveguide on either side of P 0. This can be constructed using the Perfectly Matched Layer (PML) (see [9]); in fact, provided the PML is chosen to handle both traveling and evanescent modes in the solution this can be very successful. However the PML is difficult to analyze and requires an informed choice of the PML parameters so instead we propose to use a time domain Dirichlet-to-Neumann (DtN) map on the artificial interfaces x 2 = 0 and x 2 = L following the approach of [6]. With this approach we need to store the solution on the artificial boundaries for all time steps, but, at least at low frequencies and in two dimensions this is not a crushing problem since only a few modes need to be stored for each time step.
We propose to use implicit time stepping to take care of possible refined meshes in some regions of the simulations, as well as to allow for changes in refractive index from place to place (this would change the CFL of an explicit scheme from place to place). In particular we shall use the Laplace transform to analyze the truncated problem (cf. [1, 7]) and convolution quadrature (cf. [10]) to prove that a family of time stepping schemes including Backward Differentiation Formula 2 (BDF2) give rise to stable and convergent time stepping method. An added bonus is that, at least before spatial discretization, the method shows how to construct perfect discrete DtN maps matched to the time stepping scheme. An alternative approach using more standard time stepping and integral equations on the interfaces might be constructed along the line of [3], but we do not pursue that here.
The paper proceeds as follows. In the next section we give details of how to reduce the problem to a family of Laplace domain equations posed on the computational domain P 0. Then in Sect. 3 we summarize the analysis of the Laplace domain problems, and then relate these back to a fully discrete time stepping scheme using convolution quadrature. The fully discrete scheme is shown to be optimally convergent. Then in Sect. 4 we provide a few numerical results from our method implemented using the multi-frequency approach of Banjai and Sauter proposed in [2].
2 Reduction to a Bounded Domain
It is convenient to perform the initial analysis using the scattered field \(u_{sc} = u - u_{inc}\) which satisfies
Above, we have set
Notice that F = 0 outside D, for any \(t \in \mathbb{R}\), since n(x) = 1 there. Furthermore, F = 0 in the whole P 0 for any t ≤ 0 according to (1). On the other hand, (1) also suggests that the scattered field is causal and, hence, we impose the initial conditions
In order to analyze (3), we transform it to the Laplace domain. More precisely, for any smooth and causal function f(t), the Laplace transform we use is defined as
where \(\mathbb{C}_{\sigma } = \left \{s;\,s =\eta -i\omega \mbox{ with }\eta >\sigma \eta,\omega \in \mathbb{R},\eta >\sigma,\;\omega \in \mathbb{R}\right \}\) for a fixed positive \(\sigma \in \mathbb{R}\). Then, working formally with Eq. (3), we have that the Laplace transform of the scattered field, \(\hat{u}_{sc} = \mathcal{L}[u_{sc}](s)\), solves
Above, \(\hat{F}\) stands for the Laplace transform of F; let us recall that \(\hat{F} = 0\) in \(P\setminus \overline{D}\).
As already mentioned, we make use of a bounded section of the pipe P 0 = (0, H) × (0, L) containing the scatterer D in its interior (see Fig. 1). Then, adopting the usual Galerkin strategy, the problem in P 0 consists in finding \(\hat{u}_{sc} \in H^{1}(P_{0})\) such that, for any v ∈ H 1(P 0),
where the unit vector n 0 = (0, 1) is normal to the artificial boundaries \(\varSigma _{-} = (0,H) \times \{ 0\}\) and \(\varSigma _{+} = (0,H) \times \{ L\}\).
In order to deal with the integrals on Σ ±, we next define the DtN maps \(\hat{T}_{\pm }^{s}(\hat{u}_{sc}) = \pm \partial _{\mathbf{n}_{0}}\hat{u}_{sc}\) on Σ ±. Working in the remaining parts of the pipe \(P\setminus \overline{P_{0}}\), where we have a homogeneous wave equation, we may obtain explicit expressions of the DtN maps.
More precisely, let us start by considering \(P_{-} = (0,H) \times (-\infty,0)\). Then \(\hat{u}_{sc} \in H^{1}(P_{-})\) satisfies
Taking advantage of Eq. (8), we write the scattered field in P − as
where each u m (x 2) is bounded for x 2 → −∞. Then, Eq. (7) means that
Also notice that u m (0) = u m, 0, where {u m, 0} m = 0 ∞ are the complex Fourier expansion coefficients of \(\hat{u}_{sc}\) on Σ −:
In consequence, denoting
and choosing \(\mathfrak{R}(\kappa _{m}) > 0\) we have
In particular, it follows that
Summing up, we have the following explicit expression of the DtN map on Σ −:
for any ξ whose Fourier expansion on Σ − is
where ξ m (m = 0, …, ∞) are the complex expansion coefficients.
Similarly, we can work in P + to obtain an explicit expression of \(\hat{T}_{+}^{s}\) on Σ +. We now make use of the DtN maps to rewrite the variational formulation (6) of the model problem in the Laplace domain as follows: Find \(\hat{u}_{sc} \in H^{1}(P_{0})\) such that, for any v ∈ H 1(P 0),
3 Convergence Analysis
The analysis of existence, uniqueness and finite element convergence for the variational problem in the Laplace domain (16) follows the general steps of the analysis of the periodic grating problem in [6]. According to this, we only make an outline of the most important results of such analysis. To this end, we start introducing the following s-dependent norm on H 1(P 0):
For each r ∈ [0, 1], we define the following s-dependent norm on H r(Σ ±):
for any ξ ∈ H r(Σ ±) written by means of its Fourier expansion (15). We also define the associated s-dependent norm on H −r(Σ ±) by duality.
Notice that the s-dependent H 1(P 0) norm corresponds to a weighted energy for the field after inverse Laplace transforming back to the time domain. Besides, the s-dependent boundary norm on H r(Σ ±) is chosen so that both the trace of functions in H 1(P 0) and the DtN maps can be estimated by appropriate norm bounds with explicit s-independence, as we detail in the following subsection.
3.1 Well-Posedness of the Variational Problem in the Laplace Domain
Following directly the argument in [6, Lemma 2.1] we can show the following bound of the trace operator \(\gamma _{\varSigma _{\pm }}: H^{1}(P_{0}) \rightarrow H^{1/2}(\varSigma _{\pm })\) in terms of weighted norms:
where \(C_{1} = 2\sqrt{ \frac{2\,c_{0 } } {L\,H\,\sigma }}\).
Moreover, using the Fourier definition of the DtN operator (14) and reasoning as in the proof of [6, Lemma 2.2], we deduce the following bound of the DtN operators \(\hat{T}_{\pm }^{s}: H^{1/2}(\varSigma _{\pm }) \rightarrow H^{-1/2}(\varSigma _{\pm })\) in terms of weighted norms:
where C is independent of s.
We can now analyze the variational formulation of the Laplace domain problem on P 0 applying the Lax-Milgram Lemma. To this end, we define the s-dependent sesquilinear form \(a^{s}: H^{1}(P_{0}) \times H^{1}(P_{0}) \rightarrow \mathbb{C}\) associated to the variational formulation (16), given by
Let us emphasize the following properties of the sesquilinear form a s(⋅ , ⋅ ) in terms of \(s \in \mathbb{C}_{\sigma }\):
-
By using the definition of the s-dependent H 1(P 0) norm, and the bounds on the trace operator and the DtN maps, we have the following continuity bound:
$$\displaystyle{ \vert a^{s}(w,v)\vert \leq C_{ 2}\,\Vert w\Vert _{s,H^{1}(P_{0})}\,\Vert v\Vert _{s,H^{1}(P_{0})}\,, }$$(17)where \(C_{2} = \text{max}\{1,\Vert \mathrm{n}^{2}\Vert _{L^{\infty }(P_{0})}\} + 8 \frac{c_{0}} {L\,H\,\sigma }\).
-
Using Bamberger and HaDuong’s technique [1] as in the proof of [6, Lemma 3.1], we have the following coercivity bound in terms of s-dependent norms
$$\displaystyle{ \mathfrak{R}(a^{s}(v,sv)) \geq \sigma \,\inf _{\mathbf{ x}\in P_{0}}\mathrm{n}^{2}(\mathbf{x})\,\Vert v\Vert _{ s,H^{1}(P_{0})}^{2}\,. }$$(18)
Notice that the estimates (17) and (18) make clear their dependence on both \(s \in \mathbb{C}_{\sigma }\) and w, v ∈ H 1(P 0). In particular, we can apply the Lax–Milgram theorem to guarantee the well-posedness of problem (16); moreover, we have the following bound on its unique solution:
where C is independent of s, \(\hat{u}_{sc}\) and \(\hat{F}\).
3.2 Spatial Discretization of the Problem in the Laplace Domain
Discretization of H 1(P 0) is by standard finite elements. More precisely, we consider a regular mesh family \(\mathcal{T}_{h},\) h > 0, of P 0 consisting of triangles K of maximum diameter h and which can be mapped from the reference triangle element \(\hat{K}\) using an affine mapping \(m_{K}:\hat{ K} \rightarrow K\). Then we define the finite element space \(\mathbb{S}_{h}\) of continuous finite elements on \(\mathcal{T}_{h}\). In particular
where \(\mathbb{P}_{q}\) denotes the set of complex valued polynomials of total degree at most q.
The only remaining difficulty in discretizing the variational problem by means of the approximation space \(\mathbb{S}_{h}\) is that we need to apply the DtN operators to traces of finite element functions. This could be done using an integral equation on Σ ± as in [3], but for the simple geometry here we can truncate the Fourier expansions involved in the explicit expression of the DtN maps. This may be done efficiently by means of a trigonometric basis of H 1∕2(Σ ±), which is a common strategy in the frequency domain. More precisely, let us introduce the finite-dimensional space
as well as the L 2(Σ ±) orthogonal projections \(p_{N,\pm }: L^{2}(\varSigma _{\pm }) \rightarrow \mathcal{P}_{N}\). We then approximate the operators \(\hat{T}_{\pm }^{s}\) by means of \(\hat{T}_{N,\pm }^{s} =\hat{ T}_{\pm }^{s} \circ p_{N,\pm }\), and the s-dependent sesquilinear forms \(a^{s}: H^{1}(P_{0}) \times H^{1}(P_{0}) \rightarrow \mathbb{C}\) by
With this approach, the discrete counterpart of problem (16) consists of finding \(\hat{u}_{sc,h,N} \in \mathbb{S}_{h}\) such that, for any \(v \in \mathbb{S}_{h}\),
Reasoning as at continuous level, we can see that the discrete sesquilinear form a h, N s(⋅ , ⋅ ) is bounded and coercive in terms of s-dependent norms, here again with the same dependence on \(s \in \mathbb{C}_{\sigma }\) and σ as in the continuous case. Indeed, properties (17) and (18) remain valid if we replace the sesquilinear form \(a^{s}: H^{1}(P_{0}) \times H^{1}(P_{0}) \rightarrow \mathbb{C}\) by its discrete counterpart \(a_{h,N}^{s}: H^{1}(P_{0}) \times H^{1}(P_{0}) \rightarrow \mathbb{C}\). In particular, this allows us to reason just as we did before to guarantee the existence of a unique solution of the discrete problem (19), \(\hat{u}_{sc,h,N} \in \mathbb{S}_{h}\), and deduce the following bound:
This result is analogous to [6, Theorem 3.4].
We can then prove an error estimate based on Strang’s second lemma in which we keep track of the dependence on the parameter \(s \in \mathbb{C}_{\sigma }\). The analysis is similar to [6, Theorem 3.5]:
where \(\hat{w}_{h} \in \mathbb{S}_{h}\) and C 1 and C 2 are the s-independent constants previously introduced (see (17) and (18)).
By taking the inverse Laplace transform of the above estimate, we can then derive an error estimate for the semi-discrete approximation u sc, h, N of u sc (i.e. only discretizing in space). More precisely, following the approach of [10], let T > 0 denote the final time for the solution and set
where X stands for any Hilbert space. We then have the following theorem.
Theorem 1
Assume that \(\hat{F} \in L^{2}(\varOmega )\) , \(s =\sigma -i\omega\) with σ > σ 0 and n 2 > δ, for some constants σ 0 ,δ > 0. Then there exists a unique solution \(\hat{u}_{sc,h,N}^{s} \in \mathbb{S}_{h}\) to (19) and furthermore there is a constant C such that, for any t ∈ (0,T) and \(v_{h} \in H_{0}^{2}((0,T); \mathbb{S}_{h})\) ,
Here C depends on T but is independent of u sc and t, and of the discretization parameters h and N.
3.3 Discretization in Time
Following the Convolution Quadrature (CQ) approach proposed in [10], to discretize in space and time we can use the discrete Laplace transform. To do this we need to choose a suitable time discretization. Let Δ t denote the time step \(\varDelta t = T/N_{t}\) where N t is the number of time steps, and let t n = nΔt. As usual for CQ, a good choice of multistep method is BDF2 which approximates the solution y(t) of y′ = f(t, y) using the difference equation
where y n = 0 for n ≤ 0. The generating polynomial for this method is
The discrete time Laplace transform of the solution we wish to find is denoted \(\hat{u}_{sc,h,N}^{\varDelta t} \in \mathbb{S}_{h}\) and satisfies the Laplace domain variational problem with s replaced by γ(ζ)∕Δ t:
where this equation holds for all \(\zeta \in \mathbb{C}\) with | ζ | < 1.
Taking the inverse discrete Laplace transform we obtain a fully discrete time stepping problem that determines \(u_{sc,h,N}^{\varDelta t,n} \in \mathbb{S}_{h}\) for n = 0, 1, …. In particular, as in [6] we introduce a new variable
so that (22) can be rewritten as finding \(\hat{u}_{sc,h,N}^{\varDelta t} \in \mathbb{S}_{h}\) such that
Introducing the z-transform of the discrete time solution as
and equating terms in ζ in (23) shows that the standard BDF2 equation is satisfied
for each m ≥ 0 where u sc, h, N Δ t, p = 0 if p ≤ 0.
To analyze (24) suppose that we have a finite Fourier series \(w =\sum _{ m=0}^{N}w_{m}\cos (m\pi x_{1}/H)\). Then from (14) we see that
where κ m (s) is given by (11). The same expansion holds for \(\hat{T}_{+}^{\gamma (\zeta )/\varDelta t}\). Expanding κ m (γ(ζ)∕Δ t) in terms of ζ gives
for some coefficients κ m, j Δ t when | ζ | < 1. These coefficients can be computed exactly for small values of j and in general computed numerically using a discrete approximation to the Cauchy integral formula as in [4, 6]. For example
and so on. Now define
Equating powers of ζ in (24) gives
for all \(v_{h} \in \mathbb{S}_{h}\).
We see that inside P 0 the method corresponds to using BDF2 and finite elements for the wave equation. On the artificial boundaries Σ ± the method provides a discrete approximation to the DtN map that uses a discrete convolution at each time step. In particular, at time step m this requires access to the N + 1 Fourier coefficients of u sc, h, N Δ t, j for j = 0, …, m on the two artificial boundaries. Thus storage requirements grow with time, but for pipes at low frequency there are few propagating modes and so N is not large (besides the propagating modes, some evanescent modes also need to be stored depending how far the artificial boundary is away from the scatterer).
At the expense of more notation, we can now eliminate z sc, h, N Δ t, m from the difference equation to obtain the discretization of a second order in time problem for u sc alone.
Following Lubich’s strategy [10] as in [6] we can prove the following fully discrete error estimate where W 0 4((0, T); L 1(P 0)) is defined analogously to H 0 r((0, T); X) in (20):
Theorem 2
Suppose we use BDF2 to discretize in time, and regular finite elements to discretize in space. In addition, suppose F ∈ W 0 4 ((0,T);L 1 (P 0 )). Then the time discrete finite element solution u sc,h,N Δt,n is well defined for each time step n = 0,1,… and satisfies the error estimate
for any \(v_{h} \in H_{0}^{2}((0,T); \mathbb{S}_{h})\) . Here the constant C depends on T and Σ + , but is independent of u sc and v h , and the discretization parameters h, N and Δt.
The theory we have outlined extends to impenetrable (sound hard or sound soft scatterers with little change). For frequency dependent refractive indices, the Laplace domain results can be proved under suitable conditions on the behavior of the refractive index in the Laplace domain (see for example [5]).
4 Numerical Results
Although the analysis of problem (16) and its discretization are written in terms of the Laplace transform of the scattered field, in practice we approximate the total field \(u = u_{sc} + u_{inc}\). This avoids performing area integrals for F. Assuming the source of the incident wave is in the section of the pipe P −, in the Laplace domain and after discretization in space, we seek \(\hat{u}_{h,N} \in \mathbb{S}_{h}\) which is the unique solution of
for any \(v_{h} \in \mathbb{S}_{h}\). Notice that there is no need for a boundary condition on Σ + since the total field is outgoing there.
To deal with problem (26), in practice we approximate \(\hat{T}_{-}^{s}\hat{u}_{inc}\) by \(\hat{T}_{N,-}^{s}\hat{u}_{inc}\). Above we have shown how the Laplace domain problem can be converted into a time stepping problem using CQ as in [10]. Here, to demonstrate the method, we instead use the discrete Laplace transform approach from [4]. Suppose the final time of integration is T and we wish to take N t timesteps. In Banjai and Sauter’s approach (26) is solved for N t choices of s chosen depending on the time-stepping method used (in fact fewer problems need to be solved in practice). An inverse discrete transform then gives the time dependent solution. We use the parameter choices from [4] even though the theory in that paper is for an integral equation based approach.
4.1 Convergence Rate
To obtain a simple exact solution we can consider an empty pipe. In this case the total field is simply given by the incident field, and the code must propagate the incident field through the finite element domain. We choose the computational domain to be P 0 = (0, 0. 6) × (0, 1) with Σ − at x 2 = 0 and Σ + at x 2 = 1, and the width of the pipe H = 0. 6. The final time is T = 6 by which time the wave has almost left the computational domain. The incident field is a plane wave \(u_{inc} = f(t - x_{1}/c)\) where c = 1 and
where t p = 3, \(\sigma = 6/(2\pi \ b_{w})\), and b w = 1. 71 denotes the bandwidth of the incident field; notice that the center frequency is 1. The parameters are chosen so that f is approximately zero in P 0 at t = 0. We choose a fixed spatial mesh shown in Fig. 2 (left panel) where the mesh size is h ≈ 0. 016, and use piecewise linear finite elements in space (using the FreeFem++ to implement the algorithm [8]) and BDF2 in time. Although only one mode is needed for the DtN maps in this case, we choose N = 7 for the Fourier spaces on Σ − and Σ +.
For simplicity we report the discrete maximum norm error at the nodes in the mesh as a function of N t in the right hand panel of Fig. 2. The convergence rate is consistent with O(N t −2) convergence for at least part of the convergence history. We have no explanation for the increased rate at N t = 1024. In any case the numerical results show that we can obtain accurate and convergent solutions over a wide range of time step sizes. Indeed, the coarsest time step is Δ t ≈ 0. 09 and the finest time step is Δ t ≈ 0. 006, and stability is seen across this range of time steps.
4.2 Scattering from a Penetrable and Impenetrable Obstacles
Our next examples illustrate the flexibility of this approach since the finite element method can handle different boundary conditions and possible inhomogeneity of the scatterer. We start with a penetrable scatterer as analyzed in this paper. We choose n(x) = 1 in the pipe, and n(x) = 2 inside a disk of radius 0.3 centered at (0, 0. 6). In order to keep the ratio of mesh size to wavelength roughly constant, the mesh inside the scatterer is refined according to the local refractive index. In Fig. 3 we show the spatial mesh and three snapshots of the same incident field as used in the previous section choosing the number of time steps N t = 512 (from the previous section we know the method propagates the incident wave with roughly 1% error when the obstacle is not present). Clearly, as expected, the waves slow down in the scatterer and are transmitted through the scatterer with a focal point on one side of the circle. No instability is evident.
In our second example we consider scattering from a sound soft obstacle. This corresponds to enforcing the Dirichlet boundary condition u = 0 on the boundary of the same disk as used in the previous example. Results are shown in Fig. 4.
5 Conclusions
In this paper we have shown how to derive and analyze a fully discrete time stepping method for the wave equation in an infinite pipe or waveguide. Using the DtN map to truncate the domain we obtain a coupled finite element and discrete DtN map for the discrete solution at each time step. Limited numerical results suggest the method is stable and accurate.
The main drawback of the method is that the solution needs to be recorded on the artificial boundaries to allow the convolution needed at each time step to be computed. However if there are only a few propagating modes in the solution this is not a crushing overhead unless very long solution times are required.
References
Bamberger, A., Duong, T.H.: Formulation variationnelle espace-temps pour le calcul par potentiel retarde de la diffraction d’une onde acoustique (I). Math. Meth. Appl. Sci. 8, 405–435 (1986)
Banjai, L.: Time-domain Dirichlet-to-Neumann map and its discretization. IMA J. Numer. Anal. 34, 1136–1155 (2014)
Banjai, L., Lubich, C., Sayas, F.: Stable numerical coupling of exterior and interior problems for the wave equation. Numer. Math. 129 (4), 611–646 (2015)
Banjai, L., Sauter, S.: Rapid solution of the wave equation in unbounded domains. SIAM J. Numer. Anal. 47, 227–49 (2008)
Fan, L., Monk, P.: Time dependent scattering from a grating. J. Comput. Phys. 302, 97–113 (2015)
Fan, L., Monk, P.: Time dependent scattering from a grating using convolution quadrature and the Dirichlet-to-Neumann map. (2015, submitted)
Ha-Duong, T.: On retarded potential boundary integral equations and their discretizations. In: Ainsworth, M., Davies, P., Duncan, D., Rynne, B., Martin, P. (eds.) Topics in Computational Wave Propagation: Direct and Inverse Problems, pp. 301–36. Springer, Berlin (2003)
Hecht, F.: New development in FreeFem++. J. Numer. Math. 20, 251–265 (2012)
Lu, Y., Zhu, J.: Perfectly matched layer for acoustic waveguide modeling—benchmark calculations and perturbation analysis. Comput. Model. Eng. Sci. 22, 235–248 (2007)
Lubich, C.: On the multistep time discretization of linear initial-boundary value problems and their boundary integral equations. Numer. Math. 67, 365–89 (1994)
Acknowledgements
The research of L. Fan and P. Monk was partially supported by NSF grant number DMS-1114889 and DMS-1125590. The research of V. Selgas by MTM2013-43671-P.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Fan, L., Monk, P., Selgas, V. (2016). Time Dependent Scattering in an Acoustic Waveguide Via Convolution Quadrature and the Dirichlet-to-Neumann Map. In: Ortegón Gallego, F., Redondo Neble, M., Rodríguez Galván, J. (eds) Trends in Differential Equations and Applications. SEMA SIMAI Springer Series, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-32013-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-32013-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32012-0
Online ISBN: 978-3-319-32013-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)