# Integral Equation Analysis of EM Scattering from Multilayered Metallic Photonic Crystal Accelerated with Adaptive Cross Approximation

Authors: Jianxun Su; Zengrui Li; Xujin Yuan; Yaoqing (Lamar) Yang; Junhong Wang
Journal: International Journal of Antennas and Propagation
 (2015)

---

## Abstract

A space-domain integral equation method accelerated with adaptive cross approximation (ACA) is presented for the fast and accurate analysis of electromagnetic (EM) scattering from multilayered metallic photonic crystal (MPC). The method directly solves for the electric field in order to easily enable the periodic boundary condition (PBC) in the spatial domain. The ACA is a purely algebraic method allowing the compression of fully populated matrices; hence, its formulation and implementation are independent of integral equation kernel (Green’s function). Therefore, the ACA is very well suited for accelerating integral equation analysis of periodic structure with the integral kernel of the periodic Green’s function (PGF). The computation of the spatial-domain periodic Green’s function (PGF) is accelerated by the modified Ewald transformation, such that the multilayered periodic structure can be analyzed efficiently and accurately. An effective interpolation method is also proposed to fast compute the periodic Green’s function, which can greatly reduce the time of matrix filling. Numerical examples show that the proposed method can greatly save the frequency sweep time for multilayered periodic structure.


---

## Body

## 1. Introduction

Photonic crystals [1] are periodic structures of great interest for their applications both in the microwave region and in the optical range. The main feature is the presence of frequency bands wherein the waves are highly attenuated and cannot propagate. It results from the removal of degeneracies of the free-photon states at the Bragg planes provoked by the periodicity, which produces forbidden frequency gaps so-called photonic band gaps (PBGs). This property is exploited in the electromagnetic and optical applications.Many numerical methods for computing such band structures have been adapted from solid-state physics. They include, but are not restricted to, plane-wave expansions [2], the Korringa-Kohn-Rostoker method [3], and shell methodologies [4]. Over the past two decades, finite difference time domain (FDTD) [5] has been widely used in computational optics and photonics. Recent developments include specialized versions of the finite element method (FEM) [6] and the flexible local approximation method [7]. FDTD and FEM can cope with arbitrary complicated shapes and materials. However, the radiation into unbounded regions requires either absorbing boundary conditions or perfectly matched layers, and special measures need to be taken into account when employing these conditions to the scattered field formulation. For open-region problems, integral equation/method of moments (IE/MoM) has a great advantage.The ACA is a purely algebraic method, which is independent of the kernel. The ACA was originally introduced in 2000 by Bebendorf [8] and since then has been successfully applied for integral formulations involved electromagnetic scattering [9, 10]. The integral kernel is a free space Green’s function. In addition, it is noted that most photonic crystal applications deal with two-dimensional (2D) structures that are invariant along a longitudinal axis and periodic in the transverse plane [11]. The manufacture of a 2D photonic crystal structure is easier than that of three-dimensional (3D) one [12].In this paper, a space-domain integral equation accelerated with ACA is presented for the fast and accurate analysis of electromagnetic scattering from 2D and 3D multilayered periodic structures. The ACA is first introduced for surface integral equation with the kernel of periodic Green’s function (PGF). The ACA can be applied to compress impedance matrix blocks and accelerate matrix-vector multiplication (MVP) for reducing computational complexity. A modified Ewald transformation is proposed to efficiently compute the PGFs. Compared with traditional Ewald method, it has less computational cost and can eliminate the imbalance of two Ewald sequences for multilayered periodic structure. An efficient interpolation method is also proposed to fast compute the PGFs and then accelerate impedance matrix filling. Our proposed method can effectively reduce the frequency sweep time for multilayered periodic structure involving a lot of unknowns.


## 2. Formulation

Figure1 shows the multilayered double periodic structure with identical metallic objects of arbitrary shape periodically repeated in the x
y-plane. a
⃑
1 and a
⃑
2 are the primitive lattice vectors. A
=
a
⃑
1
×
a
⃑
2 is the cross-sectional area of the unit cell. E
⃑
i
=
θ
^
cos
⁡
α
+
φ
^
sin
⁡
α
E
0
exp
⁡
-
j
β
k
^
·
r
⃑ is the incident electric field. α is the polarization angle. The wave number is β
=
ω
μ
ε and k
^
=
-
x
^
sin
⁡
θ
i
cos
⁡
φ
i
+
y
^
sin
⁡
θ
i
sin
⁡
φ
i
+
z
^
cos
⁡
θ
i. The wave vector is k
⃑
=
β
k
^ and phase shift k
⃑
t
00
=
k
⃑
t. The array is assumed to be periodic in the x
y-plane and the cell of the array is obtained by shifting the cell through the relation ρ
⃑
m
n
=
m
·
a
⃑
1
+
n
·
a
⃑
2. ρ
⃑
m
n is defined as the translation vector of the lattice.Figure 1
Multilayered periodic structure with a general skewed lattice.


