Next Article in Journal
Corner Centrality of Nodes in Multilayer Networks: A Case Study in the Network Analysis of Keywords
Next Article in Special Issue
Computational Modeling of Lymph Filtration and Absorption in the Lymph Node by Boundary Integral Equations
Previous Article in Journal
Novel Algorithm for Multi-Time Data Implantation in a Special Cyber-Manufacturing Architecture
Previous Article in Special Issue
Projection onto the Set of Rank-Constrained Structured Matrices for Reduced-Order Controller Design
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability and Convergence Analysis of a Domain Decomposition FE/FD Method for Maxwell’s Equations in the Time Domain

by
Mohammad Asadzadeh
1,† and
Larisa Beilina
2,*,†
1
Department of Mathematical Sciences, Chalmers University of Technology, 41296 Gothenburg, Sweden
2
Department of Mathematical Sciences, University of Gothenburg, 41296 Gothenburg, Sweden
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Algorithms 2022, 15(10), 337; https://doi.org/10.3390/a15100337
Submission received: 23 August 2022 / Revised: 12 September 2022 / Accepted: 15 September 2022 / Published: 20 September 2022
(This article belongs to the Special Issue Computational Methods and Optimization for Numerical Analysis)

Abstract

:
Stability and convergence analyses for the domain decomposition finite element/finite difference (FE/FD) method are presented. The analyses are developed for a semi-discrete finite element scheme for time-dependent Maxwell’s equations. The explicit finite element schemes in different settings of the spatial domain are constructed and a domain decomposition algorithm is formulated. Several numerical examples validate convergence rates obtained in the theoretical studies.

1. Introduction

In industrial applications, developing efficient numerical methods to solve the underlying partial differential equations (PDEs) requires simulations in higher dimensions and large computational domains. Such domains often consist of subdomains with different geometrical shapes and material properties. In this regard, domain decomposition (DD) methods, leading to efficient schemes, have gained considerable interest in the numerical analysis community, see [1,2]. A certain variant of the DD method, described below, is the subject of our current research on Maxwell’s equations, which is closely related to the schemes that were previously studied in [3,4]. More specifically, the present work is a further development of the DD hybrid finite element/finite difference (FE/FD) method for time-dependent Maxwell’s equations for an electric field in non-conductive media.
A stable, time-domain (TD), DD scheme for Maxwell’s equations was proposed in [5,6] and further verified in [7]. This method uses the Yee scheme [8] on the structured FD part of the mesh, and finite elements, possessing edge elements, on the unstructured part. Because of the presence of edge elements, implementing this method remains computationally expensive. A domain decomposition FE/FD method for time-dependent Maxwell’s equations for an electric field, assuming constant dielectric permittivity function in finite difference domain, was considered in [3]. The constant permittivity assumption simplifies the numerical schemes in both FE and FD domains and significantly reduces computational efforts to implement the considered DD scheme. A modified numerical scheme, energy estimate, and numerical verification of this method were presented in [4]. However, stability and convergence analysis with numerical implementations, in L 2 - and H 1 -norms of the developed FE/FD schemes, are not presented in the above studies. This work is meant to fill the gap.
More specifically, we present stability analyses for explicit schemes for FE (stability of FD is as in [5,6]), in the DD hybrid FE/FD method. The domain decomposition method (DDM) is constructed such that FEM and FDM coincide on the common, structured, overlapping layer between the two subdomains. The resulting domain decomposition approach at the overlapping layers can be viewed as a FE scheme which avoids instabilities at the interfaces. We decompose the computational domain such that FEM and FDM are used in different subdomains: FDM in simple geometry and FEM in the subdomain where more detailed information is needed about the structure of this subdomain. This allows the application of adaptive FEM in such subdomain, see, e.g., [3,9], and the references therein.
Reliability and convergence of the domain decomposition method studied in this work are evident for the solution of coefficient inverse problems (CIPs) in R 3 , see, e.g., [9], and the references therein. For the case of CIPs, the computational domain is split into subdomains such that a simple discretization scheme can be used in a large region and more refined discretization scheme is applied in smaller, but more critical, parts of the domain. In most algorithms for solution of electromagnetic CIPs, to determine the dielectric permittivity function inside a computational domain, a qualitative collection of experimental measurements at the boundary or in a neighborhood of it is necessary. In such cases, it is convenient to consider the numerical solution for Maxwell’s equations in different subdomains with a constant dielectric permittivity function in some, adequately chosen ones, and non-constant in other ones. For time-dependent Maxwell’s equations, the DD scheme of [4], analyzed in the present work, is used for the solution of different CIPs in order to determine the dielectric permittivity function in non-conductive media using simulated experimental data.
There are many other studies relevant to this work, e.g., in [10,11,12,13,14,15] and references therein. However, our analysis of DDM significantly differs from these works. In addition to optimal convergence of the constructed scheme, the novelty and scientific impact of the paper is in tackling coercivity (or lack of coercivity). More specifically, a challenging issue here is the lack of coercivity for the bilinear form in the presence of the time-derivative term. To circumvent this, a common approach is to split the bilinear form, separating the time-derivative term, and deriving the coercivity for the remaining sub-bilinear form. Then one may derive the convergence of the entire scheme with a time-derivative term.
An outline of this paper is as follows. In Section 2 and Section 3 we introduce the mathematical model, and briefly present the structure of domain decomposition FE/FD schemes and communication between the two schemes. In Section 4, we describe the domain decomposition FE/FD method for the numerical solution of Maxwell’s equations and set up adequate finite element and finite difference schemes. Section 5 is devoted to the stability analysis for the original bilinear form, (with a norm involving the time derivative term). In Section 6, we derive optimal a priori error estimates in finite element approximation for the semi-discrete (spatial discretization) problem on the entire domain, which is easily reduced to the FE subdomain, having known boundary data (the restriction of FD solution to the boundary of the FE subdomain). Finally, in our conclusion, Section 7, we present numerical implementations that justify the theoretical investigations in the paper.

2. The Mathematical Model

