Browsing by Author "Hsieh, Han-En"

Now showing 1 - 5 of 5

EIGENDECOMPOSITION OF THE DISCRETE DOUBLE-CURL OPERATOR WITH APPLICATION TO FAST EIGENSOLVER FOR THREE-DIMENSIONAL PHOTONIC CRYSTALS
(2013)
Huang, Tsung-Ming
;
Hsieh, Han-En
;
Lin, Wen-Wei
;
Wang, Weichung
;
應用數學系
This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three-dimensional photonic crystals with face-centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP, and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of 5.184 million dimension eigenvalue problems within 50 to 104 minutes on a workstation with two Intel Quad-Core Xeon X5687 3.6 GHz CPUs.
Eigenvalue solvers for three dimensional photonic crystals with face-centered cubic lattice
(2014-12-15)
Huang, Tsung-Ming
;
Hsieh, Han-En
;
Lin, Wen-Wei
;
Wang, Weichung
;
應用數學系
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. (C) 2014 Elsevier B.V. All rights reserved.
Eigenvalue solvers for three dimensional photonic crystals with face-centered cubic lattice
(2014-12-15)
Huang, Tsung-Ming
;
Hsieh, Han-En
;
Lin, Wen-Wei
;
Wang, Weichung
;
應用數學系
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. (C) 2014 Elsevier B.V. All rights reserved.
Matrix representation of the double-curl operator for simulating three dimensional photonic crystals
(2013-07-01)
Huang, Tsung-Ming
;
Hsieh, Han-En
;
Lin, Wen-Wei
;
Wang, Weichung
;
應用數學系
Three dimensional photonic crystals can be modeled by the Maxwell equations as a generalized eigenvalue problem (GEVP). Simulations based on the numerical solutions of the GEVP are used to reveal physical properties and boost innovative applications of photonic crystals. However, to solve these GEVP remains a computational challenge in both timing and accuracy. The GEVP corresponding to the photonic crystals with face centered cubic (FCC) lattice is one of the challenging eigenvalue problems. From a viewpoint of matrix computation, we demonstrate how such obstacles can be overcome. Our main contribution is an explicit matrix representation of the double-curl operator associated with the photonic crystal with FCC lattice. This particular matrix represents the degenerate coefficient matrix of the discrete GEVP obtained by Yee's scheme. The explicit matrix leads to an eigendecomposition of the degenerate coefficient matrix and then a fast eigenvalue solver. Promising numerical results in terms of timing and accuracy are reported for solving the discrete GEVP arising in three dimensional photonic crystals with various geometric parameters. (C) 2012 Elsevier Ltd. All rights reserved.
SINGULAR VALUE DECOMPOSITIONS FOR SINGLE-CURL OPERATORS IN THREE-DIMENSIONAL MAXWELL'S EQUATIONS FOR COMPLEX MEDIA
(2015-01-01)
Chern, Ruey-Lin
;
Hsieh, Han-En
;
Huang, Tsung-Ming
;
Lin, Wen-Wei
;
Wang, Weichung
This article focuses on solving the generalized eigenvalue problems (GEP) arising in the source-free Maxwell equation with magnetoelectric coupling effects that models three-dimensional complex media. The goal is to compute the smallest positive eigenvalues, and the main challenge is that the coefficient matrix in the discrete Maxwell equation is indefinite and degenerate. To overcome this difficulty, we derive a singular value decomposition (SVD) of the discrete single-curl operator and then explicitly express the basis of the invariant subspace corresponding to the nonzero eigenvalues of the GEP. Consequently, we reduce the GEP to a null space free standard eigenvalue problem (NFSEP) that contains only the nonzero (complex) eigenvalues of the GEP and can be solved by the shift-and-invert Arnoldi method without being disturbed by the null space. Furthermore, the basis of the eigendecomposition is chosen carefully so that we can apply fast Fourier transformation (FFT-) based matrix vector multiplication to solve the embedded linear systems efficiently by an iterative method. For chiral and pseudochiral complex media, which are of great interest in magnetoelectric applications, the NFSEP can be further transformed to a null space free GEP whose coefficient matrices are Hermitian and Hermitian positive definite (HHPD-NFGEP). This HHPD-NFGEP can be solved by using the invert Lanczos method without shifting. Furthermore, the embedded linear system can be solved efficiently by using the conjugate gradient method without preconditioning and the FFT- based matrix vector multiplications. Numerical results are presented to demonstrate the efficiency of the proposed methods.