### 2.1. Integral Equation

In this paper, we consider the metallic photonic crystal. LetS be the surface of a metallic object. By enforcing the boundary conditions that the total tangential electric field is zero on the perfect electric conductor (PEC) surface S, the electric field integral equation (EFIE) is given as [13](1)
j
ω
μ
∫
J
⃑
s
r
⃑
′
+
1
β
2
∇
′
·
J
⃑
s
r
⃑
′
∇
·
G
p
r
⃑
,
r
⃑
′
d
s
′
t
=
E
⃑
t
i
n
c
,where G
p is a doubly periodic Green’s function. The Rao-Wilton-Glisson (RWG) basis functions on triangular elements are employed to discretize the electric current [14]. In addition, the special basis and test functions derived from RWG basis function are introduced to ensure current continuity across the periodic boundaries [15]. The application of the Floquet-Bloch theorem reduces the computational domain of infinite periodic structures to a single unit cell but leads to the numerical evaluation of very slowly converging series.


### 2.2. Modified Ewald Transformation

We propose the following strategy to compute the spatial periodic Green’s function in an arbitrary pointu
⃑
=
r
⃑
-
r
⃑
′.Ifu
z
=
z
-
z
′
>
0.5
A, PGF is computed by its spectral representation with exponential convergence, and thus no acceleration technique is required [16]. Consider(2)
G
p
r
⃑
,
r
⃑
′
=
∑
m
=
-
∞
∞
∑
n
=
-
∞
∞
e
-
j
k
⃑
t
m
n
·
ρ
⃑
-
ρ
⃑
′
2
j
A
k
z
m
n
e
-
j
k
z
m
n
z
-
z
′
,where(3)
r
⃑
=
ρ
⃑
+
z
·
z
^
,
k
⃑
t
m
n
=
k
⃑
t
00
+
2
π
A
m
a
⃑
2
×
z
^
+
n
z
^
×
a
⃑
1is the reciprocal lattice vector. Consider(4)
k
z
m
n
=
k
0
2
-
k
⃑
t
m
n
·
k
⃑
t
m
n
,where R
e
k
z
m
n
≥
0, I
m
k
z
m
n
≤
0.Ifu
z
=
z
-
z
′
<
0.5
A, PGF is computed by the representation of Ewald transformation [17], which are two exponential converging series. Consider(5)
G
p
r
⃑
,
r
⃑
′
=
G
p
1
r
⃑
,
r
⃑
′
+
G
p
2
r
⃑
,
r
⃑
′
,where(6)
G
p
1
r
⃑
,
r
⃑
′
=
∑
m
=
-
∞
∞
∑
n
=
-
∞
∞
e
-
j
k
⃑
t
m
n
·
ρ
⃑
-
ρ
⃑
′
4
j
A
k
z
m
n
·
e
-
j
k
z
m
n
z
-
z
′
erfc
⁡
j
k
z
m
n
2
E
-
z
-
z
′
E
+
e
j
k
z
m
n
z
-
z
′
erfc
⁡
j
k
z
m
n
2
E
+
z
-
z
′
E
,
(7)
G
p
2
r
⃑
,
r
⃑
′
=
∑
m
=
-
∞
∞
∑
n
=
-
∞
∞
e
-
j
k
⃑
t
00
·
ρ
⃑
m
n
4
π
R
m
n
·
real
e
j
k
0
R
m
n
erfc
⁡
R
m
n
E
+
j
k
2
E
,where erfc
⁡
z is the complementary error function of complex argument and R
m
n
=
r
⃑
-
r
⃑
′
-
ρ
⃑
m
n.By analyzing the asymptotic behavior of the series terms, the approximation to the optimal value for general skewed lattices is given by(8)
E
=
max
⁡
π
A
,
k
2
H
,where H
2 is the maximum exponent permitted. In almost all practical cases it is sufficient to include only nine terms in (6) and (7) (i.e., the summation limits are from −1 to +1), in which the error is usually less than 0.1%.For multilayered periodic structure, whenu
z
=
z
-
z
′
>
0.5
A, the PGFs are computed by their spectral representation rather than direct Ewald transformation. In doing so there are two advantages.(1)
The spectral representation just requires evaluation of the exponential function, which is much simpler than the computation of complex-argument complementary error function (erfc
⁡). Compared with erfc
⁡
z, the computational complexity of the exponential function exp
⁡
z can be ignored.
(2)
In addition, it can eliminate the imbalance of two Ewald sequences whenu
z is too large. For the multilayered structure, the complementary error functions in the first terms m
=
n
=
0 of both Ewald series will take large imaginary arguments when u
z is too large. These two terms will have very large values that are approximately equal in amplitude, but of opposite signs, so that summing them up will lead to a severe loss of accuracy due to the finite machine precision.


