• 沒有找到結果。

FAME-matlab Package: Fast Algorithm for Maxwell Equations

N/A
N/A
Protected

Academic year: 2022

Share "FAME-matlab Package: Fast Algorithm for Maxwell Equations"

Copied!
47
0
0

加載中.... (立即查看全文)

全文

(1)

FAME-matlab Package: Fast Algorithm for Maxwell Equations

Tsung-Ming Huang


Modelling, Simulation and Analysis of

Nonlinear Optics, NUK, September, 4-8, 2015

1

(2)

2

(3)

3

FAME group

2

Wen-Wei Lin

Department of Applied Mathematics National Chiao-Tung University

Weichung Wang

Department of Mathematics National Taiwan University

Han-En Hsieh(謝函恩)

Department of Mathematics National Taiwan University

Chien-Chih Huang(黃建智)

Department of Mathematics

National Taiwan Normal University

(4)

F ast A lgorithm for M axwell E q

4

FAME

FAME. m

FAME. mpi

FAME. GPU

(5)

FAME

5

Eigen-solvers (JD, SIRA)

Dispersive Metallic

materials Complex materials Photonic Crystals

Simple Cubic Face-Centered Cubic

∇ × ∇ × E(r) = λε (r)E(r) ∇ × ∇ × E(r) = ω 2 ε (r, ω )E(r) ∇ × 0 ∇ × 0 H E ⎥ = i ω ζ ε µ ξ

⎣ ⎢

⎦ ⎥

E H

⎣ ⎢ ⎤

⎦ ⎥

employing projections onto the range space of the discrete matrix. (However, it is noted that the problem of many zeros does not occur in the PWE as in each plane wave component the number of polarizations is chosen to be the independent two rather three.) (iii) As the third issue of importance, it is of great interest to develop a fast algorithm for the eigenvalue problem. An inverse method, accelerated by multigrid technique with use of projection is proposed for this purpose. The method exploits the sparsity of the matrix for the eigenvalue problem in the finite difference formu- lation. Because of the above mentioned difficulties, the present method is a nontrivial extension of a similar method, recently developed by the authors24)for computing photonic band structures in two dimensions.

In this study, we compute the band structures for three types of photonic structures. The first one is a modified simple cubic lattice consisting of dielectric spheres on the lattice sites, each connected to its six nearest neighbors by thin circular cylinders, which was proposed by Biswas et al.25)Figure 1 shows the modified simple cubic lattice. It is noted that the original simple cubic structure comprising a lattice of rods has been fabricated recently with advanced silicon processing techniques.26)The second one is the tetragonal square spiral structure comprising a lattice of circular or square cylinders, which was proposed by Toader and John,27,28)as shown in Fig. 2. Spiral structure was discussed previously by Chutinan and Noda.29)The square spiral structure is arranged to connect the lattice points of diamond structure with specific order, and is amenable to the current technique of fabrication GLAD (GLancing Angle Deposition) as discussed in refs. 30 and 31. As a third example, we propose a diamond structure that has sp3-like configuration, composed of dielectric spheres with connect- ing spheroids, as shown in Fig. 3. Diamond structures are known to have large band gaps between relatively lower branches either in diamond network or inverse diamond structure.12,28)In the present study, the spheroids, instead of circular cylinders, take the positions of ‘‘valence bonds’’ to imitate the sp3structure of the electrons of diamond atoms.

Recently, submicron diamond-lattice photonic crystals have been successfully produced by two-photon laser nanofabri-

cation (photopolymerization).32)

The order of presentation of the paper is organized as follows. In §2, we show how to correctly formulate the finite difference method for the double curl operator of the photonic eigenvalue problem. In §3, we develop the numerical method (inverse iteration with the full multigrid acceleration) and present the fast algorithm, in which two alternative methods of projection are proposed to avoid the necessity of deflating zeros). In §4, we first present numerical results that illustrate the efficiency of the presently developed method. Then, the band structures are computed for the modified simple cubic lattice, the tetrag- onal square spiral structure (direct and inverse structure) and the diamond structure with sp3-like configuration. Finally, concluding remarks with a summary of results are drawn in

§5.

2. Basic Equations and Finite Difference Formulation The electromagnetic waves propagating in the photonic crystals are well described by Maxwell’s equations. For linear isotropic and frequency-independent dielectric mate- rials with permeability close to one, the time-harmonic Fig. 1. Modified simple cubic lattice comprising dielectric spheres and

connecting thin circular cylinders.25)

Fig. 2. Tetragonal square spiral structure comprising circular cylin- ders.27,28)

Fig. 3. diamond structure with sp3-like configuration comprising dielec- tric spheres and connecting spheroids.

728 J. Phys. Soc. Jpn., Vol. 73, No. 3, March, 2004 R. L. CHERNet al.

