# One-Step Leapfrog LOD-BOR-FDTD Algorithm with CPML Implementation

Authors: Yi-Gang Wang; Yun Yi; Bin Chen; Hai-Lin Chen; Kang Luo; Run Xiong
Journal: International Journal of Antennas and Propagation
 (2016)

---

## Abstract

An unconditionally stable one-step leapfrog locally one-dimensional finite-difference time-domain (LOD-FDTD) algorithm towards body of revolution (BOR) is presented. The equations of the proposed algorithm are obtained by the algebraic manipulation of those used in the conventional LOD-BOR-FDTD algorithm. The equations forz-direction electric and magnetic fields in the proposed algorithm should be treated specially. The new algorithm obtains a higher computational efficiency while preserving the properties of the conventional LOD-BOR-FDTD algorithm. Moreover, the convolutional perfectly matched layer (CPML) is introduced into the one-step leapfrog LOD-BOR-FDTD algorithm. The equation of the one-step leapfrog CPML is concise. Numerical results show that its reflection error is small. It can be concluded that the similar CPML scheme can also be easily applied to the one-step leapfrog LOD-FDTD algorithm in the Cartesian coordinate system.


---

## Body

## 1. Introduction

The body of revolution finite-difference time-domain (BOR-FDTD) algorithm is very efficient in analyzing electromagnetic problems towards rotationally symmetric structures [1, 2]. It has been widely used in modeling electromagnetic pulse effects, electromagnetic wave scattering, subsurface interface radar, optical lenses, guided waves, and so on [1]. However, the time step size of the conventional BOR-FDTD algorithm is strictly limited by the Courant-Friedrichs-Lewy (CFL) condition [1]. To remove the stability limit on the time step size of the BOR-FDTD algorithm and improve the efficiency, some unconditionally stable schemes such as the alternating-direction implicit (ADI) BOR-FDTD [3], the locally one-dimensional (LOD) BOR-FDTD [4], and the weighted Laguerre polynomials (WLP) BOR-FDTD [5] algorithms have been proposed. The WLP-BOR-FDTD algorithm needs to solve a large sparse matrix, so it is not so applicable for large computational domain [5]. The LOD-BOR-FDTD algorithm and the ADI-BOR-FDTD algorithm show comparable accuracy, and the LOD-BOR-FDTD algorithm shows a little higher computational efficiency [4]. In the conventional ADI-BOR-FDTD and LOD-BOR-FDTD algorithms, the equations for one full time step are split into two subtime steps; as a result, their computational expenditures are increased [3, 4]. Recently, the one-step leapfrog ADI-FDTD algorithm which eliminates the midtime step successfully has been proposed and developed [6–11]. It makes the simulation with the ADI-FDTD algorithm more efficient. The application of the one-step leapfrog ADI-FDTD algorithm to BOR has also been proposed [12]. In fact, the parallel improvement can also be made for the conventional LOD-BOR-FDTD algorithm.Recently, an unconditionally stable one-step leapfrog LOD-FDTD algorithm was proposed [13]. In the algorithm, the equations are obtained by the manipulation of those used in the conventional LOD-FDTD algorithm. The resultant electric and magnetic field equations are interlaced half a time step apart and no subtime steps are involved. The new algorithm obtains a higher computational efficiency while preserving the properties of the conventional LOD-FDTD algorithm [13].In this work, the one-step leapfrog LOD-FDTD algorithm for BOR is developed, called one-step leapfrog LOD-BOR-FDTD algorithm. In the proposed algorithm, thez-direction electric and magnetic field components are dealt with differently. Moreover, the convolutional perfectly matched layer (CPML) [14] is introduced to the one-step leapfrog LOD-BOR-FDTD algorithm. The equations of the one-step leapfrog CPML are concise.The remainder of the paper is organized as follows. In Section2, the equations of the one-step leapfrog LOD-BOR-FDTD algorithm are presented and some discussions about the algorithm are made. In Section 3, the CPML is developed for the proposed algorithm. To assess the proposed algorithm and its CPML, numerical examples are given in Section 4. Finally, conclusions are made in Section 5.


## 2. Formulations and Discussions

### 2.1. Equations for Off-Axis Cells

The equations for the conventional LOD-BOR-FDTD algorithm can be expressed as [4](1a)
E
n
+
1
/
2
-
Δ
t
2
ε
A
12
H
n
+
1
/
2
=
E
n
+
Δ
t
2
ε
A
12
H
n
(1b)
H
n
+
1
/
2
-
Δ
t
2
μ
A
21
E
n
+
1
/
2
=
H
n
+
Δ
t
2
μ
A
21
E
nfor the first subtime step and(2a)
E
n
+
1
+
Δ
t
2
ε
B
12
H
n
+
1
=
E
n
+
1
/
2
-
Δ
t
2
ε
B
12
H
n
+
1
/
2
(2b)
H
n
+
1
+
Δ
t
2
μ
B
21
E
n
+
1
=
H
n
+
1
/
2
-
Δ
t
2
μ
B
21
E
n
+
1
/
2for the second subtime step.Here,(3)
A
12
=
0
0
±
m
ρ
∂
∂
z
0
0
0
∂
ρ
ρ
∂
ρ
0
,
A
21
=
0
∂
∂
z
0
0
0
∂
∂
ρ
∓
m
ρ
0
0
,
B
12
=
0
∂
∂
z
0
0
0
∂
∂
ρ
±
m
ρ
0
0
,
B
21
=
0
0
∓
m
ρ
∂
∂
z
0
0
0
∂
ρ
ρ
∂
ρ
0are the matrices that contain the spatial differential operators, E
=
E
ρ
E
ϕ
E
z
T and H
=
H
ρ
H
ϕ
H
z
T are the electric and magnetic field vectors, m is the mode number, ε is the permittivity, and μ is the permeability.Following the similar procedure used in [13, 15, 16], one can obtain the following electric field equations for the one-step leapfrog LOD-BOR-FDTD algorithm with only algebraic manipulations of (1a), (1b), (2a), and (2b):(4a)
E
~
n
-
1
/
2
=
E
n
-
1
/
2
-
Δ
t
2
ε
B
12
h
n
(4b)
I
2
-
Δ
t
2
8
ε
μ
A
12
A
21
e
n
+
1
/
2
=
E
~
n
-
1
/
2
+
Δ
t
2
ε
A
12
H
n
(4c)
E
n
+
1
/
2
=
e
n
+
1
/
2
-
E
~
n
-
1
/
2
,where I is a 3
×
3 unit matrix, E
~
n
-
1
/
2 and e
n
+
1
/
2 are auxiliary variables, and e
n
+
1
/
2
=
E
n
+
1
/
2
+
E
n.Similarly, one can obtain the equations for the magnetic fields(5a)
H
~
n
=
H
n
+
Δ
t
2
μ
A
21
e
n
+
1
/
2
(5b)
I
2
-
Δ
t
2
8
ε
μ
B
21
B
12
h
n
+
1
=
H
~
n
-
Δ
t
2
μ
B
21
E
n
+
1
/
2
(5c)
H
n
+
1
=
h
n
+
1
-
H
~
n
,where H
~
n and h
n
+
1 are auxiliary variables and h
n
+
1
=
H
n
+
1
+
H
n
+
1
/
2.


### 2.2. Equations for On-AxisE
z Field

The on-axisE
z field component cannot be obtained by using (4a), (4b), and (4c) directly. Note that the on-axis E
z field component is zero for m
≠
0, so one should only deal with it for m
=
0. The equation for the on-axis E
z field component in the conventional LOD-BOR-FDTD algorithm is [4](6a)
E
z
n
+
1
/
2
0
,
k
+
1
2
-
2
Δ
t
ε
Δ
ρ
H
ϕ
n
+
1
/
2
1
2
,
k
+
1
2
=
E
z
n
0
,
k
+
1
2
+
2
Δ
t
ε
Δ
ρ
H
ϕ
n
1
2
,
k
+
1
2for the first subtime step and(6b)
E
z
n
+
1
0
,
k
+
1
2
=
E
z
n
+
1
/
2
0
,
k
+
1
2for the second subtime step. Moreover, one can obtain the equation for H
ϕ
n
+
1
/
2
1
/
2
,
k
+
1
/
2 in the conventional LOD-BOR-FDTD algorithm from (1b)(7)
H
ϕ
n
+
1
/
2
1
2
,
k
+
1
2
-
Δ
t
2
μ
E
z
n
+
1
/
2
1
,
k
+
1
/
2
-
E
z
n
+
1
/
2
0
,
k
+
1
/
2
Δ
ρ
=
H
ϕ
n
1
2
,
k
+
1
2
+
Δ
t
2
μ
E
z
n
1
,
k
+
1
/
2
-
E
z
n
0
,
k
+
1
/
2
Δ
ρ
.Applying the similar procedure used in Section2.1, one can obtain the following equations for the on-axis E
z field component by using (6a), (6b), and (7):(8a)
1
2
+
Δ
t
2
2
ε
μ
Δ
ρ
2
e
z
n
+
1
/
2
0
,
k
+
1
2
-
Δ
t
2
2
ε
μ
Δ
ρ
2
e
z
n
+
1
/
2
1
,
k
+
1
2
=
E
z
n
-
1
/
2
0
,
k
+
1
2
+
2
Δ
t
ε
Δ
ρ
H
ϕ
n
1
2
,
k
+
1
2
(8b)
E
z
n
+
1
/
2
0
,
k
+
1
2
=
e
z
n
+
1
/
2
0
,
k
+
1
2
-
E
z
n
-
1
/
2
0
,
k
+
1
2
.Unlike the equations for the off-axis E
z field components, no auxiliary variable E
~
z is involved here.


### 2.3. Equations forH
z
n
+
1
1
/
2
,
k

The equations forH
z
n
+
1
1
/
2
,
k should also be treated specially. With the algebraic manipulation of the relative difference equations used in the conventional LOD-BOR-FDTD algorithm [4], one can obtain the following equations for H
z
n
+
1
1
/
2
,
k
:
(9a)
H
~
z
n
1
2
,
k
=
H
z
n
1
2
,
k
+
Δ
t
μ
∓
m
Δ
ρ
e
ρ
n
+
1
/
2
1
2
,
k
(9b)
1
2
+
Δ
t
2
4
ε
μ
Δ
ρ
2
h
z
n
+
1
1
2
,
k
-
Δ
t
2
4
ε
μ
Δ
ρ
2
h
z
n
+
1
3
2
,
k
=
H
~
z
n
1
2
,
k
-
Δ
t
μ
Δ
ρ
E
ϕ
n
+
1
/
2
1
,
k
(9c)
H
z
n
+
1
1
2
,
k
=
h
z
n
+
1
1
2
,
k
-
H
~
z
n
1
2
,
k
.


### 2.4. Some Discussions about the Proposed Algorithm

It can be seen that all the equations used in the proposed algorithm are obtained from those used in the conventional LOD-BOR-FDTD algorithm and only algebraic manipulations are made. Therefore, one can conclude that the proposed algorithm preserves the properties of the conventional LOD-BOR-FDTD algorithm.In terms of memory, the variables used in the conventional LOD-BOR-FDTD algorithm areE
n
+
1
/
2, H
n
+
1
/
2, and E
n in the first subtime step, which can also be reused in the second subtime step. In the proposed algorithm, E
~
n
-
1
/
2, E
n
-
1
/
2, and E
n
+
1
/
2 can occupy the same memory space. There are similar situations to H
~
n, H
n, and H
n
+
1 and e
n
+
1
/
2 and h
n
+
1. As a result, the proposed algorithm consumes the same amount of memory as the conventional LOD-BOR-FDTD algorithm.There are four tridiagonal equations in one full time step, for both the conventional LOD-BOR-FDTD algorithm and the proposed algorithm. So the floating point operations at the left-hand sides of the equations are the same for the two algorithms. However, the numbers of the multiplications/divisions (M/D) and the additions/subtractions (A/S) at the right-hand sides of the equations are different. Table1 shows the count of the M/D and A/S at the right-hand sides of the equations in two algorithms for modes m
=
0 and m
≠
0, respectively. Obviously, the proposed algorithm needs less floating point operations, so one can conclude that it has a higher computational efficiency. Note that all the coefficients of the equations are precomputed and stored here, and special treatments for the components that lie on or near the axis are not considered.Table 1
The floating point operations at the right-hand sides of the equations for two algorithms.
Mode
Conventional LOD-BOR-FDTD
One-step leapfrog LOD-BOR-FDTD
m
=
0
m
≠
0
m
=
0
m
≠
0
M/D
20
26
12
16
A/S
32
38
22
26
M/D + A/S
52
64
34
42In the proposed algorithm, tridiagonal implicit equations for the magnetic field components are involved, so one should pay special attention to handling the perfectly electrically conducting (PEC) boundary, since there will be out-of-domain magnetic field components. To address this issue, one can resort to the image theory [17]. Such treatments are often used in handling the PEC resonator, PEC scatterer, PEC wall of the perfectly matched layer (PML), and so on.


## 2.1. Equations for Off-Axis Cells

The equations for the conventional LOD-BOR-FDTD algorithm can be expressed as [4](1a)
E
n
+
1
/
2
-
Δ
t
2
ε
A
12
H
n
+
1
/
2
=
E
n
+
Δ
t
2
ε
A
12
H
n
(1b)
H
n
+
1
/
2
-
Δ
t
2
μ
A
21
E
n
+
1
/
2
=
H
n
+
Δ
t
2
μ
A
21
E
nfor the first subtime step and(2a)
E
n
+
1
+
Δ
t
2
ε
B
12
H
n
+
1
=
E
n
+
1
/
2
-
Δ
t
2
ε
B
12
H
n
+
1
/
2
(2b)
H
n
+
1
+
Δ
t
2
μ
B
21
E
n
+
1
=
H
n
+
1
/
2
-
Δ
t
2
μ
B
21
E
n
+
1
/
2for the second subtime step.Here,(3)
A
12
=
0
0
±
m
ρ
∂
∂
z
0
0
0
∂
ρ
ρ
∂
ρ
0
,
A
21
=
0
∂
∂
z
0
0
0
∂
∂
ρ
∓
m
ρ
0
0
,
B
12
=
0
∂
∂
z
0
0
0
∂
∂
ρ
±
m
ρ
0
0
,
B
21
=
0
0
∓
m
ρ
∂
∂
z
0
0
0
∂
ρ
ρ
∂
ρ
0are the matrices that contain the spatial differential operators, E
=
E
ρ
E
ϕ
E
z
T and H
=
H
ρ
H
ϕ
H
z
T are the electric and magnetic field vectors, m is the mode number, ε is the permittivity, and μ is the permeability.Following the similar procedure used in [13, 15, 16], one can obtain the following electric field equations for the one-step leapfrog LOD-BOR-FDTD algorithm with only algebraic manipulations of (1a), (1b), (2a), and (2b):(4a)
E
~
n
-
1
/
2
=
E
n
-
1
/
2
-
Δ
t
2
ε
B
12
h
n
(4b)
I
2
-
Δ
t
2
8
ε
μ
A
12
A
21
e
n
+
1
/
2
=
E
~
n
-
1
/
2
+
Δ
t
2
ε
A
12
H
n
(4c)
E
n
+
1
/
2
=
e
n
+
1
/
2
-
E
~
n
-
1
/
2
,where I is a 3
×
3 unit matrix, E
~
n
-
1
/
2 and e
n
+
1
/
2 are auxiliary variables, and e
n
+
1
/
2
=
E
n
+
1
/
2
+
E
n.Similarly, one can obtain the equations for the magnetic fields(5a)
H
~
n
=
H
n
+
Δ
t
2
μ
A
21
e
n
+
1
/
2
(5b)
I
2
-
Δ
t
2
8
ε
μ
B
21
B
12
h
n
+
1
=
H
~
n
-
Δ
t
2
μ
B
21
E
n
+
1
/
2
(5c)
H
n
+
1
=
h
n
+
1
-
H
~
n
,where H
~
n and h
n
+
1 are auxiliary variables and h
n
+
1
=
H
n
+
1
+
H
n
+
1
/
2.


## 2.2. Equations for On-AxisE
z Field

The on-axisE
z field component cannot be obtained by using (4a), (4b), and (4c) directly. Note that the on-axis E
z field component is zero for m
≠
0, so one should only deal with it for m
=
0. The equation for the on-axis E
z field component in the conventional LOD-BOR-FDTD algorithm is [4](6a)
E
z
n
+
1
/
2
0
,
k
+
1
2
-
2
Δ
t
ε
Δ
ρ
H
ϕ
n
+
1
/
2
1
2
,
k
+
1
2
=
E
z
n
0
,
k
+
1
2
+
2
Δ
t
ε
Δ
ρ
H
ϕ
n
1
2
,
k
+
1
2for the first subtime step and(6b)
E
z
n
+
1
0
,
k
+
1
2
=
E
z
n
+
1
/
2
0
,
k
+
1
2for the second subtime step. Moreover, one can obtain the equation for H
ϕ
n
+
1
/
2
1
/
2
,
k
+
1
/
2 in the conventional LOD-BOR-FDTD algorithm from (1b)(7)
H
ϕ
n
+
1
/
2
1
2
,
k
+
1
2
-
Δ
t
2
μ
E
z
n
+
1
/
2
1
,
k
+
1
/
2
-
E
z
n
+
1
/
2
0
,
k
+
1
/
2
Δ
ρ
=
H
ϕ
n
1
2
,
k
+
1
2
+
Δ
t
2
μ
E
z
n
1
,
k
+
1
/
2
-
E
z
n
0
,
k
+
1
/
2
Δ
ρ
.Applying the similar procedure used in Section2.1, one can obtain the following equations for the on-axis E
z field component by using (6a), (6b), and (7):(8a)
1
2
+
Δ
t
2
2
ε
μ
Δ
ρ
2
e
z
n
+
1
/
2
0
,
k
+
1
2
-
Δ
t
2
2
ε
μ
Δ
ρ
2
e
z
n
+
1
/
2
1
,
k
+
1
2
=
E
z
n
-
1
/
2
0
,
k
+
1
2
+
2
Δ
t
ε
Δ
ρ
H
ϕ
n
1
2
,
k
+
1
2
(8b)
E
z
n
+
1
/
2
0
,
k
+
1
2
=
e
z
n
+
1
/
2
0
,
k
+
1
2
-
E
z
n
-
1
/
2
0
,
k
+
1
2
.Unlike the equations for the off-axis E
z field components, no auxiliary variable E
~
z is involved here.


## 2.3. Equations forH
z
n
+
1
1
/
2
,
k

The equations forH
z
n
+
1
1
/
2
,
k should also be treated specially. With the algebraic manipulation of the relative difference equations used in the conventional LOD-BOR-FDTD algorithm [4], one can obtain the following equations for H
z
n
+
1
1
/
2
,
k
:
(9a)
H
~
z
n
1
2
,
k
=
H
z
n
1
2
,
k
+
Δ
t
μ
∓
m
Δ
ρ
e
ρ
n
+
1
/
2
1
2
,
k
(9b)
1
2
+
Δ
t
2
4
ε
μ
Δ
ρ
2
h
z
n
+
1
1
2
,
k
-
Δ
t
2
4
ε
μ
Δ
ρ
2
h
z
n
+
1
3
2
,
k
=
H
~
z
n
1
2
,
k
-
Δ
t
μ
Δ
ρ
E
ϕ
n
+
1
/
2
1
,
k
(9c)
H
z
n
+
1
1
2
,
k
=
h
z
n
+
1
1
2
,
k
-
H
~
z
n
1
2
,
k
.


## 2.4. Some Discussions about the Proposed Algorithm

It can be seen that all the equations used in the proposed algorithm are obtained from those used in the conventional LOD-BOR-FDTD algorithm and only algebraic manipulations are made. Therefore, one can conclude that the proposed algorithm preserves the properties of the conventional LOD-BOR-FDTD algorithm.In terms of memory, the variables used in the conventional LOD-BOR-FDTD algorithm areE
n
+
1
/
2, H
n
+
1
/
2, and E
n in the first subtime step, which can also be reused in the second subtime step. In the proposed algorithm, E
~
n
-
1
/
2, E
n
-
1
/
2, and E
n
+
1
/
2 can occupy the same memory space. There are similar situations to H
~
n, H
n, and H
n
+
1 and e
n
+
1
/
2 and h
n
+
1. As a result, the proposed algorithm consumes the same amount of memory as the conventional LOD-BOR-FDTD algorithm.There are four tridiagonal equations in one full time step, for both the conventional LOD-BOR-FDTD algorithm and the proposed algorithm. So the floating point operations at the left-hand sides of the equations are the same for the two algorithms. However, the numbers of the multiplications/divisions (M/D) and the additions/subtractions (A/S) at the right-hand sides of the equations are different. Table1 shows the count of the M/D and A/S at the right-hand sides of the equations in two algorithms for modes m
=
0 and m
≠
0, respectively. Obviously, the proposed algorithm needs less floating point operations, so one can conclude that it has a higher computational efficiency. Note that all the coefficients of the equations are precomputed and stored here, and special treatments for the components that lie on or near the axis are not considered.Table 1
The floating point operations at the right-hand sides of the equations for two algorithms.
Mode
Conventional LOD-BOR-FDTD
One-step leapfrog LOD-BOR-FDTD
m
=
0
m
≠
0
m
=
0
m
≠
0
M/D
20
26
12
16
A/S
32
38
22
26
M/D + A/S
52
64
34
42In the proposed algorithm, tridiagonal implicit equations for the magnetic field components are involved, so one should pay special attention to handling the perfectly electrically conducting (PEC) boundary, since there will be out-of-domain magnetic field components. To address this issue, one can resort to the image theory [17]. Such treatments are often used in handling the PEC resonator, PEC scatterer, PEC wall of the perfectly matched layer (PML), and so on.


## 3. CPML Implementation for the Proposed Algorithm

To solve open region problems efficiently, the CPML for the proposed one-step leapfrog LOD-BOR-FDTD algorithm is developed. The coordinate-stretching variables for the CPML are defined as(10)
s
ρ
=
κ
ρ
+
σ
ρ
α
ρ
+
j
ω
ε
,
s
z
=
κ
z
+
σ
z
α
z
+
j
ω
ε
.One can also define(11)
s
ϕ
=
ρ
~
ρ
=
κ
ϕ
+
σ
ϕ
α
ϕ
+
j
ω
ε
,where s
ϕ
=
1
/
ρ
ρ
0
+
∫
ρ
0
ρ
κ
ρ
+
σ
ρ
/
α
ρ
+
j
ω
ε
d
ρ
′ and ρ
0 represents the interface between FDTD and PML domains [18].For simplicity, the CPML equations for theE
z field component are given here. In fact, the CPML equations for the other field components can be obtained in a similar manner. According to the definition in (10) and (11), one can write the CPML equations of the conventional LOD-BOR-FDTD algorithm in the following form:(12a)
E
z
n
+
1
/
2
-
Δ
t
2
ε
1
κ
ϕ
H
ϕ
n
+
1
/
2
ρ
+
1
κ
ρ
D
ρ
H
ϕ
n
+
1
/
2
+
ψ
e
z
ρ
ϕ
n
+
1
/
2
+
ψ
e
z
ρ
n
+
1
/
2
=
E
z
n
+
Δ
t
2
ε
1
κ
ϕ
H
ϕ
n
ρ
+
1
κ
ρ
D
ρ
H
ϕ
n
+
ψ
e
z
ρ
ϕ
n
+
ψ
e
z
ρ
n
(12b)
H
ϕ
n
+
1
/
2
-
Δ
t
2
μ
1
κ
ρ
D
ρ
E
z
n
+
1
/
2
+
ψ
h
ϕ
ρ
n
+
1
/
2
=
H
ϕ
n
+
Δ
t
2
μ
1
κ
ρ
D
ρ
E
z
n
+
ψ
h
ϕ
ρ
nfor the first subtime step and(13a)
E
z
n
+
1
+
Δ
t
±
m
2
ε
1
κ
ϕ
H
ρ
n
+
1
ρ
+
ψ
e
z
ϕ
n
+
1
=
E
z
n
+
1
/
2
-
Δ
t
±
m
2
ε
1
κ
ϕ
H
ρ
n
+
1
/
2
ρ
+
ψ
e
z
ϕ
n
+
1
/
2
(13b)
H
ϕ
n
+
1
+
Δ
t
2
μ
1
κ
z
D
z
E
ρ
n
+
1
+
ψ
h
ϕ
z
n
+
1
=
H
ϕ
n
+
1
/
2
-
Δ
t
2
μ
1
κ
z
D
z
E
ρ
n
+
1
/
2
+
ψ
h
ϕ
z
n
+
1
/
2for the second subtime step.In the first subtime step, one can define(14a)
e
z
n
+
1
/
2
=
E
z
n
+
1
/
2
+
E
z
n
(14b)
h
ϕ
n
+
1
/
2
=
H
ϕ
n
+
1
/
2
+
H
ϕ
n
(14c)
φ
e
z
ρ
ϕ
n
+
1
/
2
=
ψ
e
z
ρ
ϕ
n
+
1
/
2
+
ψ
e
z
ρ
ϕ
n
(14d)
φ
e
z
ρ
n
+
1
/
2
=
ψ
e
z
ρ
n
+
1
/
2
+
ψ
e
z
ρ
n
(14e)
φ
h
ϕ
ρ
n
+
1
/
2
=
ψ
h
ϕ
ρ
n
+
1
/
2
+
ψ
h
ϕ
ρ
n
.Then (12a) and (12b) can be rewritten as(15a)
e
z
n
+
1
/
2
-
Δ
t
2
ε
1
κ
ϕ
h
ϕ
n
+
1
/
2
ρ
+
1
κ
ρ
D
ρ
h
ϕ
n
+
1
/
2
+
φ
e
z
ρ
ϕ
n
+
1
/
2
+
φ
e
z
ρ
n
+
1
/
2
=
2
E
z
n
(15b)
h
ϕ
n
+
1
/
2
-
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
+
φ
h
ϕ
ρ
n
+
1
/
2
=
2
H
ϕ
n
.In the second subtime step, one can define(16a)
e
z
n
+
1
=
E
z
n
+
1
+
E
z
n
+
1
/
2
(16b)
h
ρ
n
+
1
=
H
ρ
n
+
1
+
H
ρ
n
+
1
/
2
(16c)
φ
e
z
ϕ
n
+
1
=
ψ
e
z
ϕ
n
+
1
+
ψ
e
z
ϕ
n
+
1
/
2
.Then (13a) can be rewritten as(17)
e
z
n
+
1
+
Δ
t
±
m
2
ε
1
κ
ϕ
h
ρ
n
+
1
ρ
+
φ
e
z
ϕ
n
+
1
=
2
E
z
n
+
1
/
2
.The former time steps of (16a) and (17) are(18)
e
z
n
=
E
z
n
+
E
z
n
-
1
/
2
(19)
e
z
n
+
Δ
t
±
m
2
ε
1
κ
ϕ
h
ρ
n
ρ
+
φ
e
z
ϕ
n
=
2
E
z
n
-
1
/
2
.Substituting (19) into (18), one can obtain(20)
E
z
n
-
1
/
2
-
Δ
t
±
m
2
ε
1
κ
ϕ
h
ρ
n
ρ
+
φ
e
z
ϕ
n
=
E
z
n
.Substituting (15b) into (15a), one can obtain(21)
e
z
n
+
1
/
2
-
Δ
t
ε
1
κ
ϕ
1
ρ
H
ϕ
n
-
Δ
t
2
ε
1
κ
ϕ
1
ρ
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
+
φ
h
ϕ
ρ
n
+
1
/
2
-
Δ
t
ε
1
κ
ρ
D
ρ
H
ϕ
n
-
Δ
t
2
ε
1
κ
ρ
D
ρ
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
+
φ
h
ϕ
ρ
n
+
1
/
2
-
Δ
t
2
ε
φ
e
z
ρ
ϕ
n
+
1
/
2
+
φ
e
z
ρ
n
+
1
/
2
=
2
E
z
n
.Substituting (20) into (21), the following equation can be obtained:(22)
e
z
n
+
1
/
2
-
Δ
t
2
ε
1
κ
ϕ
1
ρ
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
+
φ
h
ϕ
ρ
n
+
1
/
2
-
Δ
t
2
ε
1
κ
ρ
D
ρ
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
+
φ
h
ϕ
ρ
n
+
1
/
2
=
2
E
z
n
-
1
/
2
-
Δ
t
±
m
ε
1
κ
ϕ
h
ρ
n
ρ
+
φ
e
z
ϕ
n
+
Δ
t
ε
1
κ
ϕ
1
ρ
H
ϕ
n
+
Δ
t
ε
1
κ
ρ
D
ρ
H
ϕ
n
+
Δ
t
2
ε
φ
e
z
ρ
ϕ
n
+
1
/
2
+
φ
e
z
ρ
n
+
1
/
2
.Some of the auxiliary variables in (22) are approximated as(23a)
φ
h
ϕ
ρ
n
+
1
/
2
=
φ
h
ϕ
ρ
n
-
1
/
2
+
O
Δ
t
(23b)
φ
e
z
ρ
ϕ
n
+
1
/
2
=
ψ
e
z
ρ
ϕ
n
+
1
/
2
+
ψ
e
z
ρ
ϕ
n
=
2
ψ
e
z
ρ
ϕ
n
+
O
Δ
t
(23c)
φ
e
z
ρ
n
+
1
/
2
=
ψ
e
z
ρ
n
+
1
/
2
+
ψ
e
z
ρ
n
=
2
ψ
e
z
ρ
n
+
O
Δ
t
.Ignoring the high order terms of Δ
t in (23a), (23b), and (23c), then (22) can be approximated as(24)
e
z
n
+
1
/
2
-
Δ
t
2
ε
1
κ
ϕ
1
ρ
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
-
Δ
t
2
ε
1
κ
ρ
D
ρ
Δ
t
2
μ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
=
2
E
z
n
-
1
/
2
-
Δ
t
±
m
ε
1
κ
ϕ
h
ρ
n
ρ
+
φ
e
z
ϕ
n
+
Δ
t
ε
1
κ
ϕ
1
ρ
H
ϕ
n
+
ψ
e
z
ρ
ϕ
n
+
Δ
t
ε
1
κ
ρ
D
ρ
H
ϕ
n
+
ψ
e
z
ρ
n
+
Δ
t
2
ε
1
κ
ϕ
1
ρ
Δ
t
2
μ
φ
h
ϕ
ρ
n
-
1
/
2
+
Δ
t
2
ε
1
κ
ρ
D
ρ
Δ
t
2
μ
φ
h
ϕ
ρ
n
-
1
/
2
.The following equation can be obtained from (14a) and (20):(25)
E
z
n
+
1
/
2
=
e
z
n
+
1
/
2
-
E
z
n
-
1
/
2
+
Δ
t
±
m
2
ε
1
κ
ϕ
h
ρ
n
ρ
+
φ
e
z
ϕ
n
.To simplify the equations further, one can introduce an auxiliary variable E
~
z
n
-
1
/
2. As a result, the final equations for E
z can be reformulated as(26a)
E
~
z
n
-
1
/
2
=
E
z
n
-
1
/
2
-
Δ
t
±
m
2
ε
1
κ
ϕ
h
ρ
n
ρ
+
φ
e
z
ϕ
n
(26b)
1
2
e
z
n
+
1
/
2
-
Δ
t
2
8
ε
μ
1
κ
ϕ
1
ρ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
-
Δ
t
2
8
ε
μ
1
κ
ρ
D
ρ
1
κ
ρ
D
ρ
e
z
n
+
1
/
2
=
E
~
z
n
-
1
/
2
+
Δ
t
2
ε
1
κ
ϕ
1
ρ
H
ϕ
n
+
ψ
e
z
ρ
ϕ
n
+
Δ
t
2
ε
1
κ
ρ
D
ρ
H
ϕ
n
+
ψ
e
z
ρ
n
+
Δ
t
2
8
ε
μ
1
κ
ϕ
1
ρ
φ
h
ϕ
ρ
n
-
1
/
2
+
Δ
t
2
8
ε
μ
1
κ
ρ
D
ρ
φ
h
ϕ
ρ
n
-
1
/
2
(26c)
E
z
n
+
1
/
2
=
e
z
n
+
1
/
2
-
E
~
z
n
-
1
/
2
.Some of the auxiliary variables in (26a), (26b), and (26c) can be solved by(27a)
φ
e
z
ϕ
n
=
b
ϕ
φ
e
z
ϕ
n
-
1
+
a
ϕ
h
ρ
ρ
n
(27b)
ψ
e
z
ρ
ϕ
n
=
b
ϕ
ψ
e
z
ρ
ϕ
n
-
1
+
a
ϕ
H
ϕ
ρ
n
(27c)
ψ
e
z
ρ
n
=
b
ρ
ψ
e
z
ρ
n
-
1
+
a
ρ
∂
H
ϕ
∂
ρ
n
,where b
ς
=
e
-
(
σ
ς
/
κ
ς
+
α
ς
)
Δ
t
/
ε and a
ς
=
σ
ς
/
κ
ς
σ
ς
+
κ
ς
α
ς
b
ς
-
1, ς
=
ρ
,
ϕ
,
z.In addition, the auxiliary variableφ
h
ϕ
ρ
n
-
1
/
2 in (26b) has been solved in updating H
ϕ
n, so it can be used directly here. It is obvious that the number of the convolutional auxiliary variables for the proposed CPML is the same as that of the CPML for the conventional BOR-FDTD algorithm. Consequently, one can say that the equations of proposed CPML are concise.Whenκ
=
1 and σ
=
0, the equations of the proposed CPML can be simplified to be the normal equations of the proposed LOD-BOR-FDTD algorithm. Similarly, since the coordinate stretching along the ρ-direction only exists in the radial outer boundary, that is, κ
ρ
=
κ
ϕ
=
1 and σ
ρ
=
σ
ϕ
=
0 on (or near) the axis, the CPML equations for E
z
n
+
1
/
2
0
,
k
+
1
/
2 and H
z
n
+
1
1
/
2
,
k are still (8a), (8b), (9a), (9b), and (9c).In the Cartesian coordinate system, the coordinate stretching along each axis is similar to that along thez-direction in the cylindrical coordinate system. So it can be concluded that the CPML for the LOD-FDTD algorithm in the Cartesian coordinate system [13] can be implemented by applying the similar procedure.


## 4. Numerical Results and Discussions

A resonant cavity and a scattering example are provided to validate the one-step leapfrog LOD-BOR-FDTD algorithm and its CPML.


### 4.1. Cavity Resonator

TheT
E
011 mode of a PEC cylindrical cavity resonator is computed, which is frequently used as a benchmark [3, 4]. The radius and height of the cavity are 3.995 cm and 7.910 cm, respectively. Its theoretical resonant frequency is 4.950 GHz [3, 4]. The computational domain is divided into 50
(
ρ
)
×
100
(
z
) cells, with Δ
ρ
=
0.0799
c
m and Δ
z
=
0.0791
c
m. The cavity is computed with the conventional BOR-FDTD algorithm, the conventional LOD-BOR-FDTD algorithm, the one-step leapfrog ADI-BOR-FDTD algorithm, and the proposed algorithm, respectively. A time history of 52.73 ns is simulated.Table2 shows the computational results with different algorithms. Note that C
F
L
N
=
Δ
t
/
Δ
t
C
F
L and Δ
t
C
F
L is the maximum time step size that satisfies the CFL condition for the conventional BOR-FDTD algorithm [1], which is Δ
t
C
F
L
=
1.318
×
1
0
-
12
s here. It can be seen from Table 2 that the one-step leapfrog LOD-BOR-FDTD algorithm obtains the same numerical results as the conventional LOD-BOR-FDTD algorithm. Moreover, the numerical errors of two algorithms increase as the time step sizes increase. In terms of the computational time, the proposed algorithm consumes about 26.5%, 25.8%, and 25.0% less time than the conventional LOD-BOR-FDTD algorithm when CFLN is chosen to be 1, 4, and 8, respectively. The two unconditionally stable algorithms use the same amount of memory, which is 1.06 MB. Therefore, one can say that the proposed algorithm preserves the properties of the conventional LOD-BOR-FDTD algorithm and obtains a higher computational efficiency. The proposed algorithm also shows the same accuracy as that of the one-step leapfrog ADI-BOR-FDTD algorithm but obtains a little higher computational efficiency, as shown in Table 2. Note that the comparison among the conventional LOD-BOR-FDTD algorithm, the one-step leapfrog ADI-BOR-FDTD algorithm, and the proposed algorithm was performed only in the case of the resonant cavity and that further analysis could be performed on other situations to rule out the possibility that the results could be linked to the particular case considered. Since the TE011 mode is computed, the terms including multiplicative factor m (mode number) in the equations are all zero. In the simulation, these terms are not computed. All of the calculations are performed on an Intel® Core™ 2 Quad CPU Q6600 @ 2.40 GHz machine and the Fortran codes are used.Table 2
Comparison of the computational results with different algorithms.
BOR-FDTD
Conventional LOD-BOR-FDTD
One-step leapfrog ADI-BOR-FDTD
One-step leapfrog LOD-BOR-FDTD
CFLN
1
1
4
8
1
4
8
1
4
8
Iterations
40000
40000
10000
5000
40000
10000
5000
40000
10000
5000
Results, GHz
4.954
4.954
4.943
4.907
4.954
4.943
4.907
4.954
4.943
4.907
Relative error
0.08%
0.08%
−0.14%
−0.87%
0.08%
−0.14%
−0.87%
0.08%
−0.14%
−0.87%
Time, s
13.2
52.8
13.2
6.4
43.2
10.9
5.5
38.8
9.8
4.8


### 4.2. Scattering Example

To validate the proposed CPML for the one-step leapfrog LOD-BOR-FDTD algorithm, the scattered field from a PEC cylinder is computed. The radius and height of the cylinder are 20 cm and 40 cm, respectively. The oblique incident plane wave with incident angleθ
i
=
4
5
° is introduced by the TF/SF boundary conditions, which are placed at ρ
=
25
c
m and z
=
±
25
c
m. The incident plane wave is parallel polarized, as shown in Figure 1. The gray domain in Figure 1 denotes the PEC cylinder. The Gaussian pulse E
0
cos
⁡
2
π
f
0
t
e
-
4
π
t
-
t
0
/
τ
2 with E
0
=
1000
V
/
m, f
0
=
0.3
G
H
z, τ
=
2.2
n
s, and t
0
=
1.25
/
f
0 is used as the incident electric field E
i. The small computational domain is composed of 40
(
ρ
)
×
80
(
z
) cells, containing the 10 PML layers in the outer boundary, which are denoted by the oblique-line-domain as shown in Figure 1. According to the characteristic of the problem, the mode number ranges from 0 to 11. The uniform grids are chosen to be Δ
ρ
=
Δ
z
=
1
c
m. Therefore, the maximum time step size for the conventional BOR-FDTD [1] is Δ
t
C
F
L
=
2.778
×
1
0
-
12
s in the example. The observation point is placed at grid point Q
(
29
,
-
29
), which is near the corner of the scattered field domain.Figure 1
Illustration of the scattering example with oblique incidence.The scattered field is computed with the conventional BOR-FDTD algorithm and the proposed algorithm, respectively, both with the CPML absorbing boundary conditions. The parameters of the CPML are chosen according to the following expressions [18]:(28a)
σ
ς
=
σ
ς
m
a
x
ς
-
ς
0
p
δ
p
(28b)
σ
ς
o
p
t
=
p
+
1
150
π
Δ
ς
(28c)
κ
ς
=
1
+
κ
ς
m
a
x
ς
-
ς
0
p
δ
p
,where ς
=
ρ
,
z
,
δ is the thickness of the PML, ς
0 is the interface between the FDTD and PML grids, and p
=
4 is the order of the polynomial. In the computing, the optimized parameters are chosen to be κ
ς
m
a
x
=
3, σ
m
a
x
=
0.4
σ
o
p
t, and α
=
0.004.To validate the one-step leapfrog LOD-BOR-FDTD algorithm further, the scattered field is computed via large computational domain first. In this case, the scattered field at the observation pointQ is without reflection, so one can make a clear comparison. Figure 2 shows the E
z fields obtained by the two algorithms via large computational domains. For the proposed algorithm, different CFLNs are used, where C
F
L
N
=
Δ
t
/
Δ
t
C
F
L. It can be seen that the results of the proposed algorithm agree well with those of the conventional BOR-FDTD algorithm. Therefore, the proposed algorithm is validated further. Meanwhile, one can see that the numerical error of the proposed algorithm increases as the time step size grows.Figure 2
E
z fields at the observation point Q with the conventional BOR-FDTD and the proposed algorithm.Figure3 shows the reflection errors of the CPMLs for the conventional BOR-FDTD algorithm and the proposed algorithm, which are obtained by the E
z fields at the observation point Q. The reflection error is defined as(29)
R
d
B
=
20
log
10
⁡
E
p
m
l
t
-
E
r
e
f
t
m
a
x
E
r
e
f
t
,where E
p
m
l
(
t
) is the result obtained by the small computational domain as shown in Figure 1. E
r
e
f
(
t
) is the numerical result via large computational domain. For the proposed algorithm, E
r
e
f
(
t
) is computed separately for each CFLN. It can be seen from Figure 3 that the CPML for the one-step leapfrog LOD-BOR-FDTD algorithm shows good performance. Moreover, the reflection error of the one-step leapfrog CPML increases as the time step size grows. When C
F
L
N
=
8, the maximum reflection error is about −40 dB.Figure 3
Relative reflection errors of the CPML for the conventional BOR-FDTD and the proposed CPML for the one-step leapfrog LOD-BOR-FDTD.


## 4.1. Cavity Resonator

TheT
E
011 mode of a PEC cylindrical cavity resonator is computed, which is frequently used as a benchmark [3, 4]. The radius and height of the cavity are 3.995 cm and 7.910 cm, respectively. Its theoretical resonant frequency is 4.950 GHz [3, 4]. The computational domain is divided into 50
(
ρ
)
×
100
(
z
) cells, with Δ
ρ
=
0.0799
c
m and Δ
z
=
0.0791
c
m. The cavity is computed with the conventional BOR-FDTD algorithm, the conventional LOD-BOR-FDTD algorithm, the one-step leapfrog ADI-BOR-FDTD algorithm, and the proposed algorithm, respectively. A time history of 52.73 ns is simulated.Table2 shows the computational results with different algorithms. Note that C
F
L
N
=
Δ
t
/
Δ
t
C
F
L and Δ
t
C
F
L is the maximum time step size that satisfies the CFL condition for the conventional BOR-FDTD algorithm [1], which is Δ
t
C
F
L
=
1.318
×
1
0
-
12
s here. It can be seen from Table 2 that the one-step leapfrog LOD-BOR-FDTD algorithm obtains the same numerical results as the conventional LOD-BOR-FDTD algorithm. Moreover, the numerical errors of two algorithms increase as the time step sizes increase. In terms of the computational time, the proposed algorithm consumes about 26.5%, 25.8%, and 25.0% less time than the conventional LOD-BOR-FDTD algorithm when CFLN is chosen to be 1, 4, and 8, respectively. The two unconditionally stable algorithms use the same amount of memory, which is 1.06 MB. Therefore, one can say that the proposed algorithm preserves the properties of the conventional LOD-BOR-FDTD algorithm and obtains a higher computational efficiency. The proposed algorithm also shows the same accuracy as that of the one-step leapfrog ADI-BOR-FDTD algorithm but obtains a little higher computational efficiency, as shown in Table 2. Note that the comparison among the conventional LOD-BOR-FDTD algorithm, the one-step leapfrog ADI-BOR-FDTD algorithm, and the proposed algorithm was performed only in the case of the resonant cavity and that further analysis could be performed on other situations to rule out the possibility that the results could be linked to the particular case considered. Since the TE011 mode is computed, the terms including multiplicative factor m (mode number) in the equations are all zero. In the simulation, these terms are not computed. All of the calculations are performed on an Intel® Core™ 2 Quad CPU Q6600 @ 2.40 GHz machine and the Fortran codes are used.Table 2
Comparison of the computational results with different algorithms.
BOR-FDTD
Conventional LOD-BOR-FDTD
One-step leapfrog ADI-BOR-FDTD
One-step leapfrog LOD-BOR-FDTD
CFLN
1
1
4
8
1
4
8
1
4
8
Iterations
40000
40000
10000
5000
40000
10000
5000
40000
10000
5000
Results, GHz
4.954
4.954
4.943
4.907
4.954
4.943
4.907
4.954
4.943
4.907
Relative error
0.08%
0.08%
−0.14%
−0.87%
0.08%
−0.14%
−0.87%
0.08%
−0.14%
−0.87%
Time, s
13.2
52.8
13.2
6.4
43.2
10.9
5.5
38.8
9.8
4.8


## 4.2. Scattering Example

To validate the proposed CPML for the one-step leapfrog LOD-BOR-FDTD algorithm, the scattered field from a PEC cylinder is computed. The radius and height of the cylinder are 20 cm and 40 cm, respectively. The oblique incident plane wave with incident angleθ
i
=
4
5
° is introduced by the TF/SF boundary conditions, which are placed at ρ
=
25
c
m and z
=
±
25
c
m. The incident plane wave is parallel polarized, as shown in Figure 1. The gray domain in Figure 1 denotes the PEC cylinder. The Gaussian pulse E
0
cos
⁡
2
π
f
0
t
e
-
4
π
t
-
t
0
/
τ
2 with E
0
=
1000
V
/
m, f
0
=
0.3
G
H
z, τ
=
2.2
n
s, and t
0
=
1.25
/
f
0 is used as the incident electric field E
i. The small computational domain is composed of 40
(
ρ
)
×
80
(
z
) cells, containing the 10 PML layers in the outer boundary, which are denoted by the oblique-line-domain as shown in Figure 1. According to the characteristic of the problem, the mode number ranges from 0 to 11. The uniform grids are chosen to be Δ
ρ
=
Δ
z
=
1
c
m. Therefore, the maximum time step size for the conventional BOR-FDTD [1] is Δ
t
C
F
L
=
2.778
×
1
0
-
12
s in the example. The observation point is placed at grid point Q
(
29
,
-
29
), which is near the corner of the scattered field domain.Figure 1
Illustration of the scattering example with oblique incidence.The scattered field is computed with the conventional BOR-FDTD algorithm and the proposed algorithm, respectively, both with the CPML absorbing boundary conditions. The parameters of the CPML are chosen according to the following expressions [18]:(28a)
σ
ς
=
σ
ς
m
a
x
ς
-
ς
0
p
δ
p
(28b)
σ
ς
o
p
t
=
p
+
1
150
π
Δ
ς
(28c)
κ
ς
=
1
+
κ
ς
m
a
x
ς
-
ς
0
p
δ
p
,where ς
=
ρ
,
z
,
δ is the thickness of the PML, ς
0 is the interface between the FDTD and PML grids, and p
=
4 is the order of the polynomial. In the computing, the optimized parameters are chosen to be κ
ς
m
a
x
=
3, σ
m
a
x
=
0.4
σ
o
p
t, and α
=
0.004.To validate the one-step leapfrog LOD-BOR-FDTD algorithm further, the scattered field is computed via large computational domain first. In this case, the scattered field at the observation pointQ is without reflection, so one can make a clear comparison. Figure 2 shows the E
z fields obtained by the two algorithms via large computational domains. For the proposed algorithm, different CFLNs are used, where C
F
L
N
=
Δ
t
/
Δ
t
C
F
L. It can be seen that the results of the proposed algorithm agree well with those of the conventional BOR-FDTD algorithm. Therefore, the proposed algorithm is validated further. Meanwhile, one can see that the numerical error of the proposed algorithm increases as the time step size grows.Figure 2
E
z fields at the observation point Q with the conventional BOR-FDTD and the proposed algorithm.Figure3 shows the reflection errors of the CPMLs for the conventional BOR-FDTD algorithm and the proposed algorithm, which are obtained by the E
z fields at the observation point Q. The reflection error is defined as(29)
R
d
B
=
20
log
10
⁡
E
p
m
l
t
-
E
r
e
f
t
m
a
x
E
r
e
f
t
,where E
p
m
l
(
t
) is the result obtained by the small computational domain as shown in Figure 1. E
r
e
f
(
t
) is the numerical result via large computational domain. For the proposed algorithm, E
r
e
f
(
t
) is computed separately for each CFLN. It can be seen from Figure 3 that the CPML for the one-step leapfrog LOD-BOR-FDTD algorithm shows good performance. Moreover, the reflection error of the one-step leapfrog CPML increases as the time step size grows. When C
F
L
N
=
8, the maximum reflection error is about −40 dB.Figure 3
Relative reflection errors of the CPML for the conventional BOR-FDTD and the proposed CPML for the one-step leapfrog LOD-BOR-FDTD.


## 5. Conclusion

In this paper, the one-step leapfrog LOD-BOR-FDTD algorithm is presented. It obtains a higher computational efficiency while keeping the properties of the conventional LOD-BOR-FDTD algorithm. In addition, the CPML for the proposed algorithm is implemented. The numerical results show the performances of the one-step leapfrog LOD-BOR-FDTD algorithm and its CPML. It can be concluded that, by applying the similar procedure, the CPML for the LOD-FDTD algorithm in the Cartesian coordinate system can be implemented.



---

*Source: 8402697-2016-05-16.xml*