The Cauchy problem for the electric field E x , t = E 1 , E 2 , E 3 x , t , x R 3 , t [ 0 , T ] , of Maxwell’s equations, under the assumptions that the dimensionless relative magnetic permeability of the medium is μ r 1 , and the electric volume charges are zero, is given by
1 c 2 ε r ( x ) 2 E t 2 + × × E = μ 0 σ ( x ) E t , · ( ε E ) = 0 ,
where ε r ( x ) = ε ( x ) / ε 0 and σ ( x ) are the dimensionless relative dielectric permittivity and electric conductivity functions, respectively. ε 0 and μ 0 are the permittivity and permeability of the free space, respectively, and c = 1 / ε 0 μ 0 is the speed of light in free space. In this paper we consider problem (1) in non-conductive media, i.e., σ 0 , and hence, to begin with, we shall consider the following initial value problem
ε ( x ) 2 E t 2 + × × E = 0 , x R 3 , t ( 0 , T ] , · ( ε E ) = 0 , in Ω × ( 0 , T ] , E ( x , 0 ) = f 0 ( x ) , E t ( x , 0 ) = f 1 ( x ) , x R 3 , t ( 0 , T ] .
To solve problem (2) numerically, we need to consider it in a bounded domain Ω R n , n = 2 , 3 , with boundary Ω , and employ a split scheme on Ω : a hybrid, finite element/finite difference scheme, a kind of domain decomposition described in Algorithm 1. In this approach, we divide the computational domain Ω into two subdomains, Ω F E M and Ω F D M such that Ω = Ω F E M Ω F D M   (note that Ω F E M Ω F D M Ø ), and Ω F E M is a subset of the convex hull of Ω F D M . The function ε ( x ) is assumed to be constant in Ω F D M , and bounded and smooth in Ω F E M . The communication between Ω F E M and Ω F D M is arranged using an overlapping mesh structure through a two-element thick layer around Ω F E M , as shown by the blue and green common boundaries in Figure 1. The blue boundary is the boundary of Ω F E M , the green boundary is the inner boundary of Ω F D M , and the red boundary is the outer boundary of Ω (which is also the boundary of the original domain  Ω ).
Algorithm 1 Domain decomposition process for the hybrid FE/FD scheme
1:
On the mesh Ω F D M , where FDM is used, update the Finite Difference (FD) solution.
2:
On the mesh Ω F E M , where FEM is used, update the finite element (FE) solution.
3:
Copy the FE solution obtained at nodes ω (nodes on the green boundary of Figure 1) as a boundary condition on the inner boundary for the FD solution in Ω F D M .
4:
Copy the FD solution obtained at nodes ω o (nodes on the blue boundary of Figure 1) as a boundary condition for the FE solution on Ω F E M of Ω F E M .
5:
Apply boundary condition at Ω at the red boundary of Ω F D M .
The key idea with such a decomposition is that it allows applying different numerical methods in different computational domains. For the numerical solution of (2) in Ω F D M , we use the finite difference method on a structured mesh. In Ω F E M , we use finite elements on a sequence of unstructured meshes K h = { K } , with elements K consisting of triangles in R 2 and tetrahedron’s in R 3 , both satisfying the minimal angle condition. This approach combines the flexibility of the finite element and the efficiency of the finite difference in terms of speed and memory usage and fits well for the reconstruction algorithm presented below.
Assumption 1.We assume that for some known constant d > 1 , the function ε C 2 R 3 satisfies   
ε ( x ) 1 , d , in Ω \ Ω F D M ε ( x ) = 1 , in Ω F D M .
As an immediate consequence of this assumption we have that
ε 1 in Ω F D M Ω F E M also ε 1 in Ω F D M .
Assumption 1 has a physical meaning. The model problem (2) has a lot of applications in the field of coefficient inverse problems what we have pointed out in the introduction. One of the application of the model problem (2) is determination of dielectric permittivity function from measurements of the electric field at the boundary of the investigated domain, and this is a typical CIP. We refer for applications of such CIPs in [9,16,17,18,19] and references therein. This CIP is an ill-posed problem and needs several assumptions in order to be able to solve it, see details in [20,21,22]. One of the assumptions is the introduction of the set of admissible parameters for the dielectric permittivity function, which we define in the Condition (3). The lower bound in this set corresponds to the homogeneous media and the upper bound d is chosen as maximal values of the dielectric permittivity function and depends on the concrete physical problem. We refer to [16,18,23,24] where one can find values of dielectric permittivity function for different real-life applications with applications in medical imaging. Using these values can determine the upper and lower bounds in the set of admissible parameters for this function. See works [9,17,19] for examples of such sets for some real physical problems.
Note further that Ω F E M Ω F D M . Condition (3) on ε and the relation
× × E = ( · E ) · ( E ) ,
together with divergence-free field E, make the equations in (2) independent of each other in Ω F E M and Ω F D M so that, in Ω F D M (with ε = 1 ), we just need to solve the system of wave equations:
2 E t 2 Δ E = 0 , ( x , t ) Ω F D M × ( 0 , T ] .
Remark 1.
There are different discretizations of Maxwell’s equations in the time domain such as the FDTD Yee scheme [8,25], FE Lee–Madsen scheme [26], node-based least squares FE schemes [27,28], edge elements [29,30], and a number of discontinuous Galerkin FE schemes [31,32,33,34,35]. It is well known that, for stable implementation of the finite element solution of Maxwell’s equations, divergence-free edge elements are the most satisfactory ones from a theoretical point of view [29,30,36]. However, the edge elements are less attractive for the solution of time-dependent problems, since a linear system of equations should be solved at each time iteration step. On the contrary, P1 elements can be efficiently used in a fully explicit finite element scheme with lumped mass matrix, see, e.g., [37,38,39]. It is also well known that the numerical solution of Maxwell’s equations using nodal finite elements is often unstable and results in spurious oscillatory solutions [40,41]. There are a number of techniques to overcome such instabilities, see, e.g., [27,28,41,42,43].
In [44], a finite element analysis shows stability and consistency of the stabilized finite element method for the solution of (1) with σ ( x ) = 0 . In the current study we show stability and convergence for the combined FEM/FDM scheme, under the condition (3) on ε (the convergence would require an additional condition on ε : namely (4)) where the stabilized FEM is used for the numerical solution of (2) in Ω F E M and the usual FDM discretization of (6) is applied in Ω F D M .
We shall consider the following boundary and initial conditions:
E ( x , t ) = 0 , x Ω , t ( 0 , T ] E ( x , 0 ) [ H 1 ( Ω ) ] 3 , t E ( x , 0 ) H ( d i v , Ω ) · ( ε E ( x , 0 ) ) = 0 , · ( ε t E ( x , 0 ) ) = 0 .
Recall that we assumed non-conductive media: σ 0 . In the presence of electric conductivity, additional σ -terms appear in the equations. Then the σ t E -term adds an analytically advantageous, parabolic character to the equation.
Hence, in this note, we assume (3) and study the following stabilized version of the initial boundary value problem (2), with sufficiently smooth initial data f 0 and f 1 :
ε t t E Δ E + ( · ( 1 ε ) E ) = 0 in   Ω × ( 0 , T ) , E ( · , 0 ) = f 0 ( · ) , t E ( · , 0 ) = f 1 ( · ) in   Ω , E = 0 on   Ω × ( 0 , T ) .

3. The Structure of Domain Decomposition

We now describe the DD method between two subdomains, Ω F E M and Ω F D M , where the FEM is used for computation of the solution in Ω F E M , and FDM is used in Ω F D M . Communication between Ω F E M and Ω F D M is achieved by allowing overlapping of both meshes across a two-element thick layer between Ω F E M and the inner boundary of Ω F D M , see Figure 1. The common nodes of both Ω F E M and Ω F D M domains belong to either of the following boundaries (see Figure 1):
  • Nodes on the blue boundary ω o —lie on the boundary Ω F E M of Ω F E M and are interior to Ω F D M ,
  • Nodes on the green boundary ω —lie on the inner boundary Ω F D M of Ω F D M and are interior to Ω F E M .
Then the main loop in time for the explicit hybrid FEM/FDM scheme, that solves (2), associated with appropriate boundary conditions, at each time step k, is described in Algorithm 1.
By (3), ε = 1 at the overlapping nodes between Ω F E M and Ω F D M . Thus, FEM and FDM schemes coincide on the common, structured, overlapping layer. Hence, we avoid instabilities at interfaces.

4. Derivation of Computational Schemes

In this section, we construct a combined, finite element/finite difference scheme to solve the model problem (8). In this approach, first, we present the finite element scheme to solve (8) in entire Ω . This induces the finite element scheme in Ω F E M . Then, we derive the finite difference scheme in Ω F D M , when the domain decomposition FE/FD structure is applied to solve (8) in Ω .
In what follows, C will be a generic constant independent of all parameters, unless otherwise specifically specified, and not necessarily the same at each occurrence.
Remark 2.
The computational schemes derived in this section are explicit and therefore, for their convergence, the CFL condition below (see, e.g., [44]) should hold
τ h η , η = C 1 + 3 ε 1 .
Here C is a mesh independent constant, τ is the time step, and h is the mesh size.
In the sequel, we denote the inner product of [ L 2 ( Ω ) ] M , M { 1 , 2 , 3 } , by ( · , · ) , and the corresponding L 2 -norm by · . The scalar inner product in [ L 2 ( Ω F E M ) ] M we denote by ( · , · ) Ω F E M , and its associated L 2 -norm by · Ω F E M . Further, we let Ω F E M be the boundary of Ω F E M , Ω F D M the inner boundary of Ω F D M , Ω the outer boundary of Ω F D M , and · , · Ω denotes scalar product at the boundary Ω .

4.1. Finite Element Discretization in Ω

