Global Complex Roots and Poles Finding Algorithm in C × R Domain

An algorithm to find the roots and poles of a complex function depending on two arguments (one complex and one real) is proposed. Such problems are common in many fields of science for instance in electromagnetism, acoustics, stability analyses, spectroscopy, optics, and elementary particle physics....

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 11; p. 1
Main Authors: Dziedziewicz, Sebastian, Warecka, Malgorzata, Lech, Rafal, Kowalczyk, Piotr
Format: Journal Article
Language:English
Published: Piscataway IEEE 2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An algorithm to find the roots and poles of a complex function depending on two arguments (one complex and one real) is proposed. Such problems are common in many fields of science for instance in electromagnetism, acoustics, stability analyses, spectroscopy, optics, and elementary particle physics. The proposed technique belongs to the class of global algorithms, gives a full picture of solutions in a fixed region Ω ⊂ C × R and can be very useful for preliminary analysis of the problem. The roots and poles are represented as curves in this domain. It is an efficient alternative not only to the complex plane zero search algorithms (which require multiple calls for different values of an additional real parameter) but also to tracking algorithms. The developed technique is based on the generalized Cauchy Argument Principle and Delaunay triangulation in three-dimensional space. The usefulness and effectiveness of the method are demonstrated on several examples concerning the analysis of guides (Anti-Resonant Reflecting Acoustic Waveguide, coaxially loaded cylindrical waveguide, graphene transmission line) and a resonant structure (Fabry-Pérot open resonator).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2023.3292961