The complex subspace iteration for the computation of eigenmodes in lossy cavities
- 1 November 1995
- journal article
- research article
- Published by Wiley in International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
- Vol. 8 (6) , 385-398
- https://doi.org/10.1002/jnm.1660080602
Abstract
A typical application of numerical frequency‐domain computations is the calculation of electromagnetic fields in cavities. Not only the field vectors of the desired modes, but also parameters such as the resonance frequency and, in the lossy case, the damping coefficient and the quality factor of the cavity can be obtained. This problem leads to an analytical eigenvalue equation, which can be transformed in an algebraic, complex, linear eigenvalue problem by the finite integration method.The consideration of energy losses in materials is straighforward in the analytical theory, using complex material quantities, but it is still a difficult subject area to solve a complex algebraic eigenvalue problem. Generally problems with very large, complex matrices (dimension >100,000) have to be solved, and no commonly applicable algorithm is known so far.This paper deals with a special variant of subspace iteration with polynomial acceleration, and some problems of the application of the complex Chebyshev polynomials are discussed. Two examples with weakly lossy cavities demonstrate the capability of the new algorithm, which is successfully applied to very large problems of up to 490, 000 real unknowns.Keywords
This publication has 9 references indexed in Scilit:
- Solution of Maxwell's equationsComputer Physics Communications, 1992
- 2D and 3D computations of eigenvalue problemsIEEE Transactions on Magnetics, 1992
- Arnoldi-Tchebychev procedure for large scale nonsymmetric matricesESAIM: Mathematical Modelling and Numerical Analysis, 1990
- Modern Algorithms for Large Sparse Eigenvalue ProblemsPublished by Walter de Gruyter GmbH ,1987
- Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problemsMathematics of Computation, 1984
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iterationNumerische Mathematik, 1978
- The Tchebychev iteration for nonsymmetric linear systemsNumerische Mathematik, 1977
- Computational aspects of F. L. Bauer's simultaneous iteration methodNumerische Mathematik, 1969
- Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer EigenwertproblemeZeitschrift für angewandte Mathematik und Physik, 1957