### 2.3. Singularity Extraction

When the distance between the observation pointr
⃑ and the source point r
⃑
′ or one of its periodic extensions is electrically small, the contribution to Green’s function is essentially quasistatic. Usually the center distance between source and field triangles is less than 0.1
λ; then both are considered to be “near interaction.” Singular terms in (5) and (7) often arise, for example, from one of nine spatial terms R
m
n with m
,
n
=
-
1
,
0 or +1, depending on which term represents the source nearest to the observer r
⃑. By extracting its singularity [18], the PGF can be expressed as G
p
=
G
p
1
+
G
p
2
-
1
/
4
π
R
+
1
/
4
π
R. The singularity subtraction technique [19] used in this paper can compute the singularity of r
⃑
-
r
⃑
′
n (n
≥
-
3) type.Supposing the source point nearest to the observer point appears at(
1,0
) term rather than (
0,0
) term as shown in Figure 2, the primary source point can be transferred to (
1,0
) lattice. Then, the singular term always appears at (
0,0
) term G
p
2
00. The singularity of G
p
2
00 can be extracted as(9)
G
p
2
00
r
⃑
,
r
⃑
′
=
F
p
2
00
r
⃑
,
r
⃑
′
+
1
4
π
R
,where F
p
2
00 is the nonsingular part(10)
F
p
2
00
r
⃑
,
r
⃑
′
=
1
4
π
R
·
real
e
-
j
k
0
R
·
erfc
⁡
R
E
-
j
k
0
2
E
-
erfc
⁡
-
j
k
0
2
E
.As R
→
0, the result of applying L’ Hôpital’s rule on (10) is as follows: (11)
lim
R
→
0
⁡
F
p
2
00
r
⃑
,
r
⃑
′
=
1
2
π
·
real
-
j
k
0
erfc
⁡
-
j
k
0
2
E
-
2
E
π
e
k
0
2
/
4
E
2
.Figure 2
(a) Periodic image sources in triangular boundary mesh. (b) Corresponding lattice numbers.(
0,0
) lattice is the primary unit cell.
(a)
(b)


### 2.4. Interpolation of PGF

PGFs are very smooth and amenable to interpolation. Fast interpolation of PGFs can greatly reduce the time of matrix filling. The reason is that interpolating the PGF values from the table is much faster than directly computing the Ewald sums (since this has to be done for every pair of source and field triangles in the numerical integration using cubature formulas). Trilinear interpolation [20] suited for the calculation of complex-valued function with very high efficiency is applied here. As shown in Figure 3, the cuboid grouping the unit cell is equally divided into many subgrids with side length L. Yellow points are the precomputed PGFs at the corner of the subgrid. Then the three-dimensional PGF values can be obtained by trilinear interpolation: (12)
G
u
⃑
=
1
-
α
x
1
-
α
y
1
-
α
z
G
n
x
+
1
,
n
y
+
1
,
n
z
+
1
+
1
-
α
x
1
-
α
y
α
z
G
n
x
+
1
,
n
y
+
1
,
n
z
+
2
+
1
-
α
x
α
y
1
-
α
z
G
n
x
+
1
,
n
y
+
2
,
n
z
+
1
+
1
-
α
x
α
y
α
z
G
n
x
+
1
,
n
y
+
2
,
n
z
+
2
+
α
x
1
-
α
y
1
-
α
z
G
n
x
+
2
,
n
y
+
1
,
n
z
+
1
+
α
x
1
-
α
y
α
z
G
n
x
+
2
,
n
y
+
1
,
n
z
+
2
+
α
x
α
y
1
-
α
z
G
n
x
+
2
,
n
y
+
2
,
n
z
+
1
+
α
x
α
y
α
z
G
n
x
+
2
,
n
y
+
2
,
n
z
+
2
,where α
x
=
d
x
/
L, α
y
=
d
y
/
L
,
α
z
=
d
z
/
L.Figure 3
Depiction of trilinear interpolation of PGF.The relative errorε obtained by interpolating the PGFs is defined as(13)
ε
=
G
i
n
t
-
G
e
x
G
e
x
,where G
i
n
t and G
e
x are the interpolated and the exact data, respectively. The exact data are obtained by the above accelerating method with an accuracy ε
=
10
-
7. The relative errors are less than ε
=
10
-
7 and have, therefore, been neglected.Take the multilayered structure with orthogonal lattices as an example. The relative error is shown in Figure4 for the interpolation of PGF involving a series of interpolation points through the trilinear interpolation method, with various values of N
i
n
t. In Figure 4, positions (A
,
…
,
D) are the sampling points for interpolation. A very high level of accuracy is easily obtained with a relatively small number of interpolation points. The side length of the subgrid is usually fixed to 0.02
λ, and the higher interpolation accuracy ε
<
10
-
4 can be obtained.Figure 4
The relative error of a series of points. Reference structure: primitive vectora
⃑
1
=
a
⃑
2
=
0.55
λ, h
=
2.2
λ; phase shifts k
x
=
k
cos
⁡
(
45
°
), k
y
=
k
sin
⁡
(
30
°
). Accuracy reached interpolating PGFs through trilinear interpolation, with a 3D grid of N
i
n
t
×
N
i
n
t
×
2
N
i
n
t equispaced points in -
0.55
λ
<
Δ
x
<
0.55
λ, -
0.55
λ
<
Δ
y
<
0.55
λ, 0
<
Δ
z
<
2.2
λ. The data plotted refers to the straight line from 0.15
λ
,
0.15
λ
,
0 to 0.15
λ
,
0.15
λ
,
2.2
λ. The number of equally spaced sampling points is 4.


## 2.1. Integral Equation

In this paper, we consider the metallic photonic crystal. LetS be the surface of a metallic object. By enforcing the boundary conditions that the total tangential electric field is zero on the perfect electric conductor (PEC) surface S, the electric field integral equation (EFIE) is given as [13](1)
j
ω
μ
∫
J
⃑
s
r
⃑
′
+
1
β
2
∇
′
·
J
⃑
s
r
⃑
′
∇
·
G
p
r
⃑
,
r
⃑
′
d
s
′
t
=
E
⃑
t
i
n
c
,where G
p is a doubly periodic Green’s function. The Rao-Wilton-Glisson (RWG) basis functions on triangular elements are employed to discretize the electric current [14]. In addition, the special basis and test functions derived from RWG basis function are introduced to ensure current continuity across the periodic boundaries [15]. The application of the Floquet-Bloch theorem reduces the computational domain of infinite periodic structures to a single unit cell but leads to the numerical evaluation of very slowly converging series.


## 2.2. Modified Ewald Transformation

We propose the following strategy to compute the spatial periodic Green’s function in an arbitrary pointu
⃑
=
r
⃑
-
r
⃑
′.Ifu
z
=
z
-
z
′
>
0.5
A, PGF is computed by its spectral representation with exponential convergence, and thus no acceleration technique is required [16]. Consider(2)
G
p
r
⃑
,
r
⃑
′
=
∑
m
=
-
∞
∞
∑
n
=
-
∞
∞
e
-
j
k
⃑
t
m
n
·
ρ
⃑
-
ρ
⃑
′
2
j
A
k
z
m
n
e
-
j
k
z
m
n
z
-
z
′
,where(3)
r
⃑
=
ρ
⃑
+
z
·
z
^
,
k
⃑
t
m
n
=
k
⃑
t
00
+
2
π
A
m
a
⃑
2
×
z
^
+
n
z
^
×
a
⃑
1is the reciprocal lattice vector. Consider(4)
k
z
m
n
=
k
0
2
-
k
⃑
t
m
n
·
k
⃑
t
m
n
,where R
e
k
z
m
n
≥
0, I
m
k
z
m
n
≤
0.Ifu
z
=
z
-
z
′
<
0.5
A, PGF is computed by the representation of Ewald transformation [17], which are two exponential converging series. Consider(5)
G
p
r
⃑
,
r
⃑
′
=
G
p
1
r
⃑
,
r
⃑
′
+
G
p
2
r
⃑
,
r
⃑
′
,where(6)
G
p
1
r
⃑
,
r
⃑
′
=
∑
m
=
-
∞
∞
∑
n
=
-
∞
∞
e
-
j
k
⃑
t
m
n
·
ρ
⃑
-
ρ
⃑
′
4
j
A
k
z
m
n
·
e
-
j
k
z
m
n
z
-
z
′
erfc
⁡
j
k
z
m
n
2
E
-
z
-
z
′
E
+
e
j
k
z
m
n
z
-
z
′
erfc
⁡
j
k
z
m
n
2
E
+
z
-
z
′
E
,
(7)
G
p
2
r
⃑
,
r
⃑
′
=
∑
m
=
-
∞
∞
∑
n
=
-
∞
∞
e
-
j
k
⃑
t
00
·
ρ
⃑
m
n
4
π
R
m
n
·
real
e
j
k
0
R
m
n
erfc
⁡
R
m
n
E
+
j
k
2
E
,where erfc
⁡
z is the complementary error function of complex argument and R
m
n
=
r
⃑
-
r
⃑
′
-
ρ
⃑
m
n.By analyzing the asymptotic behavior of the series terms, the approximation to the optimal value for general skewed lattices is given by(8)
E
=
max
⁡
π
A
,
k
2
H
,where H
2 is the maximum exponent permitted. In almost all practical cases it is sufficient to include only nine terms in (6) and (7) (i.e., the summation limits are from −1 to +1), in which the error is usually less than 0.1%.For multilayered periodic structure, whenu
z
=
z
-
z
′
>
0.5
A, the PGFs are computed by their spectral representation rather than direct Ewald transformation. In doing so there are two advantages.(1)
The spectral representation just requires evaluation of the exponential function, which is much simpler than the computation of complex-argument complementary error function (erfc
⁡). Compared with erfc
⁡
z, the computational complexity of the exponential function exp
⁡
z can be ignored.
(2)
In addition, it can eliminate the imbalance of two Ewald sequences whenu
z is too large. For the multilayered structure, the complementary error functions in the first terms m
=
n
=
0 of both Ewald series will take large imaginary arguments when u
z is too large. These two terms will have very large values that are approximately equal in amplitude, but of opposite signs, so that summing them up will lead to a severe loss of accuracy due to the finite machine precision.


## 2.3. Singularity Extraction

When the distance between the observation pointr
⃑ and the source point r
⃑
′ or one of its periodic extensions is electrically small, the contribution to Green’s function is essentially quasistatic. Usually the center distance between source and field triangles is less than 0.1
λ; then both are considered to be “near interaction.” Singular terms in (5) and (7) often arise, for example, from one of nine spatial terms R
m
n with m
,
n
=
-
1
,
0 or +1, depending on which term represents the source nearest to the observer r
⃑. By extracting its singularity [18], the PGF can be expressed as G
p
=
G
p
1
+
G
p
2
-
1
/
4
π
R
+
1
/
4
π
R. The singularity subtraction technique [19] used in this paper can compute the singularity of r
⃑
-
r
⃑
′
n (n
≥
-
3) type.Supposing the source point nearest to the observer point appears at(
1,0
) term rather than (
0,0
) term as shown in Figure 2, the primary source point can be transferred to (
1,0
) lattice. Then, the singular term always appears at (
0,0
) term G
p
2
00. The singularity of G
p
2
00 can be extracted as(9)
G
p
2
00
r
⃑
,
r
⃑
′
=
F
p
2
00
r
⃑
,
r
⃑
′
+
1
4
π
R
,where F
p
2
00 is the nonsingular part(10)
F
p
2
00
r
⃑
,
r
⃑
′
=
1
4
π
R
·
real
e
-
j
k
0
R
·
erfc
⁡
R
E
-
j
k
0
2
E
-
erfc
⁡
-
j
k
0
2
E
.As R
→
0, the result of applying L’ Hôpital’s rule on (10) is as follows: (11)
lim
R
→
0
⁡
F
p
2
00
r
⃑
,
r
⃑
′
=
1
2
π
·
real
-
j
k
0
erfc
⁡
-
j
k
0
2
E
-
2
E
π
e
k
0
2
/
4
E
2
.Figure 2
(a) Periodic image sources in triangular boundary mesh. (b) Corresponding lattice numbers.(
0,0
) lattice is the primary unit cell.
(a)
(b)


## 2.4. Interpolation of PGF

PGFs are very smooth and amenable to interpolation. Fast interpolation of PGFs can greatly reduce the time of matrix filling. The reason is that interpolating the PGF values from the table is much faster than directly computing the Ewald sums (since this has to be done for every pair of source and field triangles in the numerical integration using cubature formulas). Trilinear interpolation [20] suited for the calculation of complex-valued function with very high efficiency is applied here. As shown in Figure 3, the cuboid grouping the unit cell is equally divided into many subgrids with side length L. Yellow points are the precomputed PGFs at the corner of the subgrid. Then the three-dimensional PGF values can be obtained by trilinear interpolation: (12)
G
u
⃑
=
1
-
α
x
1
-
α
y
1
-
α
z
G
n
x
+
1
,
n
y
+
1
,
n
z
+
1
+
1
-
α
x
1
-
α
y
α
z
G
n
x
+
1
,
n
y
+
1
,
n
z
+
2
+
1
-
α
x
α
y
1
-
α
z
G
n
x
+
1
,
n
y
+
2
,
n
z
+
1
+
1
-
α
x
α
y
α
z
G
n
x
+
1
,
n
y
+
2
,
n
z
+
2
+
α
x
1
-
α
y
1
-
α
z
G
n
x
+
2
,
n
y
+
1
,
n
z
+
1
+
α
x
1
-
α
y
α
z
G
n
x
+
2
,
n
y
+
1
,
n
z
+
2
+
α
x
α
y
1
-
α
z
G
n
x
+
2
,
n
y
+
2
,
n
z
+
1
+
α
x
α
y
α
z
G
n
x
+
2
,
n
y
+
2
,
n
z
+
2
,where α
x
=
d
x
/
L, α
y
=
d
y
/
L
,
α
z
=
d
z
/
L.Figure 3
Depiction of trilinear interpolation of PGF.The relative errorε obtained by interpolating the PGFs is defined as(13)
ε
=
G
i
n
t
-
G
e
x
G
e
x
,where G
i
n
t and G
e
x are the interpolated and the exact data, respectively. The exact data are obtained by the above accelerating method with an accuracy ε
=
10
-
7. The relative errors are less than ε
=
10
-
7 and have, therefore, been neglected.Take the multilayered structure with orthogonal lattices as an example. The relative error is shown in Figure4 for the interpolation of PGF involving a series of interpolation points through the trilinear interpolation method, with various values of N
i
n
t. In Figure 4, positions (A
,
…
,
D) are the sampling points for interpolation. A very high level of accuracy is easily obtained with a relatively small number of interpolation points. The side length of the subgrid is usually fixed to 0.02
λ, and the higher interpolation accuracy ε
<
10
-
4 can be obtained.Figure 4
The relative error of a series of points. Reference structure: primitive vectora
⃑
1
=
a
⃑
2
=
0.55
λ, h
=
2.2
λ; phase shifts k
x
=
k
cos
⁡
(
45
°
), k
y
=
k
sin
⁡
(
30
°
). Accuracy reached interpolating PGFs through trilinear interpolation, with a 3D grid of N
i
n
t
×
N
i
n
t
×
2
N
i
n
t equispaced points in -
0.55
λ
<
Δ
x
<
0.55
λ, -
0.55
λ
<
Δ
y
<
0.55
λ, 0
<
Δ
z
<
2.2
λ. The data plotted refers to the straight line from 0.15
λ
,
0.15
λ
,
0 to 0.15
λ
,
0.15
λ
,
2.2
λ. The number of equally spaced sampling points is 4.


## 3. ACA Technique

Let them
×
n rectangular matrix Z
m
×
n represent the coupling between two well-separated groups in the MoM computation. The ACA algorithm aims to accurately approximate Z
m
×
n by a low-rank matrix Z
~
m
×
n. In particular, the ACA algorithm constructs the approximate matrix Z
~
m
×
n through a product form. Namely,(14)
Z
~
m
×
n
=
U
m
×
r
V
r
×
n
=
∑
i
=
1
r
u
m
×
1
i
v
n
×
1
i
,where r is the rank of Z
~
m
×
n or the effective rank of the matrix Z
m
×
n; U
m
×
r and V
r
×
n are two dense rectangular matrices; u
m
×
1
i is the column ith of U; and v
n
×
1
i is the row ith of V, respectively. The goal of ACA is to achieve(15)
Z
m
×
n
-
Z
~
m
×
n
F
≤
ε
Z
m
×
n
Ffor a given tolerance ε. Note that in this paper · refers to the matrix Frobenus norm [9].The ACA technique is numerically based on the principle of the approximation above but does not need to know all terms ofZ
m
×
n. Indeed, only r rows and r columns are calculated during the algorithm allowing a significant reduction in the number of integral computations to perform. Therefore, not only is the memory requirement reduced but the assembly time is also saved. Yet, if we agree to deal with the MVP U
m
×
r
V
r
×
n
b
n
×
1 instead of the exact value of Z
m
×
n
b
n
×
1, the number of operations needed is also remarkably reduced by performing U
m
×
r
V
r
×
n
b
n
×
1. Thus, if an iterative solver is used, one can accelerate matrix vector multiply and save once again the computation time [10].The compression rateη of matrix block Z
m
×
n, which denotes the memory saved by using ACA, can be expressed as (16)
η
%
=
1
-
r
·
m
+
n
m
·
n
·
100
%
.Obviously, the approximation by ACA approach above is useful only if r
<
(
1
/
2
)
·
min
⁡
{
m
,
n
}, where Z
m
×
n presents similar values. For the electromagnetic application, the effective rank r
<
min
⁡
(
m
,
n
). Therefore, instead of storing entire m
×
n entries, the algorithm only requires storing m
+
n
×
r entries.


## 4. Numerical Results

The EFIE and ACA approaches to PEC are implemented using Fortran-95 language. Numerical experiments run on a PC with Intel i5-2400 3.1 GHz CPU and 16 GB RAM. The resulting impedance matrices are iteratively solved by using the transpose-free quasi-minimal residual (TFQMR) solver with diagonal preconditioning [21]; the relative error tolerance is set to be 10−3.


### 4.1. Infinite Metallic Rod

As a 2D example, we study the scattering properties of a photonic band gap (PBG) structure consisting of infinite metallic rod [17]. Each unit cell consists of two infinitely long metallic rods. The inset of Figure 5 is two meshed cylinders in a unit cell. The axis of each cylinder is along x-direction: a
⃑
1
=
x
^ 6 mm and a
⃑
2
=
y
^ 6 mm. Each cylinder has the radius 0.6 mm and length 6 mm. The space between two cylinders is 6 mm. Each cylinder was discretized into 494 triangle facets with 741 unknowns to ensure accurate results obtained in the entire frequency band. Figure 5 shows the magnitude of the transmission and reflection coefficients for the Floquet TM00 mode with the electric field oriented in the x-direction. Our results agree well with the reference results obtained using 2D IE approach [15]. The results converged for 9 terms in both Ewald sums and there are 1482 unknowns for the geometry. The time for matrix filling and solving is 0.58 s and 0.21 s per frequency point, respectively. In ACA, the box size is 6
×
6
×
6mm3; that is, each box includes one cylinder. If the trilinear interpolation method is not used, the time of matrix filling would increase dramatically to 128.6 s. Therefore, trilinear interpolation of PGFs can reduce the time of matrix filling by more than 99.5%.Figure 5
Reflection and transmission coefficient of two-layer rod PBG.Next, the number of layers increases from 2 to 5, 10 and 21, respectively. Figure6 shows the transmission coefficient of multilayered structure. The transmission coefficient curves exhibit the typical resonances of photonic band gap materials. It can be seen that the null of transmission becomes deeper as the layer number increases. The total solution times for per frequency point are 5.1 s, 12.4 s, and 32.5 s, respectively.Figure 6
Transmission coefficient of multilayered PBG.The 21-layer structure is meshed into 10374 triangle facets with 15561 unknowns. The compression rateη of matrix block is shown in Table 1. The times for matrix filling and matrix solving are 23.8 s and 8.7 s per frequency point, respectively. The corresponding times of direct solution by MoM without ACA acceleration are 187.6 s and 75.2 s per frequency point, respectively. Obviously, ACA can greatly reduce the total solution time, especially for frequency sweeping.Table 1
Compression rateη (%) of matrix block.
Z
1,1
Z
1,2
Z
1,3
Z
1,4
Z
1,5
Z
1,6
Z
1,7
—
20.78
8.64
5.40
5.94
5.67
4.86
Z
1,8
Z
1,9
Z
1,10
Z
1,11
Z
1,12
Z
1,13
Z
1,14
6.21
5.67
4.05
3.51
3.78
4.59
4.32
Z
1,15
Z
1,16
Z
1,17
Z
1,18
Z
1,19
Z
1,20
Z
1,21
4.86
5.40
4.32
3.78
4.05
3.24
3.51
— denotes the matrix block calculated directly by MoM.


### 4.2. Woodpile

A 3D example showing the inset in Figure7 is a woodpile MPC with w
=
200 nm, h
=
300 nm and in-layer lattice constant d
=
1 μm. The incident wave is a TE polarized (i.e., E parallel to the top metallic layer) plane wave through the stacking direction. The number of layers are 4, 8, and 16, respectively. Two intersecting metallic pipes are considered to be fully contacting with each other in numerical modeling. The ACA box size is 1
×
1
×
0.3 μ
m
3. The reflection coefficients are shown in Figure 7. Almost the same result is obtained for TM polarization. Our numerical results agree well with that of Ansys HFSS. Previous results reported by other studies [12, 22] for a similar kind of the structural geometry also validate our calculated results. For the 16-layer MPC with 13149 unknowns (8766 triangle facets), the times for matrix filling and linear system solving are 40.3 s and 15.2 s per frequency point, respectively. The corresponding times of direct solution by MoM without ACA acceleration are 132.3 s and 92.5 s, respectively.Figure 7
Reflection spectra for multilayered woodpile MPC.


## 4.1. Infinite Metallic Rod