employing projections onto the range space of the discrete matrix. (However, it is noted that the problem of many zeros does not occur in the PWE as in each plane wave component the number of polarizations is chosen to be the independent two rather three.) (iii) As the third issue of importance, it is of great interest to develop a fast algorithm for the eigenvalue problem. An inverse method, accelerated by multigrid technique with use of projection is proposed for this purpose. The method exploits the sparsity of the matrix for the eigenvalue problem in the finite difference formu- lation. Because of the above mentioned difficulties, the present method is a nontrivial extension of a similar method, recently developed by the authors24)for computing photonic band structures in two dimensions.

In this study, we compute the band structures for three types of photonic structures. The first one is a modified simple cubic lattice consisting of dielectric spheres on the lattice sites, each connected to its six nearest neighbors by thin circular cylinders, which was proposed by Biswas et al.25)Figure 1 shows the modified simple cubic lattice. It is noted that the original simple cubic structure comprising a lattice of rods has been fabricated recently with advanced silicon processing techniques.26) The second one is the tetragonal square spiral structure comprising a lattice of circular or square cylinders, which was proposed by Toader and John,27,28) as shown in Fig. 2. Spiral structure was discussed previously by Chutinan and Noda.29)The square spiral structure is arranged to connect the lattice points of diamond structure with specific order, and is amenable to the current technique of fabrication GLAD (GLancing Angle Deposition) as discussed in refs. 30 and 31. As a third example, we propose a diamond structure that has sp3-like configuration, composed of dielectric spheres with connect- ing spheroids, as shown in Fig. 3. Diamond structures are known to have large band gaps between relatively lower branches either in diamond network or inverse diamond structure.12,28)In the present study, the spheroids, instead of circular cylinders, take the positions of ‘‘valence bonds’’ to imitate the sp3structure of the electrons of diamond atoms.

Recently, submicron diamond-lattice photonic crystals have been successfully produced by two-photon laser nanofabri-

cation (photopolymerization).32)

The order of presentation of the paper is organized as follows. In §2, we show how to correctly formulate the finite difference method for the double curl operator of the photonic eigenvalue problem. In §3, we develop the numerical method (inverse iteration with the full multigrid acceleration) and present the fast algorithm, in which two alternative methods of projection are proposed to avoid the necessity of deflating zeros). In §4, we first present numerical results that illustrate the efficiency of the presently developed method. Then, the band structures are computed for the modified simple cubic lattice, the tetrag- onal square spiral structure (direct and inverse structure) and the diamond structure with sp3-like configuration. Finally, concluding remarks with a summary of results are drawn in

§5.

2. Basic Equations and Finite Difference Formulation The electromagnetic waves propagating in the photonic crystals are well described by Maxwell’s equations. For linear isotropic and frequency-independent dielectric mate- rials with permeability close to one, the time-harmonic Fig. 1. Modified simple cubic lattice comprising dielectric spheres and

connecting thin circular cylinders.25)

Fig. 2. Tetragonal square spiral structure comprising circular cylin- ders.27,28)

Fig. 3. diamond structure with sp3-like configuration comprising dielec- tric spheres and connecting spheroids.

728 J. Phys. Soc. Jpn., Vol. 73, No. 3, March, 2004 R. L. CHERNet al.

(6)

Generalized eigenvalue problems for 3D

photonic crystal

6

(7)

Curl operator

Central edge points


Central face points 


where



 
 
 


Resulting generalized eigenvalue problem



 


with diagonal B


7

∇ × ∇ × E(r) = ω 2 ε (r)E(r)

∇ × E(r) = H(r) ⇒ Ce = h

∇ × H(r) = ω 2 ε (r)E(r) ⇒ C h = ω 2 B e

∇ × E =

0 − ∂

∂z

∂y

∂z 0 − ∂

∂x

− ∂ ∂y

∂x 0

⎢ ⎢

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

⎥ ⎥

E

1

E

2

E

3

⎢ ⎢

⎥ ⎥

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

⎥ ∈! 3n×3n

C 1 = I n 2 n 3 ⊗ K 1 ∈! n ×n , C 2 = I n 3 ⊗ K 2 ∈! n ×n , C 3 = K 3 ∈! n ×n

C C − ω 2 B

( ) x ≡ A − ( λ B ) x = 0

(8)

Finite Diff. Assoc. with Quasi-Periodic Cond.

8

K 1 = 1 δ x

−1 1

! ! −1 1 e ı2 π k⋅a 1 −1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n 1 ×n 1 ,

K 2 = 1 δ y

−I n 1 I n 1

! !

−I n 1 I n

1

e ı2 π k⋅a 2 J 2 −I n 1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! (n 1 n 2 )×(n 1 n 2 ) ,

K 3 = 1 δ z

−I n 1 n 2 I n 1 n 2

! !

−I n 1 n 2 I n

1 n 2

e ı2 π k⋅a 3 J 3 −I n 1 n 2

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n×n