First, we derive the finite element scheme to solve the model problem (8) in whole Ω . The restriction of this FE solution to the inner Ω F D M is the approximation for E | Ω F D M . Next, we discretize Ω F E M T = Ω F E M × ( 0 , T ) in two steps: (i) the spatial discretization using a partition T h of Ω F E M into elements K, where h = h ( x ) is a mesh function defined as h | K = h K , representing the local diameter of elements. We also denote by T h a partition of the boundary Ω F E M into boundaries K of the elements K such that in 2 D , two of the vertices, and in 3 D , three of the vertices of these elements belong to Ω F E M . As usual, we also assume a minimal angle condition on elements K in K h , see details in [45]. (ii) As for temporal discretization, we let J τ be a uniform partition of the time interval ( 0 , T ) into N subintervals J = ( t k 1 , t k ] of length τ = T / N . Our implementations are for fully discrete, space-time scheme. However, temporal discretization (ii), being well-studied in the literature, is not considered in the analysis here. To formulate the finite element method for (8) in Ω , we introduce the finite element space W h E ( Ω ) for each component of the electric field E defined by
W h E ( Ω ) : = { w H 1 ( Ω ) : w | K P 1 ( K ) , K T h } ,
where P 1 ( K ) denote the set of piecewise-linear functions on K. Setting W h E ( Ω ) : = [ W h E ( Ω ) ] 3 , and because of the homogeneous Dirichlet boundary data in (8) we need to choose the test function space as
W h , 0 E : = { v W h E : v = 0 , on   Ω } .
Then, recalling (5) and the Dirichlet boundary condition in (8) the spatial semi-discrete problem in Ω reads:
Find E h W h , 0 E ( Ω ) such that v W h , 0 E ( Ω ) ,
ε t t E h , v + ( E h , v ) + ( · ( ε E h ) , · v ) ( · E h , · v ) n E h , v Ω n · ( · ( ε 1 ) E h ) , v Ω : = j = 1 6 T j = 0 , E h ( · , 0 ) = f 0 , h ( · ) a n d t E h ( · , 0 ) = f 1 , h ( · ) in   Ω .
where f 0 , h and f 1 , h are suitable approximations for the initial data, specified below. Further, we note that
T 3 = ( · ( ε E h ) , · v ) = ( ε · E h , · v ) + ( ε · E h , · v ) ,
implies
T 3 + T 4 = ( · ( ε E h ) , · v ) ( · E h , · v ) = ( ε · E h , · v ) + ( ε 1 ) · E h , · v .
Recalling (10), vanishing test functions at the boundary yields T 5 = T 6 0 ( ε = 1 on Ω yields T 6 = 0 ), and the final weak formulation for the semi-discrete problem in Ω is:
Find E h W h , 0 E ( Ω ) such that v W h , 0 E ( Ω ) ,
B Ω ( E h , v ) : = ε t t E h , v + ( E h , v ) + ( ε · E h , · v ) + ( ( ε 1 ) · E h , · v ) = 0 .
For the reflexive, inhomogeneous boundary condition, see the FE scheme for Ω F E M .
To get a fully discrete scheme for (8) we apply time discretization to (11). Then E h ( k τ ) , denoted by E h k , and the central difference scheme, for k = 1 , , N 1 , yields
ε E h k + 1 2 E h k + E h k 1 τ 2 , v + ( E h k , v ) + ( · ( ε E h k ) , · v ) ( · E h k , · v ) = 0 v W h , 0 E ( Ω ) ,   E h 0 = f 0 , h and E h 1 = E h 0 + τ f 1 , h in   Ω .
Multiplying both sides of (14) by τ 2 / ε we get, v W h , 0 E ( Ω ) , that
E h k + 1 2 E h k + E h k 1 , v + τ 2 ( 1 / ε E h k , v ) + τ 2 ( 1 / ε · ( ε E h k ) , · v ) τ 2 ( 1 / ε · E h k , · v ) = 0 ,   E h 0 = f 0 , h and E h 1 = E h 0 + τ f 1 , h , in   Ω .
Rearranging terms in (15) we get the following scheme: Given the initial data, f 0 and f 1 , find E h W h E ( Ω ) such that v W h , 0 E ( Ω ) ,
E h k + 1 , v = 2 E h k , v E h k 1 , v τ 2 ( 1 / ε E h k , v ) τ 2 ( 1 / ε · ( ε E h k ) , · v ) + τ 2 ( 1 / ε · E h k , · v )   E h 0 = f 0 , h and E h 1 = E h 0 + τ f 1 , h in   Ω .

4.2. Finite Element Discretization in Ω F E M

To solve the model problem (8) via the domain decomposition FE/FD method, we use the split Ω = Ω F E M Ω F D M , see Figure 1. Thus, in Ω F E M we use FEM to solve the equation
ε t t E Δ E + ( · ( 1 ε ) E ) = 0 in   Ω F E M × ( 0 , T ) , E ( · , 0 ) = f 0 ( · ) , and   t E ( · , 0 ) = f 1 ( · ) in   Ω F E M , E = ( E | Ω F E M ) = g , on   Ω F E M × ( 0 , T ) , · ( ε E ) = 0 in   Ω F E M .
Here, g corresponds to the restriction of the exact solution to Ω F E M . Therefore test and trial functions are not vanishing at this boundary, hence the term corresponding to T 5 in (11) will appear in the weak formulation for Ω F E M .
To formulate the finite element method for (17) in Ω F E M , mimicking (11), we introduce the finite element space W h E ( Ω F E M ) for each component of the electric field E defined by
W h E ( Ω F E M ) : = { w H 1 ( Ω F E M ) : w | K P 1 ( K ) , K T h } .
Setting W h E ( Ω F E M ) : = [ W h E ( Ω F E M ) ] 3 we define P h g to be the usual L 2 -projection of g in Ω F E M . Then, similar to the FE scheme for Ω , we get the following finite element scheme for Ω F E M : Given approximate values f 0 , h and f 1 , h of f 0 and f 1 , respectively, and P h g , find E ˜ h W h E ( Ω F E M ) such that
ε t t E ˜ h , v + ( E ˜ h , v ) + ( · ( ε E ˜ h ) , · v ) ( · E ˜ h , · v ) = n · ( · ( ε 1 ) P h g ) , v Ω F E M + n ( P h g ) , v Ω F E M = { ε 1 on Ω F E M } = n ( P h g ) , v Ω F E M , v W h E ( Ω F E M )   E ˜ h ( · , 0 ) = f 0 , h ( · ) and t E ˜ h ( · , 0 ) = f 1 , h ( · ) in   Ω F E M
where we set E ˜ h | Ω F E M = E h Ω | Ω F E M , i.e., the restriction of the finite element solution on whole Ω to Ω F E M , (which, here, contrary to the whole domain where E h | Ω = 0 , will be non-zero).
A corresponding fully discrete problem in Ω F E M T reads as follows:
Given f 0 , h , f 1 , h , P h g , E h k , and E h k 1 ; find E h k + 1 such that v W h E ( Ω F E M T ) ,
E ˜ h k + 1 , v = 2 E ˜ h k , v E ˜ h k 1 , v τ 2 ( 1 / ε E ˜ h k , v ) + τ 2 ( 1 / ε · E ˜ h k , · v ) τ 2 ( 1 / ε · ( ε E ˜ h k ) , · v ) + τ 2 n ( P h g ) / ε , v Ω F E M , E h 0 = f 0 , h E h 1 = E h 0 + τ f 1 , h in   Ω F E M T .

4.3. Finite Difference Formulation

We recall now that from conditions (3) it follows that in Ω F D M the function ε ( x ) = 1 . This means that in Ω F D M for the model problem (2) the forward problem will be
2 E t 2 Δ E = 0 in   Ω F D M × ( 0 , T ) ,
E ( x , 0 ) = f 0 ( x ) , E t ( x , 0 ) = f 1 ( x ) in   Ω F D M ,
E = 0 on   Ω × ( 0 , T ) ,
n E = n E F E M on   Ω F D M × ( 0 , T ) .
Using standard finite difference discretization of the Equation (20) in Ω F D M we obtain the following explicit scheme for the solution of the forward problem:
E l , j , m k + 1 = τ 2 Δ E l , j , m k + 2 E l , j , m k E l , j , m k 1 .
In the system of equations above, E l , j , m k is the solution at the time iteration step k at the discrete point ( l , j , m ) , τ is the time step, and Δ E l , j , m k is the discrete Laplacian.
Note that (24) is associated with the Neumann boundary condition above, where the Dirichlet boundary conditions E = E F E M can be considered as well.

5. Stability

5.1. Stability Estimate for Continuous Problem in Ω

