Next Article in Journal
An Adaptive Barrier Function Terminal Sliding Mode Controller for Partial Seizure Disease Based on the Pinsky–Rinzel Mathematical Model
Previous Article in Journal
Deep Learning for Vessel Trajectory Prediction Using Clustered AIS Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fast High-Order Algorithms for Electromagnetic Scattering Problem from Finite Array of Cavities in TE Case with High Wave Numbers

1
Department of Mathematics and Physics, North China Electric Power University, Baoding 071000, China
2
School of Mathematics, Shandong University, Jinan 250100, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2022, 10(16), 2937; https://doi.org/10.3390/math10162937
Submission received: 18 July 2022 / Revised: 9 August 2022 / Accepted: 10 August 2022 / Published: 15 August 2022

Abstract

:
In this paper, fast high-order finite difference algorithms for solving the electromagnetic scattering from the finite array of two-dimensional rectangular cavities are proposed in TE polarization. The scattering problem from the cavity array is described as coupled Helmholtz equations with transparent boundary conditions on open apertures. Second-order and fourth-order schemes for solving the coupled systems are developed in TE polarization respectively. A special technique is applied to construct a fourth-order scheme for transparent boundary conditions. Further, we propose fast algorithms which can simplify the larger global system to a small linear interface system on the apertures of cavities. Numerical experiments show the validity and efficiency of the proposed fast algorithms for solving the scattering problem with high wave numbers.

1. Introduction

Electromagnetic scattering from the finite array of large cavities has attracted much attention in industry and the military. The cavity structures are very common, such as jet engine inlet ducts, exhaust nozzles, and cavity-backed antennas. The radar cross section (RCS) is one of the physical parameters of interest, which measures the detectability of a target by a radar system. The accurate prediction of the RCS of the cavities is significant due to its dominance of the overall RCS of the targets.
Numerous works have been devoted to solving the scattering problems from cavities, such as the method of moment (MoM) [1,2], finite element-boundary integral (FE-BI) method [3,4,5,6,7,8], the finite difference method (FDM) [9,10,11,12,13,14], and other methods [15,16,17,18,19,20,21,22,23,24]. The cavity scattering problems arouse a wide discussion in computational mathematics. Ammari et al. [25,26] gave the result of the existence and uniqueness of the solution to the cavity scattering problem. More mathematical analysis for the cavity scattering problem can be found in [10,25,27].
Most of the studies above were used to solve the electromagnetic scattering from the single cavity model, which limits the practical applications of the model problem in industry and the military. More recently, the finite array of cavity scattering problem was examined in [8,28,29]. Alavikia and Ramahi [8] presented a hybrid finite element boundary integral algorithm to solve the problem of scattering from a finite array of cavities. Li and Wood [28] applied the finite element method to solve the electromagnetic scattering from multiple cavities. Wu and Zheng [29] proposed a perfectly matched layer (PML) method for solving the electromagnetic scattering from multiple cavities. Unfortunately, when the wave number k 0 is high, or the size of the cavity is large compared to the wavelength of the incident wave, the scale of the system will become larger, the computational cost will increase, and the condition number of the matrix will become worse. This has been a crucial topic in the scattering problem for large cavities. A straightforward change of coordinates yields the equivalence of high wave numbers and large cavity problems. For the electromagnetic scattering with high wave numbers, Bao and Sun [10] proposed a fast algorithm for solving the electromagnetic scattering from a large rectangular open cavity in TM polarization.
This paper mainly focuses on the scattering from a finite array of two-dimensional rectangular cavities in TE polarization. In the existing literature or research, the electromagnetic scattering problems in TM polarization have been studied in detail while those in the TE case are seldom discussed. In the TE case, the electric field is perpendicular to the invariant direction. The main difficulty of the scattering from the array of cavities is the complex interaction boundary conditions. In this paper, firstly, by introducing a new transparent boundary condition on the cavity apertures, the finite array of cavity scattering problem is reduced to a boundary value problem of the two-dimensional Helmholtz equation. Considering the boundary coupling of the finite array of cavities, we make extensions of the total field on the apertures. We develop the compact second and fourth-order finite difference schemes respectively to discretize the reduced Helmholtz equation in TE polarization. Moreover, the Neumann boundary condition on the boundaries and the transparent boundary conditions on the apertures need a special approximation. In particular, in order to deal with the problem with high wave numbers, we introduce the discrete Fourier transformation in the horizontal (x-axis) and a Gaussian elimination in the vertical direction (y-axis) on Cartesian coordinates, which can simplify the cavity scattering problem to a small aperture system. Thus the cost of calculating the radar cross section is O ( N M log ( n M ) ) with M × N meshes in each cavity, where n is the number of separate cavities.
The rest of the paper is organized as follows. In Section 2, we illustrate the model problem for the scattering from a single cavity in TE polarization. In Section 3, the compact second-order and fourth-order finite difference schemes are applied to discretize the magnetic field equation in TE polarization. In Section 4, we propose a fast algorithm for the electromagnetic scattering from the finite array of cavities with high wave numbers in TE polarization. Numerical results demonstrate the accuracy and efficiency of the proposed method in Section 5.

2. The Single Cavity Scattering Problem in TE Polarization