(9)

Finite Diff. Assoc. with Quasi-Periodic Cond.

8

K 1 = 1 δ x

−1 1

! ! −1 1 e ı2 π k⋅a 1 −1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n 1 ×n 1 ,

K 2 = 1 δ y

−I n 1 I n 1

! !

−I n 1 I n

1

e ı2 π k⋅a 2 J 2 −I n 1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! (n 1 n 2 )×(n 1 n 2 ) ,

K 3 = 1 δ z

−I n 1 n 2 I n 1 n 2

! !

−I n 1 n 2 I n

1 n 2

e ı2 π k⋅a 3 J 3 −I n 1 n 2

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n×n

E(r + a ) = e i2 π k⋅a E(r)

(10)

Finite Diff. Assoc. with Quasi-Periodic Cond.

8

K 1 = 1 δ x

−1 1

! ! −1 1 e ı2 π k⋅a 1 −1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n 1 ×n 1 ,

K 2 = 1 δ y

−I n 1 I n 1

! !

−I n 1 I n

1

e ı2 π k⋅a 2 J 2 −I n 1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! (n 1 n 2 )×(n 1 n 2 ) ,

K 3 = 1 δ z

−I n 1 n 2 I n 1 n 2

! !

−I n 1 n 2 I n

1 n 2

e ı2 π k⋅a 3 J 3 −I n 1 n 2

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n×n

(11)

Finite Diff. Assoc. with Quasi-Periodic Cond.

8

K 1 = 1 δ x

−1 1

! ! −1 1 e ı2 π k⋅a 1 −1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n 1 ×n 1 ,

K 2 = 1 δ y

−I n 1 I n 1

! !

−I n 1 I n

1

e ı2 π k⋅a 2 J 2 −I n 1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! (n 1 n 2 )×(n 1 n 2 ) ,

K 3 = 1 δ z

−I n 1 n 2 I n 1 n 2

! !

−I n 1 n 2 I n

1 n 2

e ı2 π k⋅a 3 J 3 −I n 1 n 2

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n×n

J 2 = I n 1 , J 3 = I n 1 n 2

For SC lattice

(12)

Finite Diff. Assoc. with Quasi-Periodic Cond.

8

K 1 = 1 δ x

−1 1

! ! −1 1 e ı2 π k⋅a 1 −1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n 1 ×n 1 ,

K 2 = 1 δ y

−I n 1 I n 1

! !

−I n 1 I n

1

e ı2 π k⋅a 2 J 2 −I n 1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! (n 1 n 2 )×(n 1 n 2 ) ,

K 3 = 1 δ z

−I n 1 n 2 I n 1 n 2

! !

−I n 1 n 2 I n

1 n 2

e ı2 π k⋅a 3 J 3 −I n 1 n 2

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! n×n

J 2 = I n 1 , J 3 = I n 1 n 2

For SC lattice

J 2 = 0 e −ı2 πk⋅a 1 I n

1 /2

I n

1 /2 0

⎢ ⎢

⎥ ⎥ ∈! n 1 ×n 1 ,

J 3 =

0 e −ı2πk⋅a 2 I 1

3 n 2 ⊗ I n

1

I 2

3 n 2 ⊗ J 2 0

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! (n 1 n 2 )×(n 1 n 2 )

For FCC lattice

(13)

Power method

Let be the eigenpairs of A where
 is linearly independent

For any nonzero vector u


Since , we have


If for i >1 and , then


Given shift value

9

( λ i , x i ) for i = 1,…,n

x 1 , …, x n

u = α 1 x 1 +!+ α n x n

A k x i = λ i k x i

A k u = α 1 λ 1 k x 1 +!+ α n λ n k x n

λ 1 > λ i α 1 ≠ 0

1 λ 1 k A

k u = α 1 x 1 + ( λ 2 λ 1 )

k α 2 x 2 +!+ α n ( λ n λ 1 )

k x n → α 1 x 1 as k → ∞

(A − σ I ) −1

{ } k u = α 1 { ( λ 1 σ ) −1 } k x 1 +!+ α n { ( λ n σ ) −1 } k x n

(14)

Solving

Use shift-and-invert Lanczos method

In each iteration of shift-and-invert Lanczos method, we need to solve


How to efficiently solve this linear system?


10

A − λ B

( ) x = 0

(A − σ B)y = b

(15)

Solving linear system

11

(A − σ B)y = b

(16)

Solve

Direct method (Gaussian elimination)


Iterative method

Matrix vector multiplication with Preconditioner M


sol = bicgstabl(coef_mtx, rhs, tol, maxit,

@(x)SSOR_prec(x, diag_coef_mtx, lower_L));

12

(A − σ B)y = b

y = (A − σ B) \ b

A − σ B

(17)

Solve

Direct method (Gaussian elimination)


Iterative method

Matrix vector multiplication with Preconditioner M