In this section, we derive stability estimates for the semi-discrete approximations. For stability in Ω , these estimates are extensions of the stability approach derived for the continuous problem in [4]. As for the stability in Ω F E M , we get slightly different norms involving contributions corresponding to the reflexive boundary, Ω F E M . We define the discrete version of a triple norm induced by the weak variational formulation of (8), where we also use the relation (12) (in Ω F D M , ε = 1 , therefore, the second term on the right-hand side in (12) is not present in here). Note that in the continuous case · ( ε E ) = 0 , (whereas, in general · ( ε E h ) 0 ), and the continuous variational formulation in whole Ω , reads as:
Find E W 0 E ( Ω ) such that for all v W 0 E ( Ω )
ε t t E , v + ( E , v ) + ( ( ε ) · E , · v ) + ( ( ε 1 ) · E , · v ) = 0 , E ( · , 0 ) = f 0 ( · ) and t E ( · , 0 ) = f 1 ( · ) in   Ω .
Remark 3.
We emphasize that the bilinear form induced by (25), containing the time derivative term, is not coercive (whereas, without the ε t t E term, both (25) and its spatially discrete version are coercive). Further H 1 ( Ω ) -conforming finite element may result in spurious oscillatory solutions. A remedy is through modifying the equation by adding a gauge constraint of Coulomb-type, see, e.g., [36,43]. This is supplied by the “zero”-term: · ( ε E ) = 0 , in (8), which we add in the continuous variational formulation in (11). This, however, is not necessarily true in the discrete forms, e.g., in (18), where most likely · ( ε E h ) 0 .
Taking v = t E in (25), (with the boundary condition E = 0 on Ω ), yields   
ε t t E , t E + ( E , t E ) + ( ( ε ) · E , · t E ) + ( ( ε 1 ) · E , · t E ) 0 ,
which, due to the fact that ε is independent of t, can be rewritten as
1 2 d d t ε t E , t E + 1 2 d d t E , E + ( ε ) · E , · t E + 1 2 d d t ( ε 1 ) · E , · E I 1 + I 2 + I 3 + I 4 = 0 .
Proposition 1.
Let Ω R n , n = 2 , 3 be a bounded domain with piecewise linear boundary Ω . Let Assumption 1 for function ε hold. Assume that there exists a solution E H 2 ( Ω T ) of problem (8). Then, Equation (8) has a unique solution E H 2 ( Ω T ) . Further let f 1 L ε 2 ( Ω ) and f 0 L 2 ( Ω ) H | ε | + ε 1 1 ( Ω ) , then there is a constant C, independent of ε and t, such that, t ( 0 , T ] , the following stability estimate holds true
| | | E | | | ε 2 ( t ) : = t E ε 2 ( t ) + E 2 ( t ) + · E | ε | + ε 1 2 ( t ) + E | ε | 2 ( t ) + 0 t E t | ε | 2 d s + 0 t · E | ε | 2 d s C f 1 ε 2 + f 0 2 + · f 0 | ε | + ε 1 2 + f 0 | ε | 2 .
Proof. 
A version of the estimate (28) could be proved, as in [4], Theorem 4.1, by setting s = 1 and j 0 , where the nonsymmetric term I 3 is the source of challenge.
A rather involved proof of a similar result is derived in [46], using Nitsche’s penalty method. A direct approach using Fubini’s theorem (through a change of integration order in x and t, followed by partial integration in t), yields the estimate of the non-symmetric term I 3 . This, however, is with the price of the appearance of the integral terms on the left-hand side, viz.
0 t I 3 d s = Ω 0 t ( ( ε ) · E t ) ( · E ) d s [ ( ε · E ) ( · E ) ] 0 t : = I 3 , 1 + I 3 , 2 .
Then, we can derive the following inequalities:
I 3 , 1 1 2 0 t E t | ε | 2 d s + 1 2 0 t · E | ε | 2 d s ,
and
I 3 , 2 1 2 E | ε | 2 ( t ) + 1 2 · E | ε | 2 ( t ) + 1 2 E | ε | 2 ( 0 ) + 1 2 · E | ε | 2 ( 0 ) .
Combining the contributions from the symmetric terms: I 1 , I 2 , and I 4 with (29)–(31), an adequate choice (large enough) of the constant C yields the desired result.  ☐
Below we translate this stability to the semi-discrete problem.

5.2. Stability Estimate for the Semi-Discrete Problem in Ω

The stability for the semi-discrete problem in Ω is basically as in the continuous case above where all E:s are replaced by E h W h , 0 E , i.e., E h | Ω 0 and some relevant assumptions in the discrete data, viz.
Lemma 1.
Assume that the approximations for the initial-data f 0 and f 1 : f 0 , h and f 1 , h satisfy the regularity conditions f 1 , h L ε 2 ( Ω ) and f 0 , h H 1 ( Ω ) H ε 1 1 ( Ω ) , then for each t ( 0 , T ] ,
| | | E h | | | ε 2 ( t ) C f 1 , h ε 2 + f 0 , h 2 + · f 0 , h | ε | + ε 1 2 + f 0 , h | ε | 2 .
where
| | | E h | | | ε 2 ( t ) : = t E h ε 2 ( t ) + E h 2 ( t ) + · E h | ε | + ε 1 2 ( t ) + E h | ε | 2 ( t ) + 0 t t E h | ε | 2 d s + 0 t · E h | ε | 2 d s .

5.3. Stability of the Semi-Discrete Problem in Ω F E M

The stability of the semi-discrete problem in Ω F E M , relying on the variational formulation (18), and due to the appearance of the data function g, is slightly different from (32). We reformulate (18), in view of (12), and with v = v h = t E h as: given E h ( · , 0 ) = f 0 h , t E h ( · , 0 ) = f 1 h , and P h g (the L 2 -projection of the boundary data g in (17)), find E h W h E ( Ω F E M ) such that
ε t t E h , t E h + ( E h , t E h ) + ( ( ε ) · E h , · t E h ) + ( ( ε 1 ) · E h , · t E h ) = n ( P h g ) , t E h Ω F E M ,
Note that ε = 1 at the boundary of Ω F E M , hence the boundary term with the coefficient ε 1 does not appear in hear.
To deal with the ( ε ) · E h -term, we use the discrete version of the I 3 -estimate above and get
0 t I h 3 d s = Ω F E M 0 t ( ( ε ) · t E h ) ( · E h ) d s [ ( ε · E h ) ( · E h ) ] 0 t : = I h 3 , 1 + I h 3 , 2 .
Then
I h 3 , 1 1 2 0 t t E h | ε | , Ω F E M 2 d s + 1 2 0 t · E h | ε | , Ω F E M 2 d s ,
and
I h 3 , 2 1 2 E h | ε | , Ω F E M 2 + · E h | ε | , Ω F E M 2 ( t ) + 1 2 E h | ε | , Ω F E M 2 + · E h | ε | , Ω F E M 2 ( 0 ) .
As for the boundary term on the right-hand side of (34), with P h g = E h , F D M E h Ω | Ω F E M , we have that
n ( P h g ) , t P h g Ω F E M 1 2 n ( P h g ) Ω F E M 2 + 1 2 t ( P h g ) Ω F E M 2 .
Now, in view of (34)–(38), and taking the time integral, as in the case of stability in Ω , we end up with the following L 2 ( Ω F E M ) -type stability estimate:   
| | | E h | | | ε 2 , F E M ( t ) : = t E h ε 2 + E h 2 + E h | ε | 2 + · E h | ε | + ε 1 2 ( t ) + 0 t t E h | ε | , Ω F E M 2 d s + 0 t · E h | ε | , Ω F E M 2 d s C 1 t E h ε 2 + E h 2 + E h | ε | 2 + · E h | ε | + ε 1 2 ( 0 ) + C 2 0 t n ( P h g ) Ω F E M 2 d s + C 3 0 t t ( P h g ) Ω F E M 2 .
Note the appearance of the time integrals of spatial norms of the two boundary terms on the right-hand side of the estimate for | | | E h | | | ε 2 , F E M ( t ) in (39).
Summing up, we have the following stability estimate for the semi-discrete problem in Ω F E M :
Lemma 2.
Under the following regularity assumptions on the interpolants for initial conditions: f 1 , h L ε 2 ( Ω F E M ) , f 0 , h H 1 ( Ω F E M ) L | ε | 2 ( Ω F E M ) , · f 0 , h L | ε | + ε 1 2 ( Ω F E M ) , and with both boundary data: g h , and t E h L 1 ( 0 , T ) ; L 2 ( Ω F E M ) , we have that there are suitably chosen positive constants C i , i = 1 , 2 , 3 , such that for all t ( 0 , T ] , the following stability estimate for the semi-discrete Ω F E M problem holds true
| | | E h | | | ε 2 , F E M ( t ) C 1 f 1 , h ε 2 + f 0 , h 2 + f 0 , h | ε | 2 + · f 0 , h | ε | + ε 1 2 + C 2 0 t n ( P h g ) Ω F E M 2 d s + C 3 0 t t ( P h g ) Ω F E M 2 .

6. Error Estimates: Semi-Discrete (SD) Problems

In what follows, assuming certain regularity of the data set, E W E ( Ω ˜ ) H s ( Ω ˜ ) , and with the spectral polynomial order p chosen as the assumed regularity degree s 1 we can prove semi-discrete spatial error estimates of the form
| | | E E h | | | Ω ˜ C h p C h s , for Ω ˜ = Ω or Ω ˜ = Ω F E M .
Below we use a very similar argument to derive (41) for the spatial domains Ω and Ω F E M . To do so, we rely on an approach (see, e.g., [46]) based on a split of the bilinear form B ( · , · ) to a temporal term, plus a time-harmonic sub-bilinear form below denoted a ( · , · ) .
Splitting of B. Here we extract from B the bilinear form a ( · , · ) , by suppressing the time-derivative term, and establish well-posedness for a. Then we deal with the convergence of the original, time-dependent scheme of B. Thus
a ( E , v ) : = ( E , v ) + ( ( ε ) · E , · v ) + ( ( ε 1 ) · E , · v ) ,
Due to the homogeneous Dirichlet boundary condition, the inherited Galerkin orthogonality yields:
a ( E E h , χ ) = 0 , χ W 0 , h E .
Now we can write the equation (25) as Find E W E ( Ω ) such that for all v W 0 , h E ,
( ε t t E , v ) + a ( E , v ) = 0 .
The consistency of a ( · , · ) is a consequence of (44).
We also define the norm associated to a ( · , · ) :
[ E ] 2 : = E 2 + E 2 + · E ε 1 + | ε | 2 ,
which, as an immediate concern, requires the condition below   
| ε | < min ( 1 / 2 , ε 1 ) .
The coercivity of a ( · , · ) is due to vanishing boundary terms and assuming (for simplicity) that | Ω | = 1 , we use the Poincare inequality E E , and the second condition in (46) to write   
a ( E , E ) = ( E , E ) + ( ( ε ) · E , · E ) + ( ( ε 1 ) · E , · E ) 1 2 E 2 + 1 2 E 2 1 2 E | ε | 2 1 2 · E | ε | 2 + 1 4 · E ε 1 2 + · E | ε | 2 1 2 E 2 + 1 4 E 2 + 1 4 · E ( ε 1 + 2 | ε | ) 1 4 E 2 + E 2 + · E ε 1 + | ε | 2 = 1 4 [ E ] 2 ,
where the second inequality is a consequence of reusing Poincare inequality for the term 1 2 E | ε | 2 , and we have a desired coercivity for a ( · , · ) .
The continuity of a ( · , · ) is evident from the coercivity (47) and (46), which yields
max E , E , · E ε 1 + | ε | 1 2 [ E ]
a ( η , ξ ) = ( η , ξ ) + ( ( ε ) · η , · ξ ) + ( ( ε 1 ) · η , · ξ ) η ξ + η | ε | · ξ | ε | + · η ε 1 · ξ ε 1 1 4 [ η ] [ ξ ] + 1 4 [ η ] [ ξ ] + 1 4 [ η ] [ ξ ] = 3 4 [ η ] [ ξ ] [ η ] [ ξ ] .