We consider an electromagnetic plane wave on a cavity embedded in an infinite ground plane. The total electric field and the magnetic field, denoted by E and H separately, satisfy the following time-harmonic Maxwell’s equations
× E = i ω B , × H = i ω D ,
and the constitutive relationship
D = ε 0 ε r E , B = μ 0 μ r H ,
where ε 0 = 8.85 × 10 12 Fm 1 , μ 0 = 4 π × 10 7 Hm 1 , ε r ,   μ r are the relative electric permittivity and magnetic permeability, and i = 1 and ω is the angular frequency.
For the electromagnetic scattering problem in TE polarization, the electric field is transverse to the z-axis. The magnetic field H is in the form of H = ( 0 , 0 , H z ) . For ease of notation, we denote H z by u. Let the incident field take the form of u i = e i ( α x + β y ) , the scattered magnetic field can be expressed by
u s = u u i u r ,
where u r = e i ( α x β y ) , α = k 0 sin θ ,   β = k 0 cos θ , π 2 < θ < π 2 is the angle of the incidence, k 0 is the wave number in free space.
We consider the cavity filled with a homogeneous medium. The geometry of the cavity is shown in Figure 1. We assume the ground plane Γ c and the wall S of the cavity are perfect electric conductors (PEC). Denote the upper half space as R + 2 = { ( x , y ) R 2 , y > 0 } . There exists a homogeneous medium of ε 0 and μ 0 in R + 2 . Therefore, the total magnetic field in the z-axis satisfies the following equations
1 ε r Δ u + k 0 2 μ r u = 0 , in Ω R + 2 , 1 ε r u n = 0 , on ( Ω \ Γ ) Γ c ,
Together with the Sommerfeld radiation boundary condition
lim r r u s r i k 0 u s = 0 ,
where ε r = μ r = 1 in R + 2 .
According to Equations (1)–(3), the scattered field u s satisfies
Δ u s + k 0 2 u s = 0 , ( x , y ) R + 2 ,
u s n = 0 , on Γ c ,
u s n = u n , on Γ .
In order to convert the problem (2) and (3) into the bounded domain, we adopt the upper half-space Neumann Green function for the Helmholtz equation
G N x , x = i 4 H 0 ( 1 ) k 0 r + H 0 ( 1 ) k 0 r ¯ ,
where x = ( x , y ) , x = x , y , r = x x , r ¯ = x x ¯ , x ¯ = x , y and H 0 ( 1 ) is the 0-th Hankel function of the first kind.
Green’s function (7) satisfies the following equations
Δ G N + k 0 2 μ r G N = δ ( x , x ) , x , x R + 2 ,
G N n = 0 , y = 0
and the Sommerfeld radiation condition
lim r r G N r i k 0 G N = 0 ,
where δ is the Dirac delta function.
Multiplying G N on Equation (4) and u s on Equation (8), we can derive an equation for G N and u s
Ω r + G N Δ u s u s Δ G N d Ω = Ω r + u s δ ( x , x ) d Ω .
According to the property of δ —function and Green’s formulation, we have
u s ( x ) = Γ G N x , x u s x n x u s x G N x , x n x d s ( x ) .
A detailed derivation is available in [3].
In terms of Equations (5) and (9), the above equation can be written as
u s ( x ) = Γ G N x , x u s x n x y = 0 + d s ( x ) = Γ G N x , x u s x y y = 0 + d x .
Substituting Equations (1) and (7) into the above equation, we obtain
u ( x ) = 2 e i α x i 2 Γ H 0 ( 1 ) k 0 x x u x y d x ,
where H 0 ( 1 ) ( v ) = J 0 ( v ) + i Y 0 ( v ) . J 0 ( v ) , Y 0 ( v ) are Bessel functions of the first and second kinds of order 0 respectively.
Noting the continuity conditions on the aperture Γ
u ( x , y ) y = 0 + = u ( x , y ) y = 0 , u n y = 0 + = 1 ε r u n y = 0 ,
We can obtain the transparent boundary on Γ
u ( x ) = 2 e i α x i 2 Γ H 0 ( 1 ) k 0 x x 1 ε r u x y y = 0 d x .
Let g ( x ) = 2 e i α x , the transparent boundary condition on Γ in TE polarization can be simplified as
u = T 1 ε r u y + g ( x ) ,
where T 1 ε r u y = i 2 Γ H 0 ( 1 ) k 0 x x 1 ε r u x y y = 0 d x .
Hence, the electromagnetic scattering from the single cavity in TE polarization can be transformed into the following equations in a bounded domain [28].
· 1 ε r u + k 0 2 μ r u = 0 , in Ω , 1 ε r u n = 0 , on ( Ω \ Γ ) Γ c , u = T 1 ε r u n + g ( x ) , on Γ .
The existence and uniqueness of solutions of (14) for arbitrary wave numbers have been obtained in [26].

3. Fast High-Order Schemes for the Scattering from Single Cavity

3.1. Second-Order Finite Difference Scheme

Let { x i , y j } i , j = 0 M + 1 , N + 1 define a uniform partition on Ω = [ 0 , a ] × [ b , 0 ] with x i = i h x , i = 0 , 1 , , M + 1 , y j = b + j h y , j = 0 , 1 , , N + 1 , h x = a / ( M + 1 ) , h y = b / ( N + 1 ) . For simplicity, we consider the case of h x = h y = h . It can be generalized to the case of h x h y . Denote u i , j as the numerical solution at point ( x i , y j ) . The second-order finite difference approximation inside the cavity can be written as
1 ε r δ x 2 + δ y 2 u i , j + k 0 2 μ r u i , j = f i , j , i = 0 , 1 , , M + 1 , j = 0 , 1 , , N + 1 ,
where δ x 2 , δ y 2 are second-order finite difference operators.
Considering the second-order approximation for Neumann boundary condition on y = b
u i , 1 u i , 1 2 h = u n y = b + O ( h 2 ) .
Since u n = 0 , we have u i , 1 = u i , 1 , i = 0 , 1 , , M + 1 . The Neumann boundary conditions on the left and right boundaries can be handled analogously.
Denote all the unknowns by:
U = ( u 0 , 0 , u 0 , 1 , , u 0 , N , u 1 , 0 , u 1 , 1 , , u 1 , N , , u M + 1 , 0 , u M + 1 , 1 , , u M + 1 , N ) , u N + 1 = ( u 0 , N + 1 , u 1 , N + 1 , , u M + 1 , N + 1 ) .
Therefore, we can rewrite the second-order scheme (15) as the matrix form
1 ε r A x I N + 1 + I M + 2 A y + k 0 2 μ r I U + 1 ε r ( I M + 2 a N + 1 ) u : , N + 1 = F ,
where
A x = 1 h 2 2 2 1 2 1 1 2 1 2 2 , A y = 1 h 2 2 2 1 2 1 1 2 1 1 2 ,
a N + 1 = 1 h 2 ( 0 , , 0 , 1 ) T , F = f 0 , 0 , f 0 , 1 , , f 0 , N , f 1 , 0 , f 1 , 1 , , f 1 , N , , f M + 1 , 0 , f M + 1 , 1 , , f M + 1 , N T .
Here ⊗ is the Kronecker product. I M + 2 and I N + 1 are identity matrix in ( M + 2 ) × ( M + 2 ) dimension and ( N + 1 ) × ( N + 1 ) dimensions respectively, I is identity matrix in ( M + 2 ) ( N + 1 ) × ( M + 2 ) ( N + 1 ) dimensions.
Below we consider the approximations of the transparent boundary in (13). The nonlocal integral operator in (13) can be rewritten by
T u y = 1 2 Γ Y 0 k 0 x x u x y y = 0 d x i 2 Γ J 0 k 0 x x u x y y = 0 d x .
Since Y 0 ( v ) 2 π ln v 2 as v 0 , the first part of Equation (17) contains the weakly singular integral.
We adopt a piecewise linear approximation for the first item and a trapezoidal formulation for the second item of Equation (17). So the nonlocal integral operator T ( z ) can be approximated as follows
T ( z ) j = 1 M T i j z j ,
where
T i j = T i j re + i T i j im , T i j re = 1 2 Γ Y 0 k 0 x i x j ϕ j 1 x d x , T i j im = h 2 J 0 k 0 x i x j ,
and ϕ j 1 x are the piecewise linear basis functions.
The second-order approximation for (13) is given as
u : , N + 1 = T 1 ε r u : , N + 2 u : , N 2 h + g ( x : , N + 1 ) .
Moreover, u : , N + 1 satisfies the second-order scheme (15)
1 ε r δ x 2 + δ y 2 u i , N + 1 + k 0 2 u i , N + 1 = f i , N + 1 , i = 0 , 1 , , M + 1 .
Rewrite (19) into matrix form [10].
1 ε r A x 2 h 2 I M + 2 + k 0 2 u : , N + 1 + 1 ε r h 2 u : , N + 1 ε r h 2 u : , N + 2 = F : , N + 1 .
Combining (18) and (20), we have
2 T u : , N + ( 2 h ε r I M + 2 + T J 2 1 J 1 ) u : , N + 1 = T J 2 1 F : , N + 1 + 2 h ε r g ,
where J 1 = 1 ε r A x 2 h 2 I M + 2 + k 0 2 I M + 2 , J 2 = 1 ε r h 2 I M + 2 .
Then we derive the reduced linear system
A 11 A 12 A 21 A 22 U u : , N + 1 = F F Γ ,
where
A 11 = 1 ε r A x I N + 1 + I M + 2 A y + k 0 2 μ r I , A 12 = 1 ε r ( I M + 2 a N + 1 ) , A 21 = 2 T a N + 1 T , A 22 = 2 h ε r I M + 2 + T J 2 1 J 1 , F Γ = T J 2 1 F : , N + 1 + 2 h ε r g .