sol = bicgstabl(coef_mtx, rhs, tol, maxit,

@(x)SSOR_prec(x, diag_coef_mtx, lower_L));

12

(A − σ B)y = b

y = (A − σ B) \ b

A − σ B

Demo performance

(18)

Eigen-decomp. of C 1 , C 2 , C 3 for SC lattice

Define



 
 
 


Define unitary matrix T as



 


Then it holds that



 
 


13

D a,m = diag 1,e ( θ a ,m , !,e (m −1) θ a ,m ) , Λ a,m = diag e ( θ m ,1 + θ a ,m −1 ! e θ m ,m + θ a ,m −1 ) ,

U m =

1 1 ! 1

e θ m ,1 e θ m ,2 ! 1

! ! !

e (m−1) θ m ,1 e (m−1) θ m ,2 ! 1

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

∈! m×m , θ a,m = ı2 π k ⋅a

m , θ m,i = ı2 π i m

T = 1

n D a

3 ,n 3 ⊗ D a 2 ,n 2 ⊗ D a 1 ,n 1

( ) ( U n 3 ⊗U n 2 ⊗U n 1 )

C 1 T = δ x −1 T I ( n 3 ⊗ I n 2 ⊗ Λ a 1 ,n 1 ) ≡ T Λ 1 ,

C 2 T = δ y −1 T I ( n 3 ⊗ Λ a 2 ,n 2 ⊗ I n 1 ) ≡ T Λ 2 ,

C 3 T = δ z −1 T ( Λ a 3 ,n 3 ⊗ I n 2 ⊗ I n 1 ) ≡ T Λ 3

employing projections onto the range space of the discrete matrix. (However, it is noted that the problem of many zeros does not occur in the PWE as in each plane wave component the number of polarizations is chosen to be the independent two rather three.) (iii) As the third issue of importance, it is of great interest to develop a fast algorithm for the eigenvalue problem. An inverse method, accelerated by multigrid technique with use of projection is proposed for this purpose. The method exploits the sparsity of the matrix for the eigenvalue problem in the finite difference formu- lation. Because of the above mentioned difficulties, the present method is a nontrivial extension of a similar method, recently developed by the authors24)for computing photonic band structures in two dimensions.

In this study, we compute the band structures for three types of photonic structures. The first one is a modified simple cubic lattice consisting of dielectric spheres on the lattice sites, each connected to its six nearest neighbors by thin circular cylinders, which was proposed by Biswas et al.25)Figure 1 shows the modified simple cubic lattice. It is noted that the original simple cubic structure comprising a lattice of rods has been fabricated recently with advanced silicon processing techniques.26)The second one is the tetragonal square spiral structure comprising a lattice of circular or square cylinders, which was proposed by Toader and John,27,28)as shown in Fig. 2. Spiral structure was discussed previously by Chutinan and Noda.29)The square spiral structure is arranged to connect the lattice points of diamond structure with specific order, and is amenable to the current technique of fabrication GLAD (GLancing Angle Deposition) as discussed in refs. 30 and 31. As a third example, we propose a diamond structure that has sp3-like configuration, composed of dielectric spheres with connect- ing spheroids, as shown in Fig. 3. Diamond structures are known to have large band gaps between relatively lower branches either in diamond network or inverse diamond structure.12,28)In the present study, the spheroids, instead of circular cylinders, take the positions of ‘‘valence bonds’’ to imitate the sp3structure of the electrons of diamond atoms.

Recently, submicron diamond-lattice photonic crystals have been successfully produced by two-photon laser nanofabri-

cation (photopolymerization).32)

The order of presentation of the paper is organized as follows. In §2, we show how to correctly formulate the finite difference method for the double curl operator of the photonic eigenvalue problem. In §3, we develop the numerical method (inverse iteration with the full multigrid acceleration) and present the fast algorithm, in which two alternative methods of projection are proposed to avoid the necessity of deflating zeros). In §4, we first present numerical results that illustrate the efficiency of the presently developed method. Then, the band structures are computed for the modified simple cubic lattice, the tetrag- onal square spiral structure (direct and inverse structure) and the diamond structure with sp3-like configuration. Finally, concluding remarks with a summary of results are drawn in

§5.

2. Basic Equations and Finite Difference Formulation The electromagnetic waves propagating in the photonic crystals are well described by Maxwell’s equations. For linear isotropic and frequency-independent dielectric mate- rials with permeability close to one, the time-harmonic Fig. 1. Modified simple cubic lattice comprising dielectric spheres and

connecting thin circular cylinders.25) Fig. 2. Tetragonal square spiral structure comprising circular cylin- ders.27,28)

Fig. 3. diamond structure with sp3-like configuration comprising dielec- tric spheres and connecting spheroids.

728 J. Phys. Soc. Jpn., Vol. 73, No. 3, March, 2004 R. L. CHERNet al.