6.1. Error Estimates: SD Problem in Ω

We define a Ritz–Galerkin type projection Q h : H ( d i v , Ω ) W 0 , h E ( Ω ) by
a ( Q h E , v ) = a ( E , v ) v W 0 , h E ( Ω ) .
Then using the estimates (see [46] for the details):
[ ξ ] 2 C a ( ξ , ξ ) C [ ξ ] [ η ] ,
and
[ η ] C h ζ 1 E H ζ ( Ω ) , 1 ζ 2 .
we can deduce that (see Lemma 5.4 in [46], H 1 -estimate and interpolation),
E Q h E Ω + h ζ 1 [ E Q h E ] C h ζ E H ζ ( Ω ) , 1 ζ 2 .
Finally, we recall the Galerkin orthogonality:
a ( E E h , χ ) = 0 , χ W 0 , h E ( Ω ) .
Our main result is the following theorem.
Theorem 1.
Let E and E h be the solutions for the continuous and semi-discrete, weakly formulated, problems (25) and (13), respectively. Assume that E ( t ) , t E ( t ) , t t 2 E H ζ ( Ω ) , 1 ζ 2 . Then, there exists a constant C, independent of x , t , h , but dependant on ε, such that for t [ 0 , T ] , the error e ( t ) = E ( · , t ) E h ( · , t ) is estimated as
t r e ( t ) Ω C h ζ t r E ( t ) H ζ ( Ω ) + C h ζ t 1 r 0 t s s 2 E H ζ ( Ω ) d s , r = 0 , 1 , e ( t ) ] Ω C h ζ 1 E ( t ) H ζ ( Ω ) + C h ζ 1 0 t s s 2 E H ζ ( Ω ) d s .
Proof. 
We shall prove the theorem for ζ = 2 . The case ζ = 1 is a simpler version, and ζ [ 1 , 2 ] follows using classical interpolation of the Sobolev spaces, see [47]. For ζ = 2 , we use a split of error via the Ritz projection:
e : = E E h = ( E Q h E ) + ( Q h E E h ) : = ρ + θ .
To bound θ we note that using the Galerkin orthogonality (53),
( ε θ t t , χ ) + a ( θ , χ ) = ( ε Q h E t t , χ ) Ω + a ( Q h E , χ ) Ω ( ε t t 2 E h , χ ) Ω a ( E h , χ ) Ω = ( ε Q h E t t , χ ) Ω + a ( Q h E , χ ) Ω ( ε t t 2 E , χ ) Ω a ( E , χ ) Ω = ( ε ρ t t , χ ) Ω , χ W 0 , h E .
Then, for χ = θ t ,
( ε θ t t , θ t ) Ω + a ( θ , θ t ) = ( ε ρ t t , θ t ) Ω .
This yields (noting that ε is a function only in space)
d d t ε θ t Ω 2 + a ( θ , θ ) 2 ε ρ t t Ω θ t Ω .
Note that, by the definition θ ( 0 ) = θ t ( 0 ) = 0 . Hence, integrating over [ 0 , t ] we get
ε θ t ( t ) Ω 2 + a ( θ ( t ) , θ ( t ) ) 2 0 t ε ρ s s Ω θ s Ω d s 2 ε max s [ 0 , t ] θ s Ω 0 t ρ s s Ω d s 2 0 t ρ s s Ω 2 + 1 2 ε max s [ 0 , t ] θ s Ω 2 .
Now, using the fact that a ( θ ( t ) , θ ( t ) ) 0 , and since (55) holds for all t [ 0 , T ] ,
1 2 ε max s [ 0 , t ] θ s Ω 2 2 0 T ρ s s Ω d s 2 ,
which inserting into (55) and using (52) noting that ε 1 and h τ we get
ε θ t ( t ) Ω 2 + a ( θ ( t ) , θ ( t ) ) 4 0 T ρ s s Ω 2 4 C h 2 0 T E s s H 2 ( Ω ) d s 2 4 ε C h 2 0 T E s s H 2 ( Ω ) d s 2 .
Consequently,
θ t ( t ) Ω C h 2 0 T E s s H 2 ( Ω ) d s ,
and
[ θ ( t ) ] Ω C h 2 0 T E s s H 2 ( Ω ) d s C h 2 0 T E s s H 2 ( Ω ) d s .
Note further that
2 θ Ω d d t θ Ω = d d t θ Ω 2 = d d t Ω | θ | 2 d x = 2 Ω θ · θ t d x 2 θ Ω θ t Ω .
Which integrating yields   
θ ( t ) Ω 0 t θ s ( s ) Ω d s C h 2 t 0 T E s s H 2 ( Ω ) d s .
Summing up, we get the desired result.    ☐
Remark 4.
Note that the errors in initial data, f 0 f 0 , h and f 1 f 1 , h , do not appear in the above estimates. In general, and for sufficiently regular f 0 and f 1 , the initial data errors can always be dominated by other error terms in appropriate norms.

6.2. Error Estimates: SD Problem in Ω F E M