3.2. The Fast Second-Order Algorithm for the Scattering from the Single Cavity

For the matrix A x , we have
C x 1 A x C x = Λ = diag ( λ 1 , λ 2 , , λ M + 2 ) ,
where C x is the discrete cosine transformation matrix,
( C x ) i j = cos π i j M + 1 , λ i = 2 cos i π M + 1 2 , i , j = 0 , 1 , 2 , , M + 1 .
Multiplying C x 1 I N + 1 on both sides of Equation (16), we have
1 ε r Λ I N + 1 + I M + 2 A y U ¯ + k 0 2 μ r U ¯ + 1 ε r ( I M + 2 a N + 1 ) u ¯ : , N + 1 = F ¯ ,
where
U ¯ = ( C x 1 I N + 1 ) u = ( u ¯ 0 , 0 , u ¯ 0 , 1 , , u ¯ 0 , N , u ¯ 1 , 0 , u ¯ 1 , 1 , , u ¯ 1 , N , , u ¯ M + 1 , 0 , u ¯ M + 1 , 1 , , u ¯ M + 1 , N ) T , F ¯ = ( C x 1 I N + 1 ) F = f ¯ 0 , 0 , f ¯ 0 , 1 , , f ¯ 0 , N , f ¯ 10 , f ¯ 11 , , f ¯ 1 N , , f ¯ M + 1 , 0 , f ¯ M + 1 , 1 , , f ¯ M + 1 , N T . u ¯ : , N + 1 = C x 1 u : , N + 1 = u ¯ 0 , N + 1 , u ¯ 1 , N + 1 , , u ¯ M + 1 , N + 1 T ,
Moreover, Equation (22) can be written as M + 2 systems
1 ε r ( λ i I N + 1 + A y ) + k 0 2 μ r I N + 1 U ¯ i , : + 1 ε r a N + 1 u ¯ i , N + 1 = F ¯ i , : , i = 0 , 1 , , M + 1 ,
where
U ¯ i , : = ( u ¯ i , 0 , u ¯ i , 1 , , u ¯ i , N ) T , F ¯ i , : = ( f ¯ i , 0 , f ¯ i , 1 , , f ¯ i , N ) T .
As can be seen from Equation (23), 1 ε r ( λ i I N + 1 + A y ) + k 0 2 μ r I N + 1 is a tridiagonal matrix. For small enough h, we can derive the L U decomposition
1 ε r ( λ i I N + 1 + A y ) + k 0 2 μ r I N + 1 = L i U i , i = 0 , 1 , 2 , , M + 1 .
Multiplying L i 1 on both sides of Equation (23), we have
U i U ¯ i , : + 1 ε r L i 1 a N + 1 u ¯ i , N + 1 = L i 1 F ¯ i , : .
Extracting the last elements from the above systems, we can obtain
p i u ¯ i , N + q i U ¯ i , N + 1 = f ˜ i , N , i = 0 , 1 , , M + 1 ,
where p i and q i are the last elements of U i and L i 1 a N + 1 / ε r respectively, and f ˜ i , N is the last element of L i 1 F ¯ i , : .
For i = 0 , 1 , , M + 1 , we have
P u ¯ : , N + Q u ¯ : , N + 1 = F ˜ ,
where P = diag ( p 1 , p 2 , , p M + 2 ) , Q = diag ( q 1 , q 2 , , q M + 2 ) and F ˜ = ( f ˜ 0 , N , f ˜ 1 , N , , f ˜ M + 1 , N ) T .
Combining with Equation (21), we can derive the reduced formulation only with the unknowns on the aperture
2 h ε r C x + T C x J 2 1 J 1 2 T C x P 1 Q u ¯ : , N + 1 = 2 h ε r g + T C x J 2 1 F ¯ : , N + 1 2 T C x P 1 F ˜ .
We analyze the computational cost of Algorithm 1. The matrix T is calculated by using the traditional trapezoidal formula, and the cost of Step (i) is O ( M + 2 ) . In Step (ii), we need to calculate the L U -decomposition for ( λ i I N + 1 + A y ) / ε r + k 0 2 I N + 1 . Noting the tridiagonal structure of these matrices, we only need O ( ( M + 2 ) ( N + 1 ) ) operations if f 0 . The cost of calculating the product of the matrix C x and a complex vector is O ( ( M + 2 ) 2 ( N + 1 ) ) in Step (iii). In Step (iv), we use the BiCG method for solving the linear systems (24). Each iteration only needs to calculate one matrix-vector multiplication, and the cost of each iteration is O ( 24 p ( M + 2 ) log ( M + 2 ) ) , p is the number of iterations.
Algorithm 1: The procedure of the second-order fast algorithm for scattering from the single cavity (The Fast Algorithm for the Scattering Problem From the Single Cavity).
Step (i)
Generate the matrix T.
Step (ii)
Calculate the L U decomposition to get P and Q by using the forward Gaussian elimination with a row partial pivoting.
Step (iii)
Calculate C x F .
Step (iv)
Solve the system (24) for u ¯ : , N + 1 .
Step (v)
Solve the system (22) for rest of the unknowns.

3.3. Fourth-Order Finite Difference Scheme

