A Defect-Correction nodal Finite Element Method for Time-dependent Maxwell’s equations on Polygonal DomainsThanks: ∗Department of Mathematics, University of Buea, Molyko, Buea, Cameroon, e-mail: nkeck.jake@ubuea.cm, https://orcid.org/0000-0003-0492-8247.
Abstract.
This paper develops a nodal finite element Crank-Nicolson method of lines to solve the time-dependent Maxwell’s equations on polygonal domains with re-entrant corners. Nodal Finite Element methods are used to solve Maxwell’s equations with an optimal convergence rate when the domain is convex or has a smooth boundary, but may fail to converge if the domain has a re-entrant corner. The Defect-Correction method presented is based on a decomposition of the solution in terms of Fourier and Bessel’s series, an extraction of the singular function and an approximation of the regular part of the solution. Optimal convergence results are recovered using the method in both the energy norm and the -norm.
Key words and phrases:
Maxwell’s Equations, Crank-Nicolson Method, Re-entrant Corner, Singular function2005 Mathematics Subject Classification
37A17, 76F02, 76M10, 74S20, 74S251. Introduction
Electromagnetic waves are of particular importance in applied physics, engineering, and materials science, for example, in radars, antennas, and the detection of cracks in metals. Electromagnetic phenomena are modeled by a particular system of partial differential equations (PDEs) called Maxwell’s equations or equations of electromagnetism. Maxwell’s equations involve a couple of vector functions called electromagnetic field, where u is the electric field and b is the magnetic field.
A general result of numerical methods for PDEs is that the accuracy of approximation depends on the regularity of the unknown solution, see [1, 2, 3, 4]. It is well known that solutions of boundary value problems in domains with corners, cracks, edges and conic vertices may entail singularities, even if the data are smooth. Moreover, the asymptotic behavior of the solution near these geometric singularities has been well studied and the results are now well known, see, for example [5, 6, 7, 8]. However, unlike general elliptic boundary value problems, the solution of Maxwell’s equations in domains with geometric singularities exhibits some regularity properties that make its approximation particularly difficult.
In the case of time-harmonic Maxwell’s equations in a two-dimensional domain with corners and for a given right hand side function in the Hilbert space , it has been shown that the solution belongs to the Sobolev space () only if the value of the largest angle is smaller than , see, for example [9, 10, 11, 12]. It follows that the solution belongs to the space only if is convex and to the space only if the largest angle at the corners is less than . We would say that the solution of the boundary value problem has geometric singularities if for a given right hand side function in the solution belongs only to the Sobolev space with . It follows that on non-convex domains, the standard -conforming FEM cannot be employed for the solution of Maxwell’s equations.
The work of Costabel [13] in 2002 combined with the bilinear form introduced in [14] has allowed the scientific community to renew the nodal FEM for Maxwell’s Equations and some new finite element schemes have been developed in order to recover the convergence rate on non-convex domains. We mention in particular:
- -
The singular field method (SFM) introduced by Hazard and Lenoir [15], Hazard et al. [16, 17]. This method consists in splitting the solution u into two parts , with a ”regular part” that lies in the usual Sobolev space and a singular part that lies in a known finite dimensional space and a constant to be determined from the finite element linear system. The constant is known as the coefficient of singularity. With this method one can approximate the solution in non-convex polygonal domains with nodal FEM but the rate of convergence is still lower than the one on smooth domains because the splitting is not optimal.
- -
The Orthogonal Singular Field Method (OSFM) introduced by Assous et al. [17], where the solution u is again split into two parts , a regular part that lies in a subspace of and the second part is in a subspace of the space of solutions orthogonal to the regular space. The OSFM and the SFM have the same rate of convergence but the OSFM is more stable due to the omission of the use of cut-off functions present in the SFM for the instabilities due to the use of cut-off functions.
- -
The ”-approach” for two-dimensional vector problems developed by Jamelot in 2004 [18], where the splitting is done but is given by a formula and depends only on the domain and the initial data. This method ameliorates the rate of convergence of the SFM and the OSFM but the rate is still not optimal (of order in the energy norm and in the -norm, being the greatest value of the angles of the domain).
- -
The weighted regularization developed by Costabel and Dauge [13], where the boundary conditions are multiplied by a weight that depends on the distance to the geometric singularities. In this method each singularity requires the construction of a new weight. It is stated in [19] that this method requires the approximation space to contain the gradient of -scalar functions, which excludes low order finite element spaces (-finite element spaces for example). This restriction is removed in the work of Buffa et al. [20] by considering a mixed form of the weighted -stabilization technique on special meshes. This method has also been simplified by Otin in [21, 22] where the method is performed by using a weight equal to zero in the elements near the singularity and equal to one in the other elements.
- -
The mixed methods with natural boundary conditions developed by Ciarlet Jr. et al.[4]. These methods consist in the dualisation of the equation on the divergence and the relation on the tangential or normal trace of the field with some Lagrange multipliers. Several authors have also contributed to the development of these methods. We highlight the works of Codina et al. [23, 24, 25] where a novel augmented formulation is produced by adding the Laplacian of the Lagrange multiplier multiplied by a mesh dependent stabilizing term to the equation resulting from the dualisation of the divergence equation.
- -
The -projection methods developed by Duan and al. [26, 27]. In these methods, -projectors are applied to both curl and div formulations and linear continuous finite elements enriched with some higher order bubble functions are employed in order to approximate low regular functions. These methods do not impose information on the geometric singularities of the domain boundary but are still limited to linear continuous elements.
- -
- -
The Predictor-Corrector nodal FEM that makes use of the explicit extraction formulas for the coefficients of the singularities of the solution near the corners ( see [9, 11, 12, 29, 30]). The optimal convergence rate is recovered by the method. The method can be applied with high order finite element polynomials but faces the problem of logarithmic singularities that may easily happen in the case of Maxwell’s equations.
This paper extends the Predictor-Corrector nodal FEM developed for the 2D time-harmonic Maxwell’s equations on convex and non-convex polygonal domains with exactly one re-entrant angle centered at the origin . The method is based on a Fourier decomposition of the solution and a defect-correction algorithm to recover the optimal convergence known for Maxwell’s equations on convex polygonal domains or on domains with a -boundary.
This paper is organized as follows, Section 2 presents the Maxwell’s equations on polygonal domains, Section 3 develops a local decomposition of the solution around the singular corner, Section 4 proposes a Defect-Correction FEM with the error estimates in - and the energy norm and Section 5 concludes the paper.
2. The Model Problem
Given a vector function , define the divergence of v by
Given a scalar function , define by
Define to be the space of classes of measurable and square integrable functions over equipped with the norm that will also denote the norm in the Cartesian product space , being the Lebesgue measure.
equipped with the norms
where denotes the norm in and also the norm in the cartesian product space . The quantity defined by
is the semi-norm in .
Given an interval and a Hilbert space , will denote the space of bounded -continuously differentiable functions on of the form equipped with the norm
The space will denote the space of functions , equipped with the norm
The space is the completion of with respect to the norm
The space is the space of functions , equipped with the norm
The space , , is the space of functions such that with the norm
The space is the space of functions , equipped with the norm
Given a simply connected polygonal domain with boundary , a function such that , two functions and , find such that
| (1) | ||||
where is the unit outward normal to , and .
Using the formula one obtains the system
| (2) | ||||
Problem (2) is equivalent to an initial boundary value problem useful for the Lagrange nodal finite element investigation due to the continuity of the finite element functions along the tangential and the normal components. That result is given by the following proposition.
Proposition .
If is not an eigenvalue of the Laplace operator , Problem (2) is equivalent to the following problem:
find such that
| (3) | ||||
Proof.
Suppose u is a solution of Problem (2) and let , taking the divergence in the first equation of (2), one obtains that is the unique solution of the Problem
| (4) | ||||
But Problem (2) has the unique null solution provided that is not an eigenvalue of the Laplace operator , then in and u is also a solution of Problem (2). ∎
Taking the inner product of the first, fourth and the fifth equation of Problem (2) with , the integral over and using integration by parts lead to the variational problem: find such that
| (5) | ||||
where The following results prove the existence and uniqueness of the solution of the variational problem (2). To prove it, one can apply Theorem 8.1, page 287 of [31].
Proposition \theproposition.
If , and , then the variational problem (2) has a unique solution such that belongs to . Furthermore the solution depends continuously on the data.
3. Decomposition of the Solution
An approximation of the solution of the variational problem (2) involves a particular study of the relation between and . From [16] page 2033, where
being the orthogonal of in .
This introduction allows the decomposition of the solution into a space regular and a space singular part. The geometric singularity being a local problem see [8, p. 71]it is judicious to study the problem in a circular sector.
For sake of simplicity, it is assumed that the domain has only one corner centered at the origin in the -plane with angle , . Introduce the polar coordinates with , , . Let , consider the restriction on a circular sector with
and the cut-off function
Set , describes the solution u around the corner and is the unique solution of the problem: find such that
| (6) | ||||
| (7) | ||||
| (8) | ||||
| (9) | ||||
| (10) |
where
The one-to-one mapping transforms into a rectangle and we can pass through polar coordinates by setting and
Problem (6) becomes
| (11) | ||||
The derivatives are interpreted in the sense of distributions. The boundary conditions at and allow us to consider the following Fourier decompositions for and ,
where , , . The system (11) becomes
| (12) | ||||
Setting and the first and the second equations of Problem (12) become
| (13) |
The homogeneous equations associated to the equations (13) can be solved by separation of variables by setting , to obtain the equality , .
Due to the mixed boundary conditions at from the two last equalities of (12) and the smoothness of the solution u in time, the operator has positive and discrete eigenvalues , , arranged in an increasing sequence. One writes , , , so, the equations , lead to , where , are constants and the , , form an increasing sequence of positive numbers such that , and are the Bessel functions of the first and second kind respectively.
The boundary conditions and in Problem (12) imply that , , , . Then
where
Replacing and by their decompositions in Problem (12) leads to
| (14) |
Then
where and are defined in (14). Using the fact that
the solution has the decomposition
| (15) | |||||
where , ,
and .
Remark .
In cartesian coordinates, has the decomposition
| (16) |
where
Lemma .
| (17) |
and
| (18) |
Proof.
Similar methods can be used with , and to show (18). ∎
A truncation of the summation on the integer can be done and the following error estimate is obtained.
Lemma .
Let , , and let be an increasing sequence of positive numbers such that where , is fixed and is defined as in (1). Let
Then
| (20) |
and
| (21) |
Remark .
as but since , as .
4. The Defect-Correction Finite Element method
4.1. A Semi-discrete Approximation
This section presents a space discretization of the solution by a Galerkin approximation with -conforming finite element methods. The Galerkin method considers a quasi-uniform and shape-regular triangulation of with diameter , and finds a semi-discrete approximation of the solution of Problem (2) satisfying
| (22) |
where is a finite dimensional space.
The following result presents the standard error estimates for regular solutions which happens when is convex or has a -boundary. A proof can be adapted from the one in [32, Theorem 4.1, p. 575],
Theorem 1.
When the domain is convex with an angle greater than the solution may converge slowly and if is not convex, the solution may fail to converge. The following algorithm based on the decomposition (16) proposes a way to recover the optimal convergence as in Theorem 1.
- 1)
Solve Problem (22) in and obtain the solution .
- 2)
- 3)
Find solution of
(23) where .
- 4)
Compute .
Error Estimates
From the decomposition and the Defect-correction Algorithm 1, one can derive the following error estimates.
Lemma .
Let be a quasi-uniform and shape-regular triangulation of and let be the usual Lagrange interpolation operator over the triangulation . Then for , , , ,
| (24) | ||||
| (25) |
Proof.
Let us divide the triangulation of the domain into two parts and , one has
By the Cauchy-Schwartz inequality
happens when , then for ,
being a polynomial of degree then for ,
Hence .
For , then
Then and
Using the same method as above, one can prove that
∎
Lemma .
Let be a quasi-uniform and shape-regular triangulation of and let be the usual Lagrange interpolation operator over the triangulation . Then for , , , , , , there exist such that
| (26) |
and
| (27) |
Proof.
Let us divide the triangulation of the domain into two parts and .
For ,
Then
This shows (26).
The inequality (27) can be shown using the same way as previous.
∎
Theorem 2.
Proof.
then
| (30) | ||||
The next step consists to find an appropriate bound of .
Set , and , one has
| (31) |
Taking the difference of (31) with the first equation of (22) leads to
for any . Then for , integration by parts gives
Taking the integral between and and the Inequality (27) give
Since one deduces that
4.2. A Crank-Nicolson full discretization
Considering a quasi-uniform and shape-regular triangulation of the polygonal domain and a Galerkin solution of the variational problem (22), let be a basis of the space , one has where and , satisfies the variational system
where , and
.
The full discretization consists to subdivide the interval into subintervals of size , such that , . The -schemes () consists of approximating , such that
| (33) | ||||
So if we set be an interpolation of the solution , that is, with a Crank-Nicolson scheme (), one has the following error estimates from Theorem 1
for if is a convex polygonal domain and if u belongs to , is in and belongs to , .
The following algorithm is developed to recover the convergence rate of the Crank-Nicolson scheme when the domain is not convex.
Error Estimates of the Crank-Nicolson FEM
Theorem 3.
Let be a quasi-uniform and shape-regular triangulation of , let , , let be the solution of Problem (2), and be the interpolation of the solution of Problem (33) using the Defect-Correction Algorithm 2 in a subdivision of the interval in sub-interval of size , such that , . Then for any ,
| (35) |
| (36) |
Proof.
But
where
is the interpolation of the
But one can use a similar method as the one in Theorem 2 to show that
Remark .
One can remark that if is chosen such that
then the optimal convergence of a linear Crank-Nicolson FEM is obtained, that is
5. conclusion
This paper presents a finite element method to solve the time-dependent Maxwell’s equations on non-convex polygonal domains. The nodal FEM is coupled with a Fourier decomposition that extracts the singular behavior of the solution and recovers the optimal linear convergence. The extension to polygonal domains with multiple re-entrant corners can be handled by the method through the use of local cut-off functions near the corners and adding the different singular parts to the final solution. However, the method assumes that the solution is sufficiently regular in time, and the initial data are also sufficiently smooth, so time-singularities and singularities due to the smoothness of the initial data or the change of boundary conditions are not handled by the method.
References
- [1] S.C. Brenner and L.R. Scott, The Mathematical Theory of Finite Element Methods, Springer Science+Business Media, New York (2008). dx.doi.org/10.1007/978-1-4757-4338-8
- [2] S.C. Brenner and L-Y. Sung, Multigrid method for the computation of singular solutions and stress intensity factors II: crack singularities, BIT Numerical Mathematics, 37 (1997) no. 3, pp. 623–643. http://dx.doi.org/10.1007/bf02510243
- [3] P. Ciarlet, The Finite Element Method for Elliptic Problems, Society for Industrial and Applied Mathematics, Amsterdam (2002). http://dx.doi.org/10.1137/1.9780898719208
- [4] P. Ciarlet, Augmented formulations for solving Maxwell equations, Computer Methods in Applied Mechanics and Engineering, 194 (1982) no. 2-5, http://dx.doi.org/10.1016/j.cma.2004.05.021 pp. 559-586.
- [5] M. Costabel and M. Dauge, Singularities of electromagnetic fields in polyhedral domains, Archives of Rational Mechanics and Analysis, 151 (2000) no. 3, pp. 221-276. http://dx.doi.org/10.1007/s002050050197
- [6] M. Costabel, M. Dauge and S. Nicaise, Singularities of Maxwell interface problems, Mathematical Modelling and Numerical Analysis, 33 (1982) no. 3, pp. 627-649. http://dx.doi.org/10.1051/m2an:1999155
- [7] M. Dauge, Elliptic Boundary Value Problems on Corner Domains: Smoothness and Asymptotics of Solutions, Lecture Notes in Mathematics, Springer-Verlag, Berlin (1988). http://dx.doi.org/10.1137/0719025
- [8] P. Grisvard, Singularities in Boundary Value Problems, Recherches en mathématiques appliquées, Masson (1992). ://dx.doi.org/10.1007/978-3-0348-8625-3_8
- [9] B. Nkemzi, On the solution of Maxwell’s equations in polygonal domains, Mathematical Methods in Applied Science, 29 (2006) no. 9, pp. 1053-1080. http://dx.doi.org/10.1137/0719025
- [10] B. Nkemzi, On singularities of solution of Maxwell’s equations in axisymmetric domains with conical points, Mathematical Methods in Applied Science, 30 (2007) no. 8, pp. 877-888. http://dx.doi.org/10.1137/0719025
- [11] B. Nkemzi, On the Coefficients of the Singularities of the Solution of Maxwell’s Equations near Polyhedral Edges, Mathematical Problems in Engineering, 2016 (2016), pp. 1–17. http://dx.doi.org/10.1155/2016/7965642
- [12] B. Nkemzi and J. Nkeck, A predictor-corrector finite element method for Maxwell’s equations in polygonal domains, Mathematical Problems in Engineering, 2020 (2020), pp. 1–13. http://dx.doi.org/10.1007/s11075-025-02243-1
- [13] M. Costabel, and M. Dauge, Weighted regularization of Maxwell equations in polyhedral domains. A rehabilitation of Nodal finite elements, Numerische Mathematik, 93 (2002) no. 2, pp. 239–277. http://dx.doi.org/10.1007/s002110100388
- [14] M. Costabel, A coercive bilinear form for Maxwell’s equations, Journal of Mathematical Analysis and Applications, 157 (1991) no. 2, pp. 527-541. http://dx.doi.org/10.1016/0022-247x(91)90104-8
- [15] C. Hazard and M. Lenoir, On the solution of time-harmonic scattering problems for Maxwell’s equations, SIAM Journal of Mathematical Analysis, 27 (1996) no. 6, pp. 1597-1630. http://dx.doi.org/10.1137/s0036141094271259
- [16] A.S. Bonnet-Ben Dhia, C. Hazard and S. Lorenghel, A Singular Field Method for the Solution of Maxwell’s Equations in Polyhedral Domains, SIAM Journal of Applied Mathematics, 59 (1999) no. 6, pp. 2028-2044.
- [17] C. Hazard and S. Lorenghel, A Singular field method for the solution of Maxwell’s equations: numerical aspects for 2D magnetostatics, SIAM Journal of Applied Mathematics, 40 (2002) no. 3, pp. 1021-1040 http://dx.doi.org/10.1137/0719025
- [18] E. Jamelot, Elements finis nodaux pour les Equations de Maxwell, Comptes Rendus de l’Académie des Sciences de Paris, 339 (2004) no. 11, pp. 809-814. http://dx.doi.org/10.1016/j.crma.2004.10.020
- [19] A. Bonito, J. Guermond and F. Luddens, An Interior Penalty Method with C0Finite Elements for the Approximation of the Maxwell Equations in Heterogeneous Media: Convergence Analysis with Minimal Regularity, ESAIM: Mathematical Modelling and Numerical Analysis, 50 (2016) no. 5, pp. 1457-1489. http://dx.doi.org/10.1051/m2an/2015086
- [20] A. Buffa, C. Ciarlet Jr and E. Jamelot, Solving electromagnetic eigenvalue problems in polyhedral domains with nodal finite elements, Numerische Mathematik, 113 (2009) no. 4, pp. 497-518. http://dx.doi.org/10.1137/0719025
- [21] R. Otin, Regularized Maxwell equations and nodal finite elements for electromagnetic field computations in frequency domain, Universitat Politcnica de Catalunya (2011). http://dx.doi.org/10.5821/dissertation-2117-94786
- [22] R. Otin, Regularized Maxwell Equations and Nodal Finite Elements for Electromagnetic Field Computations, SIAM J. Numer. Anal., 30 (2010) no. 1-2, pp. 190-204. https://doi.org/10.1080/02726340903485489
- [23] R. Codina, A stabilized finite element method for generalized stationary incompressible flows, Computer Methods in Applied Mechanics and Engineering, 190 (2001) no. 20-21, pp. 2681-2706. http://dx.doi.org/10.1016/s0045-7825(00)00260-7
- [24] R. Codina, Analysis of a stabilized finite element approximation of the Oseen equations using orthogonal subscales, Applied Numerical Mathematics, 58 (2008) no. 3, pp. 264–283. https://doi.org/10.1016/j.apnum.2006.11.011
- [25] R. Codina and S. Badia, A nodal-based finite element approximation of the Maxwell problem suitable for singular solutions, SIAM J. Numer. Anal., 50 (2012) no. 2, pp. 398–417. http://dx.doi.org/10.1137/110835360
- [26] H.P. Duan, P. Lin, P. Saikrisman and R.C.E. Tan, A least-squares finite element method for the magnetostatic problem in a multiply connected Lipschitz domain, SIAM Journal on Numerical Analysis, 45 (2007) no. 6, pp. 2537-2563. http://dx.doi.org/10.1137/050640102
- [27] H.P. Duan, F. Jia, P. Lin and R.C.E. Tan, The local -projected finite element method for Maxwell Problem, SIAM Journal on Numerical Analysis, 47 (2009) no. 2, pp. 1274-1303. http://dx.doi.org/10.1137/070707749
- [28] A. Bonito and J. Guermond, Approximation of the eigenvalue problem for the time-harmonic Maxwell system by continuous Lagrange, IEEE Transactions on Magnetics, 80 (2011) no. 276, pp. 1887-1910.
- [29] J.L. Nkeck, A Full Predictor-Corrector Finite Element Method for the One-Dimensional Heat Equation with Time-Dependent Singularities, Journal of Applied Mathematics and Physics, 12 (2024) no. 4, pp. 1364-1382.
- [30] B. Nkemzi and J. Nkeck, A predictor-corrector finite element method for parabolic problems on polygonal domains, Numerical Algorithms (2025) (in press).
- [31] J-L. Lions and E. Magenes, Non-Homogeneous Boundary Value Problems and Applications, Springer Berlin Heidelberg (1972). http://dx.doi.org/10.1007/978-3-642-65217-2
- [32] G. Baker, Error Estimates for Finite Element Methods for Second Order Hyperbolic Equations, SIAM J. Numer. Anal., 13 (1976) no. 4, pp. 564-576. http://dx.doi.org/10.1137/0713048