Here the non-vanishing boundary data causes additional asymmetry (the first one: ( ( ε ) · E , · v ) was tackled above), which may be symmetrized using a Nitsche-type approach of [46]. We circumvent Nitsche invoking additional conditions on the Ritz projection at the boundary Ω F E M . The variational form and the finite element formulation in Ω F E M are
( ε t t E , v ) Ω F E M + ( E , v ) Ω F E M + ( ( ε ) · E , · v ) Ω F E M + ( ( ε 1 ) · E , · v ) Ω F E M n E , v Ω F E M = 0 , v W E ( Ω F E M ) ,
and
( ε t t E h , v ) Ω F E M + ( E h , v ) Ω F E M + ( ( ε ) · E h , · v ) Ω F E M + ( ( ε 1 ) · E h , · v ) Ω F E M n E h , v Ω F E M = 0 , v W h E ( Ω F E M ) ,
respectively. Hence, subtracting (60) from (59), where in (59) we restrict v W h E ( Ω F E M ) , we end up with the error equation for e ˜ : = E E h , in Ω F E M :
( ε t t e ˜ , v ) Ω F E M + ( e ˜ , v ) Ω F E M + ( ( ε ) · e ˜ , · v ) Ω F E M + ( ( ε 1 ) · e ˜ , · v ) Ω F E M n e ˜ , v Ω F E M = 0 , v W h E ( Ω F E M ) .
To be concise, for Ω F E M , we suppress the subscript Ω F E M from the inner products, and to distinguish from Ω , use e ˜ , B ˜ , and a ˜ for the error and the bilinear forms in Ω F E M . Now we define a somewhat modified Ritz–Galerkin projection: Q ˜ h : H ( d i v , Ω F E M ) W h E ( Ω F E M ) by
a ˜ ( Q ˜ h u , v ) n ( Q ˜ h u ) , v Ω F E M = a ˜ ( u , v ) n u , v Ω F E M v W h E ( Ω F E M ) ,
with a ˜ defined as a, but now over Ω F E M , and with the additional property of satisfying weak Neumann boundary condition that behaves like Galerkin approximation:
n ( Q ˜ h u ) , v Ω F E M = n u h , v Ω F E M v W h E ( Ω F E M ) ,
Note that denoting B ˜ : = B Ω F E M , (61) yields a modified Galerkin orthogonality, viz.
B ˜ ( E , v ) = B ˜ ( E h , v ) , v W h E ( Ω F E M ) ,
which can be rewritten as:
( ε E h , t t , v ) + a ˜ ( E h , v ) n E h , v Ω F E M = ( ε E t t , v ) + a ˜ ( E , v ) n E , v Ω F E M
Now, we follow the procedure above (using the very similar estimates of ρ and θ for ρ ˜ and θ ˜ ), and let
e ˜ : = E E h : = ( E Q ˜ h E ) + ( Q ˜ h E E h ) : = ρ ˜ + θ ˜ .
Then by this definition   
( ε t t θ ˜ , v ) Ω F E M n θ ˜ , v Ω F E M + a ˜ ( θ ˜ , v ) Ω F E M = ( ε Q ˜ h E t t , v ) Ω F E M ( ε E h , t t , v ) Ω F E M n Q ˜ h E , v Ω F E M + n E h , v Ω F E M + a ˜ ( Q ˜ h E , v ) Ω F E M a ˜ ( E h , v ) Ω F E M
Thus recalling (65) and (62), we end up with
( ε t t θ ˜ , v ) Ω F E M n θ ˜ , v Ω F E M + a ˜ ( θ ˜ , v ) Ω F E M = ( ε Q ˜ h E t t , v ) Ω F E M n Q ˜ h E , v Ω F E M + a ˜ ( Q ˜ h E , v ) Ω F E M ( ε E t t , v ) Ω F E M + n E , v Ω F E M a ˜ ( E , v ) Ω F E M = ( ε ρ ˜ t t , v ) Ω F E M .
The remaining part is as in the proof of the previous theorem for the error estimates for Ω . Thus summing up we have proved the following error estimate in Ω F E M :
Theorem 2.
Let E and E h be the solutions for the continuous and semi-discrete, weakly formulated, problems (25) and (13), respectively. Further, assume that E ( t ) , t E ( t ) , t t 2 E H ζ ( Ω ) , 1 ζ 2 . Then, there exists a constant C depending on ε but independent of x , t , h such that for t [ 0 , T ] and e ˜ defined as in (66);
t r e ˜ ( t ) Ω F E M C h ζ t r E ( t ) H ζ ( Ω F E M ) + C h ζ t 1 r 0 t s s 2 E H ζ ( Ω F E M ) d s , r = 0 , 1 e ˜ ( t ) ] Ω F E M C h ζ 1 E ( t ) H ζ ( Ω F E M ) + C h ζ 1 0 t s s 2 E H ζ ( Ω F E M ) d s .
Corollary 1.
Under the conditions in the theorem (2) and recalling (63) we have
{ e ˜ } Ω F E M : = e ˜ Ω F E M + e ˜ Ω F E M = O h ζ 1 / 2 , 1 ζ 2 .
Proof. 
Using the split (66) and (63) we have
( e ˜ , θ ˜ ) Ω F E M = ( ρ , θ ) Ω F E M .
As an immediate consequence of (71) we get
e ˜ Ω F E M ρ ˜ Ω F E M .
Further, by the trace theorem
ρ ˜ Ω F E M h 1 / 2 ρ ˜ Ω F E M = O ( h ζ 1 / 2 ) , 1 ζ 2 ,
which yields the desired result.    ☐

7. Numerical Examples

In this section, we present numerical examples justifying the theoretical results of the previous two sections. For convergence tests the domain decomposition algorithm (see Algorithm 2), implemented in the software package WavES [48], was used. We note that because of using explicit FE and FD schemes in Ω F E M and Ω F D M , correspondingly, we need to choose a time step τ according to the CFL stability condition (9) derived in [44] so that the whole hybrid scheme remains stable.
Algorithm 2 Domain decomposition algorithm for the solution of Maxwell’s equation (Equation (2)). At every time step k we performed the following operations:
1:
Compute E h k + 1 in Ω F D M using the explicit finite difference scheme (24) with known E h k , and E h k 1 -values.
2:
Compute E h k + 1 in Ω F E M by using the finite element scheme (19) with known E h k , E h k 1 .
3:
For the finite difference method in Ω F D M , use the values of the function E h k + 1 at nodes ω (green boundary of Figure 1), which are computed using the finite element scheme (19), as a boundary condition at the inner boundary of Ω F D M .
4:
Apply appropriate boundary condition at the outer boundary of Ω F D M .
5:
For the finite element method in Ω F E M , use the values of the functions E h k + 1 at nodes ω o (blue boundary of the Figure 1), which are computed using the finite difference scheme (24) as a boundary condition.
6:
Apply swap of the solutions for the computed function E h k + 1 to be able to perform the algorithm on a new time level k.
Numerical tests are performed in time interval ( 0 , T ) = ( 0 , 0.25 ) and in the spatial dimensionless computational domain
Ω = ( x , y ) : x [ 0 , 1 ] , y [ 0 , 1 ] ,
which is split into the finite element domain
Ω F E M = ( x , y ) : x [ 0.25 , 0.75 ] , y [ 0.25 , 0.75 ]
and the finite difference domain Ω F D M , thus Ω = Ω F E M Ω F D M , see Figure 1.
The model problem in all our tests that is stated for the electric field E = ( E 1 , E 2 ) is as follows:
ε t t E + ( · E ) E · ( ε E ) = F in   Ω × ( 0 , T ) , E ( · , 0 ) = 0   and   t E ( · , 0 ) = 0 in   Ω , E = 0 on   Ω × ( 0 , T ) .
We have the functions
E 1 = 1 ε 2 π sin 2 π x cos π y sin π y t 2 2 , E 2 = 1 ε 2 π sin 2 π y cos π x sin π x t 2 2 ,
as the exact solution E = ( E 1 , E 2 ) of the model problem (76) with the source data F = ( F 1 , F 2 ) which corresponds to this exact solution.
The function ε in (76) is defined as
ε ( x , y ) = 1 + sin m π ( 2 x 0.5 ) · sin m π ( 2 y 0.5 ) in   Ω F E M , 1 in   Ω F D M .
We choose m = 2 , 4 , 6 , 8 in our numerical examples, see Figure 2, for these functions in the domain Ω F E M . We note that the exact solution (77) satisfies the divergence-free condition · ( ε E ) = 0 for ε defined by (78), the homogeneous initial conditions, as well as the homogeneous Dirichlet conditions for all times.
The computational domain Ω F E M × ( 0 , T ) was discretized into triangular elements with mesh sizes h l = 2 l , l = 3 , 4 , 5 , 6 , and the mesh in Ω F D M × ( 0 , T ) was decomposed into squares of the same mesh sizes as described in Section 3, see Figure 1. The time step was chosen corresponding to the stability criterion (9) as τ l = 0.025 · 2 l for l = 3 , 4 , 5 , 6 . Convergence results of the proposed finite element scheme computed in L 2 and H 1 norms are presented in Table 1, Table 2, Table 3 and Table 4 for m = 2 , 4 , 6 , 8 in (78). Relative norms in these tables were computed as
e l 1 = max 1 k N E k E h k max 1 k N E k , e l 2 = max 1 k N ( E k E h k ) max 1 k N E k .
E and E h are the exact and computed FE solutions in Ω F E M × ( 0 , T ) , respectively, and N = T / τ l . Logarithmic convergence rates r 1 , r 2 in these tables are computed, viz.
r 1 = log e l h 1 e l 2 h 1 | log ( 0.5 ) | , and r 2 = log e l h 2 e l 2 h 2 | log ( 0.5 ) | ,
where e l h 1 , 2 , e l 2 h 1 , 2 are relative norms computed via (79) on the mesh T h with the mesh size h and 2 h , respectively. Figure 3 shows convergence of the relative L 2 - and H 1 -norms computed via (79) and compared with exact behavior of h and h 2 .
Computed hybrid FE/FD versus exact solutions with m = 8 in (78) at the time t = 0.25 are presented in Figure 4, where | E h | is computed using the domain decomposition algorithm (Algorithm 2) for different meshes with sizes h l = 2 l , l = 3 , 4 , 5 , 6 . The top figures of Figure 4 present hybrid FE/FD meshes which were used for computations; common hybrid FE/FD solution in Ω is presented in the middle figures; the bottom figures show only FD solution as part of the common hybrid solution in Ω F D M . Interpreting these figures, we observe smooth behavior of the hybrid solution across finite element/finite difference boundary, as was predicted in theory.
Furthermore, through these figures, as well as tables and Figure 3, we observe that with increasing l in h l = 2 l , l = 3 , 4 , 5 , 6 , the computational errors approach the second order convergence in L 2 - and first order in H 1 -norm for m = 2 , 4 , 6 , 8 . Therefore, we can conclude that the finite element scheme in the hybrid FE/FD method, considered in Ω F E M , behaves like a first-order method in the H 1 -norm and a second-order method in the L 2 -norm. These results are all in good agreement with the analytic estimates derived in Section 5 and Section 6, as well as with results presented for finite element method in [44] for the whole Ω .