The fourth-order compact finite difference scheme can be written as
1 ε r + k 2 h 2 12 δ x 2 + δ y 2 u i , j + h 2 6 1 ε r δ x 2 δ y 2 u i , j + k 0 2 u i , j = f i , j + h 2 12 Δ f i , j , i = 0 , 1 , , M + 1 , j = 0 , 1 , , N + 1 .
E i , j is the leading truncation error and is given by
E i , j = k 2 144 u x 4 + u y 4 i , j + 1 360 ε r u x 6 + u y 6 i , j + 1 72 ε r u x 4 y 2 + u x 2 y 4 i , j h 4 1 144 f x 4 + f y 4 i , j h 4 .
Otherwise, Equation (25) can be written as
c 2 u i 1 , j 1 + c 1 u i 1 , j + c 2 u i 1 , j + 1 + c 1 u i , j 1 + c 0 u i , j + c 1 u i , j + 1 + c 2 u i + 1 , j 1 + c 1 u i + 1 , j + c 2 u i + 1 , j + 1 = F i , j ,
where c 0 = 2 k 2 h 2 3 10 3 ε r , c 1 = k 2 h 2 12 + 2 3 ε r , c 2 = 1 6 ε r , F i , j = h 2 f i , j + h 4 12 Δ f i , j .
Next, we consider the Neumann boundary condition on the boundary S. By Taylor’s expansion, we can obtain the fourth-order approximation for u n = 0 on y = b
u y y = b = u i , 1 u i , 1 2 h h 2 6 u y y y i , 0 + O h 4 .
Since u y y = b = 0 and u y y y = ε r f y k 2 ε r u y u x x y , we have
1 ε r + h 2 k 2 6 + h 2 6 ε r δ x 2 u i , 1 h 2 k 2 6 ε r + h 2 6 ε r δ x 2 u i , 1 = h 3 3 ( f y ) i , 0 , i = 0 , 1 , , M + 1 .
Moreover, Equation (25) can be written as
1 ε r + k 2 h 2 12 + h 2 6 ε r δ x 2 u i , j + 1 + 1 ε r + k 2 h 2 12 h 2 δ x 2 2 h 2 3 ε r δ x 2 + k 2 h 2 u i , j + 1 ε r + k 2 h 2 12 + h 2 6 ε r δ x 2 u i , j 1 = h 2 f i , j + h 4 12 Δ f i , j , i = 0 , 1 , , M + 1 , j = 0 , 1 , , N + 1 .
Let j = 0 , we have
1 ε r + k 0 2 h 2 12 + h 2 6 ε r δ x 2 u i , 1 + 1 ε r + k 0 2 h 2 12 h 2 δ x 2 2 h 2 3 ε r δ x 2 + k 0 2 h 2 u i , 0 + 1 ε r + k 0 2 h 2 12 + h 2 6 ε r δ x 2 u i , 1 = h 2 f i , j + h 4 12 Δ f i , j , i = 0 , 1 , , M + 1 .
Combining Equations (27) and (28), we have
2 1 ε r + k 0 2 h 2 12 + h 2 6 ε r δ x 2 u i , 1 + 1 ε r + k 0 2 h 2 12 h 2 δ x 2 2 h 2 3 ε r δ x 2 + k 0 2 h 2 u i , 0 = h 2 f i , 0 + h 3 3 ( f y ) i , 0 + h 4 12 Δ f i , 0 , i = 0 , 1 , , M + 1 .
Similarly, we can derive the fourth-order approximation of the Neumann boundary condition on the other side of the boundaries. Therefore, the compact fourth-order scheme can be written as the following matrix form
1 ε r + k 2 h 2 12 A x I N + 1 + I M + 2 A y + h 2 6 ε r A x A y + k 2 I U 1 + 1 ε r + k 2 h 2 12 I M + 2 a N + 1 + h 2 6 ε r A x a N + 1 u : , N + 1 = F 1 + h 2 12 Δ F 1 + 1 12 I M + 2 b N + 1 f : , 0 + 1 12 b N + 1 I M + 2 f 0 , : + 1 12 a N + 1 I M + 2 f M + 1 , : ,
where
F 1 = f 0 , 0 , f 0 , 1 , , f 0 , N , f 1 , 0 , f 1 , 1 , , f 1 , N , , f M + 1 , 0 , f M + 1 , 1 , , f M + 1 , N T ,
U 1 = ( u 0 , 0 , u 0 , 1 , , u 0 , N , u 1 , 0 , u 1 , 1 , , u 1 , N , , u M + 1 , 0 , u M + 1 , 1 , , u M + 1 , N ) ,
b N + 1 = 1 h 2 ( 1 , 0 , , 0 ) T .
Below we need to deal with the transparent boundary condition on the aperture in particular. Firstly, By means of Taylor’s expansion, we have
u y = u i , N + 2 u i , N 2 h h 2 6 ε r f y k 2 ε r u y u x x y i , N + 1 + O ( h 4 ) , i = 0 , 1 , , M + 1 .
Then in order to eliminate the ghost points, we introduce the variable ν
u y = u i , N + 2 u i , N 2 h + ν h 2 u x x y + O ( h 2 ) = ( 1 2 ν ) ( u i , N + 2 u i , N ) 2 h + ν ( u i + 1 , N + 2 + u i 1 , N + 2 u i + 1 , N u i 1 , N ) 2 h .
Therefore, we have
u y = u i , N + 2 u i , N 2 h h 2 6 ε r f y i , N + 1 + 1 6 ( u i + 1 , N + 2 2 u i , N + 2 + u i 1 , N + 2 ) ( u i + 1 , N 2 u i , N + u i 1 , N ) 2 h + ε r k 2 h 2 6 ( 1 2 ν ) ( u i , N + 2 u i , N ) 2 h + ν ( u i + 1 , N + 2 + u i 1 , N + 2 u i + 1 , N u i 1 , N ) 2 h .
Combing with the transparent boundary condition (13), we have
l = 1 M + 2 ϑ i , l u l , N + 1 g ^ i + h 3 3 f y i , N + 1 = 2 3 ε r + k 2 h 2 6 ( 1 2 ν ) ( u i , N + 2 u i , N ) + 1 6 ε r + ν k 2 h 2 6 ( u i + 1 , N + 2 + u i 1 , N + 2 ) 1 6 ε r + ν k 2 h 2 6 ( u i + 1 , N + u i 1 , N ) ,
where ϑ i , l = 2 h T i , l 1 , g ^ i = 2 h l = 1 M + 2 T i , l 1 g .
Take j = N + 1 for the fourth-order scheme (25), we have
c 1 ( u i , N + 2 + u i , N ) + c 2 ( u i + 1 , N + 2 + u i 1 , N + 2 + u i + 1 , N + u i 1 , N ) + c 1 ( u i + 1 , N + 1 + u i 1 , N 1 ) + c 0 u i , N + 1 = h 2 f : , N + 1 + h 4 12 Δ f : , N + 1 .
Moreover, Equation (30) can be written as
c ˜ 1 ( u i , N + 2 u i , N ) + c ˜ 2 ( u i + 1 , N + 2 + u i 1 , N + 2 u i + 1 , N u i 1 , N ) l = 1 M + 2 ϑ i , l u l , N + 1 = h 3 3 f y i , N + 1 g ^ i ,
where c ˜ 1 = 2 3 ε r + k 2 h 2 6 ( 1 2 ν ) , c ˜ 2 = 1 6 ε r + ν k 2 h 2 6 .
To eliminate u i , N + 2 , u i 1 , N + 2 , u i + 1 , N + 2 , we define a constant η such that
η = c 1 c ˜ 1 = c 2 c ˜ 2 .
We have computed ν k 2 h 2 = 4 ε r + k 2 h 2 c 2 1 ε r c 1 c 1 + 2 c 2 , hence
c ˜ 1 = 1 ε r + k 2 h 2 6 c 1 c 1 + 2 c 2 , c ˜ 2 = c 2 c 1 c ˜ 1 , η = 1 ε r + k 2 h 2 6 1 ( c 1 + 2 c 2 ) .
Therefore, combing Equations (26) and (32), the reduced equation can be written as
η l = 1 M + 2 ϑ i , l u l , N + 1 + 2 c 1 u i , N + 2 c 2 ( u i + 1 , N + u i 1 , N ) + c 1 ( u i + 1 , N + 1 + u i 1 , N + 1 ) + c 0 u i , N + 1 = h 2 f : , N + 1 + h 4 12 Δ f : , N + 1 + η g ^ i η h 3 3 f y i , N + 1 .
Denote
L 1 = 1 ε r + k 2 h 2 12 I M + 2 + h 2 6 ε r A x , L 2 = 1 ε r + k 2 h 2 12 h 2 A x 2 I M + 2 h 2 3 ε r A x + k 2 h 2 I M + 2 .
The above equation can be written in matrix form
2 T L 1 u : , N + 2 h η I M + 2 + T L 2 u : , N + 1 = 2 h η g + T h 2 F : , N + 1 + h 4 12 Δ F : , N + 1 η h 3 3 ( f y ) : , N + 1
Then we derive the reduced linear system
A 11 A 12 A 21 A 22 U u : , N + 1 = F F Γ ,
where
A 11 = 1 ε r + k 2 h 2 12 A x I N + I M A y + h 2 6 1 ε r A x A y + k 2 I , A 12 = 1 ε r + k 2 h 2 12 I M a N + 1 + h 2 6 1 ε r A x a N + 1 , A 21 = 2 T L 1 a N + 1 T , A 22 = 2 h I M + 2 + T L 2 , F = F 1 + h 2 12 Δ F + h 3 I ˜ M + 2 b N + 1 ( f y ) : , 0 + h 3 b N + 1 I M + 2 ( f x ) 0 , : + h 3 a N + 1 I M + 2 ( f x ) M + 1 , : , F Γ = 2 h η g + T h 2 F : , N + 1 + h 4 12 Δ F : , N + 1 η h 3 3 ( f y ) : , N + 1 , I ˜ M + 2 = diag ( 0 , 1 , , 1 , 0 ) .

