Subspace iteration search method for generalized eigenvalue problems with sparse complex unsymmetric matrices in finite-element analysis of waveguides

Author

Arroyo, Javier ; Zapata, Juan

Author_Institution

Dept. de Electromagnetismo y Teoria de Circuitos, Univ. Politecnica de Madrid, Spain

Volume

46

Issue

8

fYear

1998

fDate

8/1/1998 12:00:00 AM

Firstpage

1115

Lastpage

1123

Abstract

In this paper, a numerical method for the robust computation of the number of eigenvalues within a closed contour of a generalized complex eigenvalue problem is presented. As a result of this computation, it is possible to perform a systematic search for the eigenvalues, ensuring that no eigenvalues are forgotten, and to optimize their calculation. Application is made to the finite-element modal analysis of inhomogeneous waveguides

Keywords

eigenvalues and eigenfunctions; finite element analysis; iterative methods; search problems; sparse matrices; waveguide theory; finite-element analysis; generalized eigenvalue problems; inhomogeneous waveguides; modal analysis; numerical method; sparse complex unsymmetric matrices; subspace iteration search method; Convergence; Eigenvalues and eigenfunctions; Finite element methods; Loaded waveguides; Modal analysis; Poles and zeros; Robustness; Search methods; Sparse matrices; Transmission line matrix methods;

fLanguage

English

Journal_Title

Microwave Theory and Techniques, IEEE Transactions on

Publisher

ieee

ISSN

0018-9480

Type

jour

DOI

10.1109/22.704954

Filename

704954