Eigenvalue solvers for three dimensional photonic crystals with face-centered cubic lattice

Tsung Ming Huang, Han En Hsieh, Wen Wei Lin, Weichung Wang

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)350-361
Number of pages12
JournalJournal of Computational and Applied Mathematics
Volume272
DOIs
Publication statusPublished - 2014 Dec 15

Fingerprint

Generalized Eigenvalue Problem
Invert
Null Space
Photonic crystals
Photonic Crystal
Crystal lattices
Arnoldi Method
Eigenvalue Problem
Lanczos Method
Face
Eigenvalue
Three-dimensional
Jacobi-Davidson Method
Band structure
Linear systems
Inverse Method
Band Structure
Preconditioning
Initialization
Interior

Keywords

  • Face-centered cubic lattice
  • Fast Fourier transform matrix-vector multiplications
  • Maxwell's equations
  • Null space free eigenvalue problem
  • Shift-invert residual Arnoldi method
  • Three-dimensional photonic crystals

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Cite this

Eigenvalue solvers for three dimensional photonic crystals with face-centered cubic lattice. / Huang, Tsung Ming; Hsieh, Han En; Lin, Wen Wei; Wang, Weichung.

In: Journal of Computational and Applied Mathematics, Vol. 272, 15.12.2014, p. 350-361.

Research output: Contribution to journalArticle

@article{279bf82de51a491e8f865c9aa1caf788,
title = "Eigenvalue solvers for three dimensional photonic crystals with face-centered cubic lattice",
abstract = "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.",
keywords = "Face-centered cubic lattice, Fast Fourier transform matrix-vector multiplications, Maxwell's equations, Null space free eigenvalue problem, Shift-invert residual Arnoldi method, Three-dimensional photonic crystals",
author = "Huang, {Tsung Ming} and Hsieh, {Han En} and Lin, {Wen Wei} and Weichung Wang",
year = "2014",
month = "12",
day = "15",
doi = "10.1016/j.cam.2014.02.016",
language = "English",
volume = "272",
pages = "350--361",
journal = "Journal of Computational and Applied Mathematics",
issn = "0377-0427",
publisher = "Elsevier",

}

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

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

VL - 272

SP - 350

EP - 361

JO - Journal of Computational and Applied Mathematics

JF - Journal of Computational and Applied Mathematics

SN - 0377-0427

ER -