3.4. The Fast Fourth-Order Algorithm for the Scattering from the Single Cavity

Multiple C x 1 I N + 1 on both side of (29), we have
1 ε r + k 2 h 2 12 Λ I N + 1 + I M + 2 A y + h 2 6 ε r Λ A y + k 2 I U ¯ 1 + 1 ε r + k 2 h 2 12 I M + 2 a N + 1 + h 2 6 ε r A x a N + 1 u ¯ : , N + 1 = F ¯ ,
where
F ¯ = C x 1 I N + 1 F 1 + h 2 12 Δ F 1 + 1 12 I M + 2 b N + 1 f : , 0 + 1 12 b N + 1 I M + 2 f 0 , : + C x 1 I N + 1 1 12 a N + 1 I M + 2 f M + 1 , : .
Therefore, we have M + 2 linear systems which are written as
1 ε r + k 2 h 2 12 λ i I N + 1 + A y + h 2 6 ε r λ i A y + k 0 2 I N + 1 u ¯ i , : + 1 ε r + k 2 h 2 12 + h 2 6 ε r λ i a N + 1 u ¯ i , N + 1 = F ¯ i , : .
Let 1 ε r + k 2 h 2 12 λ i I N + 1 + A y + h 2 6 ε r λ i A y + k 0 2 I N + 1 = L i U i be the LU-decomposition, for enough small h, we have
U i u ¯ i , : + L i 1 1 ε r + k 2 h 2 12 + h 2 6 ε r λ i a N + 1 u ¯ i , N + 1 = L i 1 F ¯ i , : .
Take the last element of the above equation, we have the following relationship between u N and u N + 1
u ¯ : , N = P 1 Q u ¯ : , N + 1 + P 1 L i 1 F ¯ : , N ,
where P = diag ( p 1 , p 2 , , p M + 2 ) , Q = diag ( q 1 , q 2 , , q M + 2 ) , p i is the last entry of U i , and q i is the last element of L i 1 1 ε r + k 2 h 2 12 + h 2 6 1 ε r λ i a N + 1 .
Otherwise, multiplying C x 1 on both sides of Equation (33), we have
2 T L 1 C x u ¯ : , N + 2 h η I M + 2 + T L 2 C x u ¯ : , N + 1 = 2 h η g + T h 2 F : , N + 1 + h 4 12 Δ F : , N + 1 η h 3 3 ( f y ) : , N + 1 .
Combing (35) and (36), it follows
2 h η C x + T L 2 C x 2 T L 1 C x P 1 Q u ¯ : , N + 1 = 2 h η g + T h 2 F : , N + 1 + h 4 12 Δ F : , N + 1 η h 3 3 ( f y ) : , N + 1 2 T C x L i 1 P 1 F ¯ : , N .

4. Fast High-Order Schemes for the Scattering from Finite Array of Cavities

In this section, we present fast algorithms to solve the electromagnetic scattering from the finite array of large cavities in the TE case. Consider the electromagnetic scattering from the finite array of large cavities Ω 1 , Ω 2 , , Ω n embedded in an infinite ground plane. The geometry of the finite array of large cavities is shown in Figure 2. Assume the walls S l , l = 1 , 2 , , n of the cavities and the ground plane Γ c are perfect electric conductors. Γ l is the aperture of the cavity Ω l separately. The half-space above the ground plane is filled with a homogeneous medium characterized by its dielectric permittivity ε 0 and magnetic permeability μ 0 . The interior of the finite array of large cavities is filled with the nonmagnetic material with the relative dielectric permittivity ε r ( l ) respectively.
For the TE polarization case, Maxwell equations are reduced to the Helmholtz equations with Neumann boundary conditions. To reduce the scattering problem into bounded domain Ω l , l = 1 , 2 , , n , we need to obtain the boundary conditions on Γ l . Rewrite the Helmholtz equation as
1 ε r ( l ) Δ u ( l ) + k 0 2 u ( l ) = 0 , in Ω l , 1 ε r ( l ) u ( l ) n = 0 , on S l Γ c .
Based on Equation (14), it follows that
u = T 1 ε r u n + g ( x ) , on l = 1 n Γ j .
Extend u ( l ) n to the whole x-axis by
u ˜ ( l ) n = u ( l ) n , x Γ l , 0 , x R \ Γ l .
For the total magnetic field u n , we have its x-axis extension
u ˜ n = u ( l ) n , x Γ l , 0 , x Γ c .
We have the following relationship
u ˜ = u ˜ ( 1 ) + u ˜ ( 2 ) + + u ˜ ( l ) + g ( l ) , on Γ Γ c ,
where g ( l ) = 2 e i α x ( l ) . The transparent boundary condition (39) can be rewritten as
u ˜ = T 1 ε r ( 1 ) u ˜ ( 1 ) n + T 1 ε r ( 2 ) u ˜ ( 2 ) n + + T 1 ε r ( n ) u ˜ ( n ) n + g ( l ) .
Therefore, the electromagnetic scattering from the finite array of large cavities in the TE polarization can be described as follows,
1 ε r ( l ) Δ u ( l ) + k 0 2 u ( l ) = 0 , in Ω l , 1 ε r ( l ) u ( l ) n = 0 , on S l Γ c , u ( l ) = T 1 ε r ( l ) u ˜ ( l ) n + i = 1 i l n T 1 ε r ( i ) u ˜ ( i ) n + g ( l ) , on Γ l .

The Fast Algorithm for the Scattering by a Finite Array of Cavities