(19)

Eigen-decomp. of C 1 , C 2 , C 3 for FCC lattice

Define 



 
 
 


Define unitary matrix T as



 
 
 
 


Then it holds that



 


14

x i = D x U n 1 (:,i), y i, j = D y,i U n 2 (:, j)

T = 1

nT 1 T 2 ! T n 1

⎣⎢ ⎤

⎦⎥ ∈! n ×n , T i = Ti,1 T i,2 ! T i,n 2

⎣⎢ ⎤

⎦⎥ ∈! n ×(n 2 n 3 ) , T i, j = D z,i + j U n

( 3 ) ⊗ y ( i, j ⊗ x i )

C 1 T = T Λ ( n 1 ⊗ I n 2 n 3 ) ≡ T Λ 1 ,

C 2 T = T ⊕ ( ( i=1 n 1 Λ i,n 2 ) ⊗ I n 3 ) ≡ T Λ 2 ,

C 3 T = T ⊕ ( i=1 n 1n j =1 2 Λ i, j,n 3 ) ≡ T Λ 3

ψ x = ı2 π k ⋅a 1

n 1 , D x = diag 1,e ( ψ

x

, !,e (n

1

−1) ψ

x

) ,

ψ y,i = ı2 π

n 2 k ⋅ a 2a 1 2

⎛ ⎝⎜ ⎞

⎠⎟ − i 2

⎧ ⎨

⎫ ⎬

⎭ , D y,i = diag 1,e ( ψ

y ,i

, !,e (n

2

−1) ψ

y ,i

) ,

ψ z,i+ j = ı2 π

n 3 k ⋅ a 3a 1 + a 2 3

⎛ ⎝⎜ ⎞

⎠⎟ −

i + j 3

⎧ ⎨

⎫ ⎬

, D z,i+ j = diag 1,e ( ψ

y ,i+ j

, !,e (n

3

−1) ψ

y ,i+ j

)

employing projections onto the range space of the discrete matrix. (However, it is noted that the problem of many zeros does not occur in the PWE as in each plane wave component the number of polarizations is chosen to be the independent two rather three.) (iii) As the third issue of importance, it is of great interest to develop a fast algorithm for the eigenvalue problem. An inverse method, accelerated by multigrid technique with use of projection is proposed for this purpose. The method exploits the sparsity of the matrix for the eigenvalue problem in the finite difference formu- lation. Because of the above mentioned difficulties, the present method is a nontrivial extension of a similar method, recently developed by the authors24)for computing photonic band structures in two dimensions.

In this study, we compute the band structures for three types of photonic structures. The first one is a modified simple cubic lattice consisting of dielectric spheres on the lattice sites, each connected to its six nearest neighbors by thin circular cylinders, which was proposed by Biswas et al.25)Figure 1 shows the modified simple cubic lattice. It is noted that the original simple cubic structure comprising a lattice of rods has been fabricated recently with advanced silicon processing techniques.26) The second one is the tetragonal square spiral structure comprising a lattice of circular or square cylinders, which was proposed by Toader and John,27,28)as shown in Fig. 2. Spiral structure was discussed previously by Chutinan and Noda.29)The square spiral structure is arranged to connect the lattice points of diamond structure with specific order, and is amenable to the current technique of fabrication GLAD (GLancing Angle Deposition) as discussed in refs. 30 and 31. As a third example, we propose a diamond structure that has sp3-like configuration, composed of dielectric spheres with connect- ing spheroids, as shown in Fig. 3. Diamond structures are known to have large band gaps between relatively lower branches either in diamond network or inverse diamond structure.12,28)In the present study, the spheroids, instead of circular cylinders, take the positions of ‘‘valence bonds’’ to imitate the sp3structure of the electrons of diamond atoms.

Recently, submicron diamond-lattice photonic crystals have been successfully produced by two-photon laser nanofabri-

cation (photopolymerization).32)

The order of presentation of the paper is organized as follows. In §2, we show how to correctly formulate the finite difference method for the double curl operator of the photonic eigenvalue problem. In §3, we develop the numerical method (inverse iteration with the full multigrid acceleration) and present the fast algorithm, in which two alternative methods of projection are proposed to avoid the necessity of deflating zeros). In §4, we first present numerical results that illustrate the efficiency of the presently developed method. Then, the band structures are computed for the modified simple cubic lattice, the tetrag- onal square spiral structure (direct and inverse structure) and the diamond structure with sp3-like configuration. Finally, concluding remarks with a summary of results are drawn in

§5.

2. Basic Equations and Finite Difference Formulation The electromagnetic waves propagating in the photonic crystals are well described by Maxwell’s equations. For linear isotropic and frequency-independent dielectric mate- rials with permeability close to one, the time-harmonic Fig. 1. Modified simple cubic lattice comprising dielectric spheres and

