Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems

A flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular m...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on antennas and propagation Ročník 66; číslo 12; s. 7198 - 7205
Hlavní autor: Kowalczyk, Piotr
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.12.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Analytic functions
Antennas
Communications technology
Complex modes
complex roots finding algorithm
Computing time
Electromagnetic radiation
Electromagnetic scattering
Estimation
Europe
Informatics
Poles
Poles and zeros
propagation
radiation
Roots
ISSN:0018-926X, 1558-2221
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase. As a result, a set of candidate regions is created and then the roots/poles are verified using a discretized Cauchy's argument principle. The accuracy of the results can be improved by the application of a self-adaptive mesh. The effectiveness of the presented technique is supported by numerical tests involving different types of structures, where electromagnetic waves are guided and radiated. The results are verified, and the computational efficiency of the method is examined.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2018.2869213