Consider the second-order discretization of the transparent boundary condition on Γ
u : , N + 1 ( l ) = 1 ε r ( l ) T u : , N + 2 ( l ) u : , N ( l ) 2 h + j = 1 , j l n 1 ε r ( j ) T u : , N + 2 ( j ) u : , N ( j ) 2 h + g ( l ) , on Γ l .
We rewrite (42) as matrix form
2 h u : , N + 1 ( l ) 1 ε r ( l ) T u : , N + 2 ( l ) u : , N ( l ) j = 1 , j l n 1 ε r ( j ) T u : , N + 2 ( j ) u : , N ( j ) = 2 h g ( l ) , on Γ l .
On each aperture Γ ( l ) , we have the following second-order approximation according to Equation (20)
1 ε r ( l ) A x 2 h 2 I M + 2 + k 0 2 u : , N + 1 ( l ) + 1 ε r ( l ) 1 h 2 u : , N ( l ) + 1 ε r ( l ) 1 h 2 u : , N + 2 ( l ) = F : , N + 1 ( l ) , l = 1 , 2 , , n .
Multiplying C x 1 on both sides of (44), we have
1 ε r ( l ) Λ 2 h 2 I M + 2 + k 0 2 u ¯ : , N + 1 ( l ) + 1 ε r ( l ) 1 h 2 u ¯ : , N ( l ) + 1 ε r ( l ) 1 h 2 u ¯ : , N + 2 ( l ) = F ¯ : , N + 1 ( l ) .
Denoting J 1 ( l ) = 1 ε r ( l ) Λ 2 h 2 I M + 2 + k 0 2 , J 2 ( l ) = 1 ε r ( l ) 1 h 2 , we have
2 h C x + 1 ε r ( l ) T C x J 2 ( l ) 1 J 1 ( l ) u ¯ : , N + 1 ( l ) + 2 1 ε r ( l ) T C x u ¯ : , N ( l ) + j = 1 , j l n T 1 ε r ( j ) C x J 2 ( j ) 1 J 1 ( j ) u ¯ : , N + 1 ( j ) + 2 1 ε r ( j ) T C x u ¯ : , N ( j ) = 2 h g ( l ) + j = 1 n T C x J 2 ( j ) 1 F : , N + 1 ( j ) .
We apply the fast algorithm in each cavity Ω l , and obtain
P ( l ) u ¯ : , N ( l ) + Q ( l ) u ¯ : , N + 1 ( l ) = F ˜ ( l ) , l = 1 , 2 , , n ,
where
P ( l ) = diag p 1 ( l ) , p 2 ( l ) , , p M + 2 ( l ) , Q ( l ) = diag q 1 ( l ) , q 2 ( l ) , , q M + 2 ( l ) , F ˜ ( l ) = f ˜ 0 , N ( l ) , f ˜ 1 , N ( l ) , , f ˜ M + 1 , N ( l ) T .
Combining (46) and (47) yields
2 h C x + 1 ε r ( l ) T C x J 2 ( l ) 1 J 1 ( l ) 2 1 ε r ( l ) T C x P ( l ) 1 Q ( l ) u ¯ : , N + 1 ( l ) + j = 1 , j l n 1 ε r ( j ) T C x J 2 ( j ) 1 J 1 ( j ) 2 1 ε r ( j ) T C x P ( j ) 1 Q ( j ) u ¯ : , N + 1 ( j ) = 2 h g ( l ) + j = 1 n 1 ε r ( j ) T J 2 ( j ) 1 F ¯ : , N + 1 ( j ) + 2 C x P ( j ) 1 F ˜ ( j ) .
Therefore, we can derive the global system for the scattering problem from the finite array of large cavities in TE polarization
A 11 A 12 A 1 n A 21 A 22 A 2 n A n 1 A n 2 A n n u ¯ : , N + 1 ( 1 ) u ¯ : , N + 1 ( 2 ) u ¯ : , N + 1 ( n ) = b 1 b 2 b n ,
where
A i i = 2 h C x + 1 ε r ( i ) T C x J 2 ( i ) 1 J 1 ( i ) 2 1 ε r ( i ) T C x P ( i ) 1 Q ( i ) , A i j = 1 ε r ( j ) T C x J 2 ( j ) 1 J 1 ( j ) 2 T 1 ε r ( j ) C x P ( j ) 1 Q ( j ) , b i = 2 h g ( i ) + j = 1 n 1 ε r ( j ) T C x J 2 ( j ) 1 F ¯ : , N + 1 ( j ) + 2 P ( j ) 1 F ˜ ( j ) , i = 1 , 2 , , n , j = 1 , 2 , , n .
Similarly, we can apply the fast algorithm for the fourth-order scheme. Then we can derive the final fourth-order system on the apertures, which has the same expression as (49), where
A i i = 2 h η + T L 2 ( i ) C x 2 T L 1 ( i ) C x ( P ( i ) ) 1 Q ( i ) , A i j = T L 2 ( i ) C x 2 T L 1 ( i ) C x ( P ( j ) ) 1 Q ( j ) , b i = 2 h η g ( i ) + j = 1 n T h 2 F : , N + 1 ( j ) + h 4 12 Δ F : , N + 1 ( j ) η h 3 3 ( f y ) : , N + 1 ( j ) j = 1 n 2 T C x ( P ( j ) ) 1 ( L i ( i ) ) 1 F ¯ : , N ( j ) , i = 1 , 2 , , n , j = 1 , 2 , , n .

5. Numerical Experiments

In this section, a variety of numerical experiments are demonstrated to examine the efficiency of the proposed fast high-order algorithms for electromagnetic scattering by the finite array of cavities with high wave numbers. All the examples are computed with double precision and are performed on a desktop with an Intel(R) Core(TM) i5-9400F CPU, 2.90 GHz, and 16.00 GB memory. We present errors in L norm and estimate the convergence order by
r = log ( e h 1 / e h 2 ) log ( h 1 / h 2 ) .

5.1. Example 1

We consider a rectangular cavity of 1 m wide and 1 m deep. The exact solution is selected as
u = cos ( k 0 x ) sin ( ( k 0 + π / 2 ) y ) , ( x , y ) [ 0 , 1 ] × [ 1 , 0 ] .
The source term f ( x ) is derived from the (14) by changing the wave number and the relative permittivity. The errors and the convergence rates for the cavity filled with different materials are given in Table 1, Table 2 and Table 3. It is shown that the convergence orders for the schemes are two and four respectively. The numerical solution and the error of the proposed schemes for Example 1 with k 0 = 16 π m 1 , h = 1 / 1024 m are represented in Figure 3.

5.2. Example 2

We examine the validity of the proposed algorithms for the scattering problem from the single cavity further. We consider a 1 m wide and 0.25 m deep cavity scattering illuminated by a 300-MHz TE plane wave. The example was tested by Du’s results [30]. The physical parameter backscatter RCS can be calculated as follows. Let σ ( θ ) = 4 k 0 | P ( θ ) | 2 , where θ is the observation angle and P is the far-field coefficient given by
P ( θ ) = k 0 2 sin θ Γ e i k 0 x cos θ u d x .
When the incident angle is the same as the observation direction, the backscatter RCS is defined by
Backscatter RCS ( θ ) = 10 log 10 σ ( θ ) d B .
Figure 4 and Figure 5 display the magnitude and RCS of cavities filled with the homogeneous media ε r = 1 and ε r = 4 + i in TE polarization, where ‘o’ denotes the solutions derived in [30]. Clearly, the numerical results coincide with those of Du’s method. Moreover, we can see from Table 4 that the fast algorithm remarkably reduces the computational time.

5.3. Example 3

In order to address the electromagnetic scattering from the finite array of large cavities, we first consider a two-cavity scattering problem by two identical rectangular cavities of 1 m wide and 1 m deep. It is investigated that the farther the distance between the finite array of cavities, the smaller the coupling impact of each other, see [31] for details. Therefore, for high wave number problems, we consider the distance between cavities is equal to the width of the cavity. Backscatter RCS comparisons for the scattering from two cavities in TE polarization are displayed in Figure 6 and Figure 7. The cavities are filled with ε r = [ ε r ( 1 ) , ε r ( 2 ) ] = [ 2 , 2 ] , complex material ε r = [ ε r ( 1 ) , ε r ( 2 ) ] = [ 2 + 0.1 i , 2 + 0.1 i ] , and ε r = [ ε r ( 1 ) , ε r ( 2 ) ] = [ 2 + 10 i , 2 + 10 i ] respectively. We can see that the backscatter RCS of cavities filled with a lossy medium is lower than that of cavities filled with a lossless medium. Moreover, it is observed that the backscatter RCS of cavities decreases with the increase of the imaginary part of the medium. Therefore, the RCS can be reduced by filling the cavity with the absorbing material coating.

5.4. Example 4

We consider a three-cavity scattering problem by three identical rectangular cavities that are 1 meter wide and 0.5 meters deep. The distance between cavities is equal to the width of the cavity. We plot the contour for the real part of the magnetic field with k 0 = 8 π m 1 and k 0 = 16 π m 1 for the media of ε r = 2.38 + 0.12 i at θ = π / 3 and θ = π / 4 in Figure 8 and Figure 9.

6. Conclusions

