Tsung-Ming Huang

Tsung-Ming Huang, Zhongxiao Jia, Wen-Wei Lin

For a given subspace, the Rayleigh-Ritz method projects the large quadratic eigenvalue problem (QEP) onto it and produces a small sized dense QEP. Similar to the Rayleigh-Ritz method for the linear eigenvalue problem, the Rayleigh-Ritz method defines the Ritz values and the Ritz vectors of the QEP with respect to the projection subspace. We analyze the convergence of the method when the angle between the subspace and the desired eigenvector converges to zero. We prove that there is a Ritz value that converges to the desired eigenvalue unconditionally but the Ritz vector converges conditionally and may fail to converge. To remedy the drawback of possible non-convergence of the Ritz vector, we propose a refined Ritz vector that is mathematically different from the Ritz vector and is proved to converge unconditionally. We construct examples to illustrate our theory.

Tsung-Ming Huang, Tiexiang Li, Wei-De Li et al.

Calculation of band structure of three dimensional photonic crystals amounts to solving large-scale Maxwell eigenvalue problems, which are notoriously challenging due to high multiplicity of zero eigenvalue. In this paper, we try to address this problem in such a broad context that band structure of three dimensional isotropic photonic crystals with all 14 Bravais lattices can be efficiently computed in a unified framework. We uncover the delicate machinery behind several key results of our work and on the basis of this new understanding we drastically simplify the derivations, proofs and arguments in our framework. In this work particular effort is made on reformulating the Bloch boundary condition for all 14 Bravais lattices in the redefined orthogonal coordinate system, and establishing eigen-decomposition of discrete partial derivative operators by systematic use of commutativity among them, which has been overlooked previously, and reducing eigen-decomposition of double-curl operator to the canonical form of a 3x3 complex skew-symmetric matrix under unitary congruence. With the validity of the novel nullspace free method in the broad context, we perform some calculations on one benchmark system to demonstrate the accuracy and efficiency of our algorithm.

Jinyou Xiao, Chuanzeng Zhang, Tsung-Ming Huang et al.

Numerical solution of nonlinear eigenvalue problems (NEPs) is frequently encountered in computational science and engineering. The applicability of most existing methods is limited by matrix structures, property of eigen-solutions, size of the problem, etc. This paper aims to break those limitations and to develop robust and universal NEP solvers for large-scale engineering applications. The novelty lies in two aspects. First, a rational interpolation approach (RIA) is proposed based on the Keldysh theorem for holomorphic matrix functions. Comparing with the existing contour integral approach (CIA), the RIA provides the possibility to select sampling points in more general regions and has advantages in improving accuracy and reducing computational cost. Second, a resolvent sampling scheme using the RIA is proposed for constructing reliable search spaces for the Rayleigh-Ritz procedure, based on which a robust eigen-solver, denoted by RSRR, is developed for solving general NEPs. RSRR can be easily implemented and parallelized. The advantages of the RIA and the performance of RSRR are demonstrated by a variety of benchmark and practical problems.