8. Conclusions

In this paper, we present stability and convergence analysis for the domain decomposition FE/FD method for time-dependent Maxwell’s equations developed in [3,4]. The convergence is optimal due to the assumed maximal available regularity of the exact solution in a Sobolev space in correlation with the optimal interpolation rates in the power s of the mesh function h, see e.g., (41) and (69).
The analysis is performed for the semi-discrete (spatial discretization) problem for the constructed finite element schemes in two different settings: in Ω and Ω F E M . The temporal discretization algorithms are constructed using the CFL condition (9) derived in [44]. We have implemented several numerical examples that validate the robustness of the theoretical studies.

Author Contributions

Conceptualization, M.A. and L.B.; methodology, M.A. and L.B.; software, L.B.; validation, L.B.; investigation, M.A. and L.B.; writing—original draft preparation, M.A. and L.B.; writing—review and editing, M.A. and L.B.; visualization, L.B. All authors have read and agreed to the published version of the manuscript.

Funding

The research of both authors is supported by the Swedish Research Council grant VR 2018-03661.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chan, T.; Mathew, T. Domain decomposition algorithms. In Acta Numerica; Iserles, A., Ed.; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
  2. Toselli, A.; Widlund, B. Domain Decomposition Methods; Springer: Berlin, Germany, 2005. [Google Scholar]
  3. Beilina, L.; Grote, M. Adaptive Hybrid Finite Element/Difference method for Maxwell’s equations. TWMS J. Pure Appl. Math. 2010, 1, 176–197. [Google Scholar]
  4. Beilina, L. Energy estimates and numerical verification of the stabilized Domain Decomposition Finite Element/Finite Difference approach for time-dependent Maxwell’s system. Cent. Eur. J. Math. 2013, 11, 702–733. [Google Scholar] [CrossRef]
  5. Rylander, T.; Bondeson, A. Stable FEM-FDTD hybrid method for Maxwell’s equations. J. Comput. Phys. Commun. 2000, 125, 75–82. [Google Scholar] [CrossRef]
  6. Rylander, T.; Bondeson, A. Stability of Explicit-Implicit Hybrid Time-Stepping Schemes for Maxwell’s Equations. J. Comput. Phys. 2002, 179, 426–438. [Google Scholar] [CrossRef]
  7. Edelvik, F.; Ledfelt, G. Explicit hybrid solver for the Maxwell equations in 3D. J. Sci. Comput. 2000, 15, 61–78. [Google Scholar] [CrossRef]
  8. Yee, K.S. Numerical solution of initial boundary value problems involving Maxwell’s equations in isotropic media. IEEE Trans. Antennas Propag. 1966, 14, 302–307. [Google Scholar]
  9. Malmberg, J.B.; Beilina, L. An Adaptive Finite Element Method in Quantitative Reconstruction of Small Inclusions from Limited Observations. Appl. Math. Inf. Sci. 2018, 12, 1–19. [Google Scholar] [CrossRef]
  10. Ciarlet, P., Jr.; Jamelot, E. Continuous Galerkin methods for solving the time-dependent Maxwell equations in 3D geometries. J. Comput. Phys. 2007, 226, 1122–1135. [Google Scholar] [CrossRef]
  11. Costabel, M. A coercive bilinear form for Maxwell’s equations. J. Math. Anal. Appl. 1991, 157, 527–541. [Google Scholar] [CrossRef]
  12. Costabel, M.; Dauge, M. Singularities of Electromagnetic Fieldsn in Polyhedral Domains. Arch. Rational Mech. Anal. 2000, 151, 221–276. [Google Scholar] [CrossRef]
  13. Dauge, M.; Costabel, M. Weighted Regularization of Maxwell Equations in Polyhedral Domains. A rehabilitation of nodal finite elements. Numer. Math. 2002, 93, 239–277. [Google Scholar]
  14. Ern, A.; Guermond, J.-L. Finite element quasi-interpolation and best approximation. ESAIM Math. Mod. Numer. Anal. 2017, 51, 1367–1385. [Google Scholar] [CrossRef]
  15. Ern, A.; Guermond, J.-L. Analysis of the edge finite element approximation of the Maxwell equations with low regularity solutions. Comput. Math. Appl. 2018, 75, 918–932. [Google Scholar] [CrossRef] [Green Version]
  16. Aram, M.G. Antenna Design, Radiobiological Modelling, and Non-Invasive Monitoring for Microwave Hyperthermia. Licentiate Thesis, Chalmers University of Technology, Gothenburg, Sweden, 2021. Available online: https://research.chalmers.se/en/publication/?id=528711 (accessed on 20 August 2022).
  17. Baudouin, L.; de Buhan, M.; Ervedoza, S.; Osses, A. Carleman-based reconstruction algorithm for the waves. SIAM J. Numer. Anal. 2020, 59, 998–1039. [Google Scholar] [CrossRef]
  18. Haynes, M.; Stang, J.; Moghaddam, M. Real-time Microwave Imaging of Differential Temperature for Thermal Therapy Monitoring. IEEE Trans. Biomed. Eng. 2014, 61, 1787–1797. [Google Scholar] [CrossRef]
  19. Khoa, V.A.; Bidney, G.W.; Klibanov, M.V.; Nguyen, L.H.; Nguyen, L.H.; Sullivan, A.J.; Astratov, V.N. An inverse problem of a simultaneous reconstruction of the dielectric constant and conductivity from experimental backscattering data. Inverse Probl. Sci. Eng. 2021, 29, 712–735. [Google Scholar] [CrossRef]
  20. Ito, K.; Jin, B. Inverse Problems: Tikhonov Theory and Algorithms; Series on Applied Mathematics; World Scientific: Singapore, 2015; Volume 22. [Google Scholar]
  21. Groetsch, C.W. Inverse Problems in the Mathematical Sciences; Friedr. Vieweg & Sohn Verlagsgesellschaft: Braunschweig/Wiesbaden, Germany, 1993. [Google Scholar]
  22. Tikhonov, A.N.; Goncharsky, A.V.; Stepanov, V.V.; Yagola, A.G. Numerical Methods for the Solution of Ill-Posed Problems; Kluwer: London, UK, 1995. [Google Scholar]
  23. Lazebnik, M.; McCartney, L.; Popovic, D.; Watkins, C.B.; Lindstrom, M.J.; Harter, J.; Sewall, S.; Magliocco, A.; Booske, J.H.; Okoniewski, M.; et al. A large-scale study of the ultrawideband microwave dielectric properties of normal breast tissue obtained from reduction surgeries. Phys. Med. Biol. 2007, 52, 2637–2656. [Google Scholar] [CrossRef]
  24. Lazebnik, M.; Popovic, D.; McCartney, L.; Watkins, C.B.; Lindstrom, M.J.; Harter, J.; Sewall, S.; Ogilvie, T.; Magliocco, A.; Breslin, T.M.; et al. A large-scale study of the ultrawideband microwave dielectric properties of normal, benign, and malignant breast tissues obtained from cancer surgeries. Phys. Med. Biol. 2007, 52, 6093–6115. [Google Scholar] [CrossRef]
  25. Taflove, A. Computational Electrodynamics: The Finite-Difference Time-Domain Method; Artech House: Boston, MA, USA, 1995. [Google Scholar]
  26. Lee, R.L.; Madsen, N.K. A mixed finite element formulation for Maxwell’s equations in the time domain. J. Comput. Phys. 1990, 88, 284–304. [Google Scholar] [CrossRef]
  27. Jiang, B. The Least-Squares Finite Element Method. Theory and Applications in Computational Fluid Dynamics and Electromagnetics; Springer: Heidelberg, Germany, 1998. [Google Scholar]
  28. Jiang, B.; Wu, J.; Povinelli, L.A. The origin of spurious solutions in computational electromagnetics. J. Comput. Phys. 1996, 125, 104–123. [Google Scholar] [CrossRef]
  29. Nédélec, J.-C. Mixed finite elements in R3. Numer. Math. 1980, 35, 315–341. [Google Scholar] [CrossRef]
  30. Nédélec, J.-C. A new family of mixed finite elements in R3. Numer. Math. 1986, 50, 57–81. [Google Scholar] [CrossRef]
  31. Chen, M.-H.; Cockburn, B.; Reitich, F. High-order RKDG methods for computational electromagnetics. J. Sci. Comput. 2005, 22, 205–226. [Google Scholar] [CrossRef] [Green Version]
  32. Cockburn, B.; Li, F.; Shu, C.-W. Locally divergence-free discontinuous Galerkin methods for the Maxwell equations. J. Comput. Phys. 2004, 194, 588–610. [Google Scholar] [CrossRef]
  33. Cockburn, B.; Shu, C.-W. TVB Runge–Kutta local projection discontinuous Galerkin method for conservation laws II: General framework. Math. Comput. 1989, 52, 411–435. [Google Scholar]
  34. Fezoui, L.; Lanteri, S.; Lohrengel, S.; Piperno, S. Convergence and stability of a discontinuous Galerkin time-domain methods for the 3D heterogeneous Maxwell equations on unstructured meshes. Modél. Math. Anal. Numér. 2005, 39, 1149–1176. [Google Scholar] [CrossRef]
  35. Grote, M.J.; Schneebeli, A.; Schötzau, D. Interior penalty discontinuous Galerkin method for Maxwell’s equations: Energy norm error estimates. J. Comput. Appl. Math. 2007, 204, 375–386. [Google Scholar] [CrossRef]
  36. Monk, P.B. Finite Element Methods for Maxwell’s Equations; Oxford University Press: Oxford, UK, 2003. [Google Scholar]
  37. Cohen, G.C. Higher Order Numerical Methods for Transient Wave Equations; Springer: Berlin, Germany, 2002. [Google Scholar]
  38. Elmkies, A.; Joly, P. Finite elements and mass lumping for Maxwell’s equations: The 2D case. Comptes Rendus L’Acad. Sci. Ser. I Math. 1997, 11, 1287–1293. [Google Scholar]
  39. Joly, P. Variational Methods for Time-Dependent Wave Propagation Problems, Lecture Notes in Computational Science and Engineering; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
  40. Monk, P.B.; Parrott, A.K. A dispersion analysis of finite element methods for Maxwell’s equations. SIAM J.Sci.Comput. 1994, 15, 916–937. [Google Scholar] [CrossRef]
  41. Paulsen, K.D.; Lynch, D.R. Elimination of vector parasites in Finite Element Maxwell solutions. IEEE Trans. Microw. Theory Technol. 1991, 39, 395–404. [Google Scholar] [CrossRef]
  42. Jin, J. The Finite Element Method in Electromagnetics; Wiley: Hoboken, NJ, USA, 1993. [Google Scholar]
  43. Munz, C.D.; Omnes, P.; Schneider, R.; Sonnendrucker, E.; Voss, U. Divergence correction techniques for Maxwell Solvers based on a hyperbolic model. J. Comput. Phys. 2000, 161, 484–511. [Google Scholar] [CrossRef]
  44. Beilina, L.; Ruas, V. Convergence of Explicit P1 Finite-Element Solutions to Maxwell’s Equations. In Proceedings of the Mathematical and Numerical Approaches for Multi-Wave Inverse Problems, Marseille, France, 1–5 April 2019; Springer: Cham, Switzerland, 2020; Volume 328. [Google Scholar]
  45. Brenner, S.C.; Scott, L.R. The Mathematical Theory of Finite Element Methods; Springer: Berlin, Germany, 1994. [Google Scholar]
  46. Asadzadeh, M.; Kowalczyk, P.; Standar, C. On hp-Streamline Diffusion and Nitsche schemes for the Relativistic Vlasov-Maxwell System. Kinet. Relat. Model. 2019, 12, 105–131. [Google Scholar] [CrossRef] [Green Version]
  47. Bergh, J.; Löfström, J. Interpolation Spaces; Springer: Berlin/Heidelberg, Germany, 1975. [Google Scholar]
  48. Software Package WavES. Available online: http://www.waves24.com/ (accessed on 20 August 2022).