In this paper, we present fast high-order algorithms for solving the electromagnetic scattering from the finite array of cavities with large wave numbers in TE polarization. Compact second-order and fourth-order schemes are applied to discretize the magnetic field equation in TE polarization. The boundary conditions of the cavity arrays are decoupled by a new transparent boundary condition. The fast algorithm is based on the FFT-cosine transformation in the horizontal direction and the Gaussian elimination in the vertical direction. Numerical experiments validate the convergence order and the efficiency of the proposed fast high-order algorithms.

Author Contributions

Conceptualization, methodology, M.Z.; writing—original draft preparation, J.H.; writing—review and editing, N.Z.; funding acquisition, M.Z. All authors have read and agreed to the published version of the manuscript.

Funding

The research was supported by the Natural Science Foundation of Hebei Province (No. A2020502003) and the Fundamental Research Funds for the Central Universities (No. 2021MS115).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Wang, C.; Gan, Y. 2D cavity modeling using method of moments and iterative solvers. J. Electromagn. Waves Appl. 2003, 17, 1739–1740. [Google Scholar] [CrossRef]
  2. Wood, W.; Wood, A. Development and numerical solution of integral equations for electromagnetic scattering from a trough in a ground plane. IEEE T. Antenn. Propag. 1999, 47, 1318–1322. [Google Scholar] [CrossRef]
  3. Jin, J. The Finite Element Method in Electromagnetics, 2nd ed.; John Wiley and Sons: New York, NY, USA, 2002. [Google Scholar]
  4. Liu, J.; Jin, J. A special higher order finite-element method for scattering by deep cavities. IEEE Trans. Antennas Propag. 2000, 48, 694–703. [Google Scholar]
  5. Liu, J.; Jin, J. A highly effective preconditioner for solving the finite element-boundary integral matrix equation of 3-D scattering. IEEE Trans. Antennas Propag. 2002, 50, 1212–1221. [Google Scholar] [CrossRef]
  6. Ross, D.; Volakis, J.; Anastassiu, H. Hybrid finite element-modal analysis of jet engine inlet scattering. IEEE Trans. Antennas Propag. 1995, 43, 277–285. [Google Scholar] [CrossRef]
  7. Alavikia, B.; Ramahi, O. Hybrid finite-element-boundary integral algorithm to solve the problem of scattering from a finite and infinite array of cavities with stratified dielectric coating. J. Opt. Soc. Am. A 2011, 28, 1022–1031. [Google Scholar] [CrossRef] [PubMed]
  8. Alavikia, B.; Ramahi, O. Coupling interactions in electromagnetic scattering from finite array of cavities with stratified dielectric coating. J. Opt. Soc. Am. A 2012, 29, 1132–1140. [Google Scholar] [CrossRef] [PubMed]
  9. Ito, K.; Qiao, Z.; Toivanen, J. A fast preconditioned iterative algorithm for the electromagnetic scattering from a large cavity. J. Sci. Comput. 2012, 53, 435–450. [Google Scholar]
  10. Bao, G.; Sun, W. A fast algorithm for the electromagnetic scattering from a large cavity. SIAM J. Sci. Comput. 2005, 27, 553–574. [Google Scholar] [CrossRef]
  11. Ito, K.; Qiao, Z.; Toivanen, J. A domain decomposition solver for acoustic scattering by elastic objects in layered media. J. Comput. Phys. 2008, 227, 8685–8698. [Google Scholar] [CrossRef]
  12. Zhao, M. A fast high order iterative solver for the electromagnetic scattering by open cavities filled with the inhomogeneous media. Adv. Appl. Math. Mech. 2013, 5, 235–257. [Google Scholar] [CrossRef]
  13. Zhao, M.; Qiao, Z.; Tang, T. A fast high order method for electromagnetic scattering by large open cavities. J. Comput. Math. 2011, 29, 287–304. [Google Scholar] [CrossRef]
  14. Zhao, M.; Zhu, N. A fast preconditioned iterative method for the electromagnetic scattering by multiple cavities with high wave numbers. J. Comput. Phys. 2019, 398, 108826. [Google Scholar] [CrossRef]
  15. Schiavone, G.; O’Neill, K.; Paulsen, K. Scattering from groove patterns in a perfectly conducting surface. J. Opt. Soc. Am. A 1997, 14, 2212–2222. [Google Scholar] [CrossRef]
  16. Van, T.; Wood, A. A time-domain finite element method for helmholtz equations. J. Comput. Phys. 2002, 183, 486–507. [Google Scholar] [CrossRef]
  17. Li, P. A survey of open cavity scattering problems. J. Comput. Math. 2019, 36, 1–16. [Google Scholar] [CrossRef]
  18. Xiang, Z.; Chia, T. A hybrid BEM/WTM approach for analysis of the EM scattering from large open-ended cavities. IEEE Trans. Antennas Propag. 2001, 49, 165–173. [Google Scholar] [CrossRef]
  19. Li, P.; Wang, L.; Wood, A. Analysis of transient electromagnetic scattering from a three-dimensional open cavity. SIAM J. Appl. Math. 2015, 75, 1675–1699. [Google Scholar] [CrossRef]
  20. Jiang, X.; Li, P.; Lv, J.; Zheng, W. An adaptive finite element method for the wave scattering with transparent boundary condition. J. Sci. Comput. 2017, 72, 936–956. [Google Scholar] [CrossRef]
  21. Chen, Y.; Jiang, X.; Lai, J.; Li, P. A fast algorithm for the electromagnetic scattering from a large rectangular cavity in three dimensions. J. Comput. Phys. 2021, 437, 110331. [Google Scholar] [CrossRef]
  22. Du, K.; Sun, W.; Zhang, X. Arbitrary high-order C0 tensor product Galerkin finite element methods for the electromagnetic scattering from a large cavity. J. Comput. Phys. 2013, 242, 181–195. [Google Scholar] [CrossRef]
  23. Mumtaz, F.; Ashraf, M.; Dai, Y. Numerical approach to approximate the electromagnetic scattering from random PEC cylinder placed below in dielectric half-space. Optik 2020, 206, 163751. [Google Scholar] [CrossRef]
  24. Zhao, M.; Zhu, N.; Wang, L. Fast algorithms for the electromagnetic scattering by partly covered cavities. J. Comput. Appl. Math. 2021, 40, 7. [Google Scholar] [CrossRef]
  25. Ammari, H.; Bao, G.; Wood, A. A cavity problem for maxwell’s equations. Meth. Appl. Anal. 2002, 9, 249–260. [Google Scholar] [CrossRef]
  26. Ammari, H.; Bao, G.; Wood, A. Analysis of the electromagnetic scattering from a cavity. J. Jpn. J. Indust. Appl. Math. 2002, 19, 301–310. [Google Scholar] [CrossRef]
  27. Bao, G.; Zhang, W. An improved mode-matching method for large cavities. IEEE Antennas Wirel. Propag. Lett. 2005, 4, 393–396. [Google Scholar]
  28. Li, P.; Wood, A. A two-dimensional helmhotlz equation solution for the multiple cavity scattering problem. J. Comput. Phys. 2013, 240, 100–120. [Google Scholar] [CrossRef]
  29. Wu, X.; Zheng, W. An adaptive perfectly matched layer method for multiple cavity scattering problems. Commun. Comput. Phys. 2016, 19, 534–558. [Google Scholar] [CrossRef]
  30. Du, K. Two transparent boundary conditions for the electromagnetic scattering from two-dimensional overfilled cavities. J. Comput. Phys. 2011, 230, 5822–5835. [Google Scholar] [CrossRef]
  31. Uber, R. Time Domain Analysis of the Electromagnetic Scattering From Multiple Cavities Embedded in a Ground Plane. Ph.D. Thesis, Air Force Institute of Technology, Wright-Patterson AFB, OH, USA, 2016. [Google Scholar]
Figure 1. Single cavity scattering geometry.
Figure 1. Single cavity scattering geometry.
Mathematics 10 02937 g001
Figure 2. The geometric model of the finite array of cavities.
Figure 2. The geometric model of the finite array of cavities.
Mathematics 10 02937 g002
Figure 3. The real part of the numerical solution (left) and the absolute error plot (right) for the empty cavity with k 0 = 16 π m 1 , h = 1 / 1024 m.
Figure 3. The real part of the numerical solution (left) and the absolute error plot (right) for the empty cavity with k 0 = 16 π m 1 , h = 1 / 1024 m.
Mathematics 10 02937 g003
Figure 4. The magnitude of the aperture fields at normal incidence (left) and backscatter RCS (right) in TE polarization with k 0 = 2 π m 1 , ε r = 1 , h = 1 / 256 m, ‘o’: the solutions derived in [30], ‘-’: our results.
Figure 4. The magnitude of the aperture fields at normal incidence (left) and backscatter RCS (right) in TE polarization with k 0 = 2 π m 1 , ε r = 1 , h = 1 / 256 m, ‘o’: the solutions derived in [30], ‘-’: our results.
Mathematics 10 02937 g004
Figure 5. The magnitude of the aperture fields at normal incidence (left) and backscatter RCS (right) in TE polarization with k 0 = 2 π m 1 , ε r = 4 + i , h = 1 / 256 m, ‘o’: the solutions derived in [30], ‘-’: our results.
Figure 5. The magnitude of the aperture fields at normal incidence (left) and backscatter RCS (right) in TE polarization with k 0 = 2 π m 1 , ε r = 4 + i , h = 1 / 256 m, ‘o’: the solutions derived in [30], ‘-’: our results.
Mathematics 10 02937 g005
Figure 6. The backscatter RCS by two cavities in TE polarization with k 0 = 4 π m 1 on 256 × 256 meshes for the media [ 2 , 2 ] , [ 2 + 0.1 i , 2 + 0.1 i ] and [ 2 + 10 i , 2 + 10 i ] .
Figure 6. The backscatter RCS by two cavities in TE polarization with k 0 = 4 π m 1 on 256 × 256 meshes for the media [ 2 , 2 ] , [ 2 + 0.1 i , 2 + 0.1 i ] and [ 2 + 10 i , 2 + 10 i ] .
Mathematics 10 02937 g006
Figure 7. The backscatter RCS by two cavities in TE polarization with k 0 = 8 π m 1 on 512 × 512 meshes for the media [ 2 , 2 ] , [ 2 + 0.1 i , 2 + 0.1 i ] and [ 2 + 10 i , 2 + 10 i ] .
Figure 7. The backscatter RCS by two cavities in TE polarization with k 0 = 8 π m 1 on 512 × 512 meshes for the media [ 2 , 2 ] , [ 2 + 0.1 i , 2 + 0.1 i ] and [ 2 + 10 i , 2 + 10 i ] .
Mathematics 10 02937 g007
Figure 8. Contour for real part of the magnetic field by three empty cavities with k 0 = 8 π m 1 of 512 × 256 mesh at θ = π / 3 .
Figure 8. Contour for real part of the magnetic field by three empty cavities with k 0 = 8 π m 1 of 512 × 256 mesh at θ = π / 3 .
Mathematics 10 02937 g008
Figure 9. The real part of the magnetic field by three empty cavities with k 0 = 16 π m 1 of 1024 × 512 mesh at θ = π / 4 .
Figure 9. The real part of the magnetic field by three empty cavities with k 0 = 16 π m 1 of 1024 × 512 mesh at θ = π / 4 .
Mathematics 10 02937 g009
Table 1. Numerical convergence orders of the second-order fast algorithm with k 0 = 8 π m 1 , ε r = 4 + i .
Table 1. Numerical convergence orders of the second-order fast algorithm with k 0 = 8 π m 1 , ε r = 4 + i .
h e ( Γ ) Order e ( Ω ) OrderCPU Time (s)
1/162.0281 × 10 1 9.7386 × 10 2 0.0080
1/324.6314 × 10 2 2.13064.4007 × 10 2 1.14600.0982
1/641.1937 × 10 2 1.95601.3852 × 10 2 1.66760.0200
1/1283.0142 × 10 3 1.98563.4765 × 10 3 1.99440.0317
1/2567.5720 × 10 4 1.99318.7693 × 10 4 1.98710.0894
Table 2. Numerical convergence orders of the fourth-order fast algorithm with k 0 = 8 π m 1 , ε r = 4 + i .
Table 2. Numerical convergence orders of the fourth-order fast algorithm with k 0 = 8 π m 1 , ε r = 4 + i .
h e ( Γ ) Order e ( Ω ) OrderCPU Time (s)
1/162.9375 × 10 1 1.6377 × 10 1 0.0382
1/321.9114 × 10 2 3.94191.1956 × 10 2 3.77580.0561
1/641.3079 × 10 3 3.86941.1329 × 10 3 3.39970.0737
1/1288.4704 × 10 5 3.94868.0131 × 10 5 3.82150.1400
1/2565.3553 × 10 6 3.98345.2272 × 10 6 3.93820.6564
Table 3. Numerical convergence orders of the fourth-order fast algorithm with k 0 = 16 π m 1 , ε r = 4 + i .
Table 3. Numerical convergence orders of the fourth-order fast algorithm with k 0 = 16 π m 1 , ε r = 4 + i .
h e ( Γ ) Order e ( Ω ) OrderCPU Time (s)
1/642.1762 × 10 2 1.4052 × 10 2 0.0478
1/1281.4300 × 10 3 3.92771.2347 × 10 3 3.50860.0908
1/2569.1459 × 10 5 3.96688.6201 × 10 5 3.84030.5833
1/5125.7521 × 10 6 3.99105.6021 × 10 6 3.94375.4535
1/10243.6003 × 10 7 3.99793.5557 × 10 7 3.977866.1697
Table 4. The comparison of the computational time for the proposed normal and fast fourth-order scheme.
Table 4. The comparison of the computational time for the proposed normal and fast fourth-order scheme.
hCPU Time of Fourth-Order Scheme (s)CPU Time of Fast Fourth-Order Scheme (s)
1/1280.02110.0083
1/2560.35030.0544
1/5121.39280.2142
1/10248.10061.2517
1/2048out of memory10.7882
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhao, M.; He, J.; Zhu, N. Fast High-Order Algorithms for Electromagnetic Scattering Problem from Finite Array of Cavities in TE Case with High Wave Numbers. Mathematics 2022, 10, 2937. https://doi.org/10.3390/math10162937

AMA Style

Zhao M, He J, Zhu N. Fast High-Order Algorithms for Electromagnetic Scattering Problem from Finite Array of Cavities in TE Case with High Wave Numbers. Mathematics. 2022; 10(16):2937. https://doi.org/10.3390/math10162937

Chicago/Turabian Style

Zhao, Meiling, Jiahui He, and Na Zhu. 2022. "Fast High-Order Algorithms for Electromagnetic Scattering Problem from Finite Array of Cavities in TE Case with High Wave Numbers" Mathematics 10, no. 16: 2937. https://doi.org/10.3390/math10162937

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