Search
Abstract
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).
Citations
-
1
CrossRef
-
0
Web of Science
-
1
Scopus
Authors (4)
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/ACCESS.2023.3292961
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
IEEE Access
no. 11,
pages 68809 - 68817,
ISSN: 2169-3536 - Language:
- English
- Publication year:
- 2023
- Bibliographic description:
- Dziedziewicz S., Warecka M., Lech R., Kowalczyk P.: Global Complex Roots and Poles Finding Algorithm in C × R Domain// IEEE Access -Vol. 11, (2023), s.68809-68817
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/access.2023.3292961
- Sources of funding:
-
- Statutory activity/subsidy
- Verified by:
- Gdańsk University of Technology
seen 125 times