TY - JOUR
T1 - Eigenvalue solvers for three dimensional photonic crystals with face-centered cubic lattice
AU - Huang, Tsung Ming
AU - Hsieh, Han En
AU - Lin, Wen Wei
AU - Wang, Weichung
N1 - Funding Information:
The authors appreciate the anonymous referees for their useful comments and suggestions. This work is partially supported by the National Science Council , the Taida Institute of Mathematical Sciences , and the National Center for Theoretical Sciences in Taiwan .
PY - 2014/12/15
Y1 - 2014/12/15
N2 - To numerically determine the band structure of three-dimensional photonic crystals with face-centered cubic lattices, we study how the associated large-scale generalized eigenvalue problem (GEP) can be solved efficiently. The main computational challenge is due to the complexity of the coefficient matrix and the fact that the desired eigenvalues are interior. For solving the GEP by the shift-and-invert Lanczos method, we propose a preconditioning for the associated linear system therein. Recently, a way to reformat the GEP to the null space free eigenvalue problem (NFEP) is proposed. For solving the NFEP, we analyze potential advantages and disadvantages of the null space free inverse Lanczos method, the shift-invert residual Arnoldi method, and the Jacobi-Davidson method from theoretical viewpoints. These four approaches are compared numerically to find out their properties. The numerical results suggest that the shift-invert residual Arnoldi method with an initialization scheme is the fastest and the most robust eigensolver for the target eigenvalue problems. Our findings promise to play an essential role in simulating photonic crystals.
AB - To numerically determine the band structure of three-dimensional photonic crystals with face-centered cubic lattices, we study how the associated large-scale generalized eigenvalue problem (GEP) can be solved efficiently. The main computational challenge is due to the complexity of the coefficient matrix and the fact that the desired eigenvalues are interior. For solving the GEP by the shift-and-invert Lanczos method, we propose a preconditioning for the associated linear system therein. Recently, a way to reformat the GEP to the null space free eigenvalue problem (NFEP) is proposed. For solving the NFEP, we analyze potential advantages and disadvantages of the null space free inverse Lanczos method, the shift-invert residual Arnoldi method, and the Jacobi-Davidson method from theoretical viewpoints. These four approaches are compared numerically to find out their properties. The numerical results suggest that the shift-invert residual Arnoldi method with an initialization scheme is the fastest and the most robust eigensolver for the target eigenvalue problems. Our findings promise to play an essential role in simulating photonic crystals.
KW - Face-centered cubic lattice
KW - Fast Fourier transform matrix-vector multiplications
KW - Maxwell's equations
KW - Null space free eigenvalue problem
KW - Shift-invert residual Arnoldi method
KW - Three-dimensional photonic crystals
UR - http://www.scopus.com/inward/record.url?scp=84903896710&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84903896710&partnerID=8YFLogxK
U2 - 10.1016/j.cam.2014.02.016
DO - 10.1016/j.cam.2014.02.016
M3 - Article
AN - SCOPUS:84903896710
SN - 0377-0427
VL - 272
SP - 350
EP - 361
JO - Journal of Computational and Applied Mathematics
JF - Journal of Computational and Applied Mathematics
ER -