Figure 1. Domain decomposition and mesh discretization in Ω . The mesh of Ω in (a) is a combination of the quadrilateral finite difference mesh Ω F D M presented in (c) and the finite element mesh Ω F E M presented in (b). Domains Ω F E M and Ω F D M overlap by two layers of structured nodes such that they have common boundaries shown by green and blue.
Figure 1. Domain decomposition and mesh discretization in Ω . The mesh of Ω in (a) is a combination of the quadrilateral finite difference mesh Ω F D M presented in (c) and the finite element mesh Ω F E M presented in (b). Domains Ω F E M and Ω F D M overlap by two layers of structured nodes such that they have common boundaries shown by green and blue.
Algorithms 15 00337 g001
Figure 2. Function ε ( x , y ) in the domain Ω F E M for different values of m in (78).
Figure 2. Function ε ( x , y ) in the domain Ω F E M for different values of m in (78).
Algorithms 15 00337 g002
Figure 3. Convergence of the relative L 2 and H 1 norms computed via (79).
Figure 3. Convergence of the relative L 2 and H 1 norms computed via (79).
Algorithms 15 00337 g003
Figure 4. Computed vs. exact solution at the time t = 0.25 for different meshes taking m = 8 in (78). Algorithm 2 was used in the domain decomposition method. Common elements in Ω F E M and Ω F D M on different meshes are presented on the top figures and are outlined in light blue. We observe a smooth hybrid solution across FE/FD boundaries.
Figure 4. Computed vs. exact solution at the time t = 0.25 for different meshes taking m = 8 in (78). Algorithm 2 was used in the domain decomposition method. Common elements in Ω F E M and Ω F D M on different meshes are presented on the top figures and are outlined in light blue. We observe a smooth hybrid solution across FE/FD boundaries.
Algorithms 15 00337 g004
Table 1. Relative errors e l 1 and e l 2 in the L 2 and H 1 norms, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 2 in (78).
Table 1. Relative errors e l 1 and e l 2 in the L 2 and H 1 norms, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 2 in (78).
l nel nno e l 1 el h 1 el 2 h 1 r 1 e l 2 el h 2 el 2 h 2 r 2
312881 4.878 · 10 2 3.902 · 10 1
4512289 1.222 · 10 2 3.992 1.997 1.955 · 10 1 1.996 0.997
520481089 2.654 · 10 3 4.604 2.203 8.492 · 10 2 2.302 1.203
681924225 5.15 · 10 4 5.151 2.365 3.297 · 10 2 2.575 1.365
Table 2. Relative errors e l 1 and e l 2 in the L 2 norm and in the H 1 norm, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 4 in (78).
Table 2. Relative errors e l 1 and e l 2 in the L 2 norm and in the H 1 norm, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 4 in (78).
l nel nno e l 1 el h 1 el 2 h 1 r 1 e l 2 el h 2 el 2 h 2 r 2
312881 5.54 · 10 2 4.432 · 10 1
4512289 8.438 · 10 3 6.565 2.7148 1.35 · 10 1 3.283 1.715
520481089 1.581 · 10 3 5.337 2.4160 5.06 · 10 2 2.668 1.416
681924225 3.35 · 10 4 4.722 2.2394 2.143 · 10 2 2.361 1.239
Table 3. Relative errors e l 1 and e l 2 in the L 2 norm and in the H 1 norm, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 6 in (78).
Table 3. Relative errors e l 1 and e l 2 in the L 2 norm and in the H 1 norm, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 6 in (78).
l nel nno e l 1 el h 1 el 2 h 1 r 1 e l 2 el h 2 el 2 h 2 r 2
312881 1.856 · 10 2 1.485 · 10 1
4512289 5.168 · 10 3 3.592 1.845 8.268 · 10 2 1.796 0.778
520481089 1.594 · 10 3 3.243 1.697 5.099 · 10 2 1.621 0.697
681924225 3.6 · 10 4 4.432 2.148 2.301 · 10 2 2.216 1.148
Table 4. Relative errors e l 1 and e l 2 in the L 2 norm and in the H 1 norm, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 8 in (78).
Table 4. Relative errors e l 1 and e l 2 in the L 2 norm and in the H 1 norm, respectively, for mesh sizes h l = 2 l , l = 3 , , 6 , for m = 8 in (78).
l nel nno e l 1 el h 1 el 2 h 1 r 1 e l 2 el h 2 el 2 h 2 r 2
312881 1.131 · 10 2 1.045 · 10 1
4512289 5.669 · 10 3 2.304 1.204 9.071 · 10 2 1.152 0.2
520481089 1.711 · 10 3 3.314 1.728 5.475 · 10 2 1.657 0.728
681924225 3.83 · 10 4 4.468 2.16 2.451 · 10 2 2.234 1.16
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Asadzadeh, M.; Beilina, L. Stability and Convergence Analysis of a Domain Decomposition FE/FD Method for Maxwell’s Equations in the Time Domain. Algorithms 2022, 15, 337. https://doi.org/10.3390/a15100337

AMA Style

Asadzadeh M, Beilina L. Stability and Convergence Analysis of a Domain Decomposition FE/FD Method for Maxwell’s Equations in the Time Domain. Algorithms. 2022; 15(10):337. https://doi.org/10.3390/a15100337

Chicago/Turabian Style

Asadzadeh, Mohammad, and Larisa Beilina. 2022. "Stability and Convergence Analysis of a Domain Decomposition FE/FD Method for Maxwell’s Equations in the Time Domain" Algorithms 15, no. 10: 337. https://doi.org/10.3390/a15100337

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop