TY - JOUR
T1 - Structure-Preserving Methods for Computing Complex Band Structures of Three Dimensional Photonic Crystals
AU - Huang, Tsung Ming
AU - Li, Tiexiang
AU - Lin, Jia Wei
AU - Lin, Wen Wei
AU - Tian, Heng
N1 - Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2020/5/1
Y1 - 2020/5/1
N2 - This work is devoted to the numerical computation of complex band structure k= k(ω) ∈ C3, with ω being positive frequencies, of three dimensional isotropic dispersive or non-dispersive photonic crystals from the perspective of structured quadratic eigenvalue problems (QEPs). Our basic strategy is to fix two degrees of freedom in k and to view the remaining one as the eigenvalue of a complex gyroscopic QEP which stems from Maxwell’s equations discretized by Yee’s scheme. We reformulate this gyroscopic QEP into a ⊤-palindromic QEP, which is further transformed into a structured generalized eigenvalue problem for which we have established a structure-preserving shift-and-invert Arnoldi algorithm. Moreover, to accelerate the inner iterations of the shift-and-invert Arnoldi algorithm, we propose an efficient preconditioner which makes most of the fast Fourier transforms. The advantage of our method is discussed in detail and corroborated by several numerical results.
AB - This work is devoted to the numerical computation of complex band structure k= k(ω) ∈ C3, with ω being positive frequencies, of three dimensional isotropic dispersive or non-dispersive photonic crystals from the perspective of structured quadratic eigenvalue problems (QEPs). Our basic strategy is to fix two degrees of freedom in k and to view the remaining one as the eigenvalue of a complex gyroscopic QEP which stems from Maxwell’s equations discretized by Yee’s scheme. We reformulate this gyroscopic QEP into a ⊤-palindromic QEP, which is further transformed into a structured generalized eigenvalue problem for which we have established a structure-preserving shift-and-invert Arnoldi algorithm. Moreover, to accelerate the inner iterations of the shift-and-invert Arnoldi algorithm, we propose an efficient preconditioner which makes most of the fast Fourier transforms. The advantage of our method is discussed in detail and corroborated by several numerical results.
KW - Complex band structure
KW - Dispersive permittivity
KW - FFT
KW - Gyroscopic quadratic eigenvalue problem
KW - G⊤SHIRA
KW - ⊤-palindromic quadratic eigenvalue problem
UR - http://www.scopus.com/inward/record.url?scp=85084173918&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85084173918&partnerID=8YFLogxK
U2 - 10.1007/s10915-020-01220-1
DO - 10.1007/s10915-020-01220-1
M3 - Article
AN - SCOPUS:85084173918
SN - 0885-7474
VL - 83
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 2
M1 - 35
ER -