As a 2D example, we study the scattering properties of a photonic band gap (PBG) structure consisting of infinite metallic rod [17]. Each unit cell consists of two infinitely long metallic rods. The inset of Figure 5 is two meshed cylinders in a unit cell. The axis of each cylinder is along x-direction: a
⃑
1
=
x
^ 6 mm and a
⃑
2
=
y
^ 6 mm. Each cylinder has the radius 0.6 mm and length 6 mm. The space between two cylinders is 6 mm. Each cylinder was discretized into 494 triangle facets with 741 unknowns to ensure accurate results obtained in the entire frequency band. Figure 5 shows the magnitude of the transmission and reflection coefficients for the Floquet TM00 mode with the electric field oriented in the x-direction. Our results agree well with the reference results obtained using 2D IE approach [15]. The results converged for 9 terms in both Ewald sums and there are 1482 unknowns for the geometry. The time for matrix filling and solving is 0.58 s and 0.21 s per frequency point, respectively. In ACA, the box size is 6
×
6
×
6mm3; that is, each box includes one cylinder. If the trilinear interpolation method is not used, the time of matrix filling would increase dramatically to 128.6 s. Therefore, trilinear interpolation of PGFs can reduce the time of matrix filling by more than 99.5%.Figure 5
Reflection and transmission coefficient of two-layer rod PBG.Next, the number of layers increases from 2 to 5, 10 and 21, respectively. Figure6 shows the transmission coefficient of multilayered structure. The transmission coefficient curves exhibit the typical resonances of photonic band gap materials. It can be seen that the null of transmission becomes deeper as the layer number increases. The total solution times for per frequency point are 5.1 s, 12.4 s, and 32.5 s, respectively.Figure 6
Transmission coefficient of multilayered PBG.The 21-layer structure is meshed into 10374 triangle facets with 15561 unknowns. The compression rateη of matrix block is shown in Table 1. The times for matrix filling and matrix solving are 23.8 s and 8.7 s per frequency point, respectively. The corresponding times of direct solution by MoM without ACA acceleration are 187.6 s and 75.2 s per frequency point, respectively. Obviously, ACA can greatly reduce the total solution time, especially for frequency sweeping.Table 1
Compression rateη (%) of matrix block.
Z
1,1
Z
1,2
Z
1,3
Z
1,4
Z
1,5
Z
1,6
Z
1,7
—
20.78
8.64
5.40
5.94
5.67
4.86
Z
1,8
Z
1,9
Z
1,10
Z
1,11
Z
1,12
Z
1,13
Z
1,14
6.21
5.67
4.05
3.51
3.78
4.59
4.32
Z
1,15
Z
1,16
Z
1,17
Z
1,18
Z
1,19
Z
1,20
Z
1,21
4.86
5.40
4.32
3.78
4.05
3.24
3.51
— denotes the matrix block calculated directly by MoM.


## 4.2. Woodpile

A 3D example showing the inset in Figure7 is a woodpile MPC with w
=
200 nm, h
=
300 nm and in-layer lattice constant d
=
1 μm. The incident wave is a TE polarized (i.e., E parallel to the top metallic layer) plane wave through the stacking direction. The number of layers are 4, 8, and 16, respectively. Two intersecting metallic pipes are considered to be fully contacting with each other in numerical modeling. The ACA box size is 1
×
1
×
0.3 μ
m
3. The reflection coefficients are shown in Figure 7. Almost the same result is obtained for TM polarization. Our numerical results agree well with that of Ansys HFSS. Previous results reported by other studies [12, 22] for a similar kind of the structural geometry also validate our calculated results. For the 16-layer MPC with 13149 unknowns (8766 triangle facets), the times for matrix filling and linear system solving are 40.3 s and 15.2 s per frequency point, respectively. The corresponding times of direct solution by MoM without ACA acceleration are 132.3 s and 92.5 s, respectively.Figure 7
Reflection spectra for multilayered woodpile MPC.


## 5. Conclusion

An integral equation accelerated with adaptive cross approximation (ACA) is proposed for the analysis of multilayered metallic photonic crystal. The ACA is a purely algebraic and kernel independent algorithm. It is verified to be suited for accelerating integral equation analysis of periodic structure. The ACA can be applied to compress impedance matrix blocks and accelerate MVP for reducing computational complexity. A modified Ewald transformation and an efficient interpolation method are also proposed to fast compute the periodic Green’s function; hence, that can greatly reduce the time of matrix filling. Numerical results confirm the validity and accuracy of the proposed method. In our next stage of research, ACA will be applied to accelerate hybrid field integral equation for arbitrarily complex multilayered periodic structure composed of metal and dielectric materials with more unknowns.



---

*Source: 274307-2015-08-04.xml*