connecting thin circular cylinders.25) Fig. 2. Tetragonal square spiral structure comprising circular cylin- ders.27,28)

Fig. 3. diamond structure with sp3-like configuration comprising dielec- tric spheres and connecting spheroids.

728 J. Phys. Soc. Jpn., Vol. 73, No. 3, March, 2004 R. L. CHERNet al.

(20)

Eigen-decomp. of C 1 , C 2 , C 3 for FCC lattice

Define 



 
 
 


Define unitary matrix T as



 
 
 
 


Then it holds that



 


14

x i = D x U n 1 (:,i), y i, j = D y,i U n 2 (:, j)

T = 1

nT 1 T 2 ! T n 1

⎣⎢ ⎤

⎦⎥ ∈! n ×n , T i = Ti,1 T i,2 ! T i,n 2

⎣⎢ ⎤

⎦⎥ ∈! n ×(n 2 n 3 ) , T i, j = D z,i + j U n

( 3 ) ⊗ y ( i, j ⊗ x i )

C 1 T = T Λ ( n 1 ⊗ I n 2 n 3 ) ≡ T Λ 1 ,

C 2 T = T ⊕ ( ( i=1 n 1 Λ i,n 2 ) ⊗ I n 3 ) ≡ T Λ 2 ,

C 3 T = T ⊕ ( i=1 n 1n j =1 2 Λ i, j,n 3 ) ≡ T Λ 3

ψ x = ı2 π k ⋅a 1

n 1 , D x = diag 1,e ( ψ

x

, !,e (n

1

−1) ψ

x

) ,

ψ y,i = ı2 π

n 2 k ⋅ a 2a 1 2

⎛ ⎝⎜ ⎞

⎠⎟ − i 2

⎧ ⎨

⎫ ⎬

⎭ , D y,i = diag 1,e ( ψ

y ,i

, !,e (n

2

−1) ψ

y ,i

) ,

ψ z,i+ j = ı2 π

n 3 k ⋅ a 3a 1 + a 2 3

⎛ ⎝⎜ ⎞

⎠⎟ −

i + j 3

⎧ ⎨

⎫ ⎬

, D z,i+ j = diag 1,e ( ψ

y ,i+ j

, !,e (n

3

−1) ψ

y ,i+ j

)

employing projections onto the range space of the discrete matrix. (However, it is noted that the problem of many zeros does not occur in the PWE as in each plane wave component the number of polarizations is chosen to be the independent two rather three.) (iii) As the third issue of importance, it is of great interest to develop a fast algorithm for the eigenvalue problem. An inverse method, accelerated by multigrid technique with use of projection is proposed for this purpose. The method exploits the sparsity of the matrix for the eigenvalue problem in the finite difference formu- lation. Because of the above mentioned difficulties, the present method is a nontrivial extension of a similar method, recently developed by the authors24)for computing photonic band structures in two dimensions.

In this study, we compute the band structures for three types of photonic structures. The first one is a modified simple cubic lattice consisting of dielectric spheres on the lattice sites, each connected to its six nearest neighbors by thin circular cylinders, which was proposed by Biswas et al.25)Figure 1 shows the modified simple cubic lattice. It is noted that the original simple cubic structure comprising a lattice of rods has been fabricated recently with advanced silicon processing techniques.26) The second one is the tetragonal square spiral structure comprising a lattice of circular or square cylinders, which was proposed by Toader and John,27,28)as shown in Fig. 2. Spiral structure was discussed previously by Chutinan and Noda.29)The square spiral structure is arranged to connect the lattice points of diamond structure with specific order, and is amenable to the current technique of fabrication GLAD (GLancing Angle Deposition) as discussed in refs. 30 and 31. As a third example, we propose a diamond structure that has sp3-like configuration, composed of dielectric spheres with connect- ing spheroids, as shown in Fig. 3. Diamond structures are known to have large band gaps between relatively lower branches either in diamond network or inverse diamond structure.12,28)In the present study, the spheroids, instead of circular cylinders, take the positions of ‘‘valence bonds’’ to imitate the sp3structure of the electrons of diamond atoms.

Recently, submicron diamond-lattice photonic crystals have been successfully produced by two-photon laser nanofabri-

cation (photopolymerization).32)

The order of presentation of the paper is organized as follows. In §2, we show how to correctly formulate the finite difference method for the double curl operator of the photonic eigenvalue problem. In §3, we develop the numerical method (inverse iteration with the full multigrid acceleration) and present the fast algorithm, in which two alternative methods of projection are proposed to avoid the necessity of deflating zeros). In §4, we first present numerical results that illustrate the efficiency of the presently developed method. Then, the band structures are computed for the modified simple cubic lattice, the tetrag- onal square spiral structure (direct and inverse structure) and the diamond structure with sp3-like configuration. Finally, concluding remarks with a summary of results are drawn in

§5.

