Global Complex Roots and Poles Finding Algorithm in C × R Domain - Publikacja - MOST Wiedzy

Wyszukiwarka

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

Abstrakt

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).

Cytowania

  • 0

    CrossRef

  • 0

    Web of Science

  • 0

    Scopus

Słowa kluczowe

Informacje szczegółowe

Kategoria:
Publikacja w czasopiśmie
Typ:
artykuły w czasopismach
Opublikowano w:
IEEE Access nr 11, strony 68809 - 68817,
ISSN: 2169-3536
Język:
angielski
Rok wydania:
2023
Opis bibliograficzny:
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:
Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.1109/access.2023.3292961
Źródła finansowania:
  • Działalność statutowa/subwencja
Weryfikacja:
Politechnika Gdańska

wyświetlono 51 razy

Publikacje, które mogą cię zainteresować

Meta Tagi