2. Basic Equations and Finite Difference Formulation The electromagnetic waves propagating in the photonic crystals are well described by Maxwell’s equations. For linear isotropic and frequency-independent dielectric mate- rials with permeability close to one, the time-harmonic Fig. 1. Modified simple cubic lattice comprising dielectric spheres and

connecting thin circular cylinders.25) Fig. 2. Tetragonal square spiral structure comprising circular cylin- ders.27,28)

Fig. 3. diamond structure with sp3-like configuration comprising dielec- tric spheres and connecting spheroids.

728 J. Phys. Soc. Jpn., Vol. 73, No. 3, March, 2004 R. L. CHERNet al.

Demo performance

(21)

CPU Times for T*p and Tq with FCC

15

Eigendecomposition of Double-Curl Operator 19

0 2 4 6 8 10

x 10 7 0

1 2 3 4 5 6 7 8 9 10

CPU times (sec.)

n Tq

T * p

(a) n

0 1 2 3 4 5 6 7 8

x 10 8 0

1 2 3 4 5 6 7 8 9 10

CPU times (sec.)

n log(n) Tq

T * p

(b) n log(n) Fig. 6.1. CPU time for computing T p and T q with various n.

X U L G X W K

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9

frequency

Fig. 6.2. Band structure of the 3D photonic crystals with FCC lattice. The vectors k’s along the boundary of first Brillouin zone. The frequency ! = a p

/(2⇡) is shown on the y-axis. The radius of the sphere is r = 0.12a and the connecting spheroid has minor axis length s = 0.11a.

in MATLAB are used for the IPL and CG methods, respectively. The stopping tolerances for eigs and pcg are set to be 10 4 ⇥ ✏/(2

q 2

x + y 2 + z 2 ) and 2

x ⇥ 10 3 , respectively, where ✏ ⇡ 2 52 is the floating-point relative accuracy in MATLAB. The maximal number of Lanczos vectors for the restart in eigs is set to be 20. All computations are carried out on a workstation with two Intel Quad-Core Xeon X5687 3.6 GHz CPUs, 48 GB main memory, the RedHat Linux operation system, and IEEE double-precision floating-point arithmetic operations.

Figure 6.1(a) shows the timing results for computing T p and T q by Algorithm 2 and 3, respectively. The matrix size of T ranges from 884, 736 to 94, 818, 816. In particular, the dimension of T is ¯ n 3 j , where ¯ n j = 96 + 24j = n 1 = n 2 = n 3 for j = 0, 1, . . . , 15. The average CPU time out of ten trials for each j is then plotted in the figure. We can see Algorithms 2 and 3 are extraordinarily efficient. They take less than 10 seconds to finish a T p or T q matrix-vector multiplication even for the matrix T whose dimension is as large as 95 million. Figure 6.1(b) shows that the complexity of T p and T q is O(n log(n)).

Being equipped with these fast T p or T q computational kernels, we evaluate how the IPL method (Algorithm 1) performs, in terms of CPU time and iteration numbers, to solve the eigenvalue problems for the band structure of the target photonic crystals.

MATLAB T*p : fft

Tq : ifft

(22)

Solving preconditioning linear system

16

(C C − τ I )y = d

(23)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

(C C − τ I )y = d

(24)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

(C C − τ I )y = d

I 3 ⊗ (G G) − τ I

{ } y = d + GG y

(25)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

CG = 0 GG y = − τ −1 GG d

(C C − τ I )y = d

I 3 ⊗ (G G) − τ I

{ } y = d + GG y

(26)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

CG = 0 GG y = − τ −1 GG d

(C C − τ I )y = d

I 3 ⊗ (G G) − τ I

{ } y = d + GG y

I 3 ⊗ (G G) − τ I

{ } y = d − τ −1 GG d

(27)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

CG = 0 GG y = − τ −1 GG d

C 1 T = T Λ 1 , C 2 T = T Λ 2 , C 3 T = T Λ 3 Λ q = Λ 1 Λ 1 + Λ 2 Λ 2 + Λ 3 Λ 3

(C C − τ I )y = d

I 3 ⊗ (G G) − τ I

{ } y = d + GG y

I 3 ⊗ (G G) − τ I

{ } y = d − τ −1 GG d

(28)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

CG = 0 GG y = − τ −1 GG d

C 1 T = T Λ 1 , C 2 T = T Λ 2 , C 3 T = T Λ 3 Λ q = Λ 1 Λ 1 + Λ 2 Λ 2 + Λ 3 Λ 3

(C C − τ I )y = d

I 3 ⊗ (G G) − τ I

{ } y = d + GG y

I 3 ⊗ (G G) − τ I

{ } y = d − τ −1 GG d

I 3 ⊗ Λ q − τ I

( ) y! = I − τ −1 Λ Λ 1 2

Λ 3

⎢ ⎢

⎥ ⎥

⎥ ⎡ Λ 1 * Λ 2 * Λ * 3

⎣⎢ ⎤

⎦⎥

⎜ ⎜

⎟ ⎟

⎟ ( I 3 ⊗T ) * d, y = I ( 3 ⊗T ) y!

(29)

Solving preconditioning linear system

16

C C = I 3 ⊗ G ( ) G − GG

G = [C 1 ,C 2 ,C 3 ]

C =

0 −C 3 C 2 C 3 0 −C 1

−C 2 C 1 0

⎢ ⎢

⎥ ⎥

CG = 0 GG y = − τ −1 GG d

C 1 T = T Λ 1 , C 2 T = T Λ 2 , C 3 T = T Λ 3 Λ q = Λ 1 Λ 1 + Λ 2 Λ 2 + Λ 3 Λ 3

(C C − τ I )y = d

I 3 ⊗ (G G) − τ I

{ } y = d + GG y

I 3 ⊗ (G G) − τ I

{ } y = d − τ −1 GG d

I 3 ⊗ Λ q − τ I

( ) y! = I − τ −1 Λ Λ 1 2

Λ 3

⎢ ⎢

⎥ ⎥

⎥ ⎡ Λ 1 * Λ 2 * Λ * 3

⎣⎢ ⎤

⎦⎥

⎜ ⎜

⎟ ⎟

⎟ ( I 3 ⊗T ) * d, y = I ( 3 ⊗T ) y!

Demo performance

(30)

Preconditioner

Iterative solver with preconditioner M:


sol = bicgstabl(coef_mtx, rhs, tol, maxit, @(vec)FFT_based_precond(vec, Lambda, tau, EigDecompDoubCurl_cell, fun_mtx_TH_prod_vec,

fun_mtx_T_prod_vec));


17

M = C C − τ I

(31)

Preconditioner

Iterative solver with preconditioner M:


sol = bicgstabl(coef_mtx, rhs, tol, maxit, @(vec)FFT_based_precond(vec, Lambda, tau, EigDecompDoubCurl_cell, fun_mtx_TH_prod_vec,

fun_mtx_T_prod_vec));


17

M = C C − τ I

Since


we have


No need to compute the matrix-vector multiplication involving A:


sol = bicgstabl(@(vec)mtx_prod_vec_shift_invert_LS(vec, tau, Lambda_new, EigDecompDoubCurl_cell, mtx_B_sigma, fun_mtx_TH_prod_vec,

fun_mtx_T_prod_vec), rhs, tol, maxit);


M −1 (A − σ B) = M −1 (A- τ I + τ I − σ B) = I + M −1 ( τ I − σ B)

I + M −1 ( τ I − σ B)

{ } y = M −1 b

(32)

Challenge in Solving Linear System

SC lattice (dim = 46875)

FCC lattice

18

(33)

Null-space free

eigenvalue problem

19

(34)

Huge zero eigenvalues

Eigen-decomposition



 


where



 


is unitary and

20 Q 0 Q

⎡ ⎣ ⎤

⎦ := I ( 3 ⊗T ) Π 0 Π 1 ⎦ ≡ I ( 3 ⊗T ) Π Π 0,2 0,1 Π Π 1,3 1,1 Π Π 1,4 1,2

Π 0,3 Π 1,5 Π 1,6

⎢ ⎢

⎢ ⎢

⎥ ⎥

⎥ ⎥

Q 0 Q

⎡ ⎣ ⎤

AQ 0 Q

⎣ ⎤

⎦ = diag 0,Λ ( q , Λ q ) ≡ diag 0,Λ ( )

Q AQ = Λ

Λ q = Λ 1 Λ 1 + Λ 2 Λ 2 + Λ 3 Λ 3

參考文獻

相關文件

Students are asked to collect information (including materials from books, pamphlet from Environmental Protection Department...etc.) of the possible effects of pollution on our

We compare the results of analytical and numerical studies of lattice 2D quantum gravity, where the internal quantum metric is described by random (dynamical)

In fact, while we will be naturally thinking of a one-dimensional lattice, the following also holds for a lattice of arbitrary dimension on which sites have been numbered; however,

•  What if the quark bilinear is slightly away from the light cone (space-like) in the proton

Like the proximal point algorithm using D-function [5, 8], we under some mild assumptions es- tablish the global convergence of the algorithm expressed in terms of function values,

Optim. Humes, The symmetric eigenvalue complementarity problem, Math. Rohn, An algorithm for solving the absolute value equation, Eletron. Seeger and Torki, On eigenvalues induced by

The min-max and the max-min k-split problem are defined similarly except that the objectives are to minimize the maximum subgraph, and to maximize the minimum subgraph respectively..

Ramesh: An algorithm for generating all spann ing trees of directed graphs, Proceedings of the Workshop on Algorithms an d Data Structures, LNCS, Vol.. Ramesh: Algorithms for