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

[1]  R. Lech.  Calculation of Resonance in Planar and Cylindrical Microstrip Structures Using a Hybrid Technique , 2018, IEEE Transactions on Antennas and Propagation.

[2]  Hongyan Jiang,et al.  Rigorous Numerical Solution to Complex Transcendental Equations , 1998 .

[3]  J. Mosig,et al.  Effect of Spatial Dispersion on Surface Waves Propagating Along Graphene Sheets , 2013, IEEE Transactions on Antennas and Propagation.

[4]  E. P. Popov,et al.  The Dynamics of Automatic Control Systems. , 1964 .

[5]  J. W. Brown,et al.  Complex Variables and Applications , 1985 .

[6]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[7]  Grigorios P. Zouros,et al.  CCOMP: An efficient algorithm for complex roots computation of determinantal equations , 2018, Comput. Phys. Commun..

[8]  Xingren Ying,et al.  A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain , 1988 .

[9]  J. Michalski,et al.  Efficient and Systematic Solution of Real and Complex Eigenvalue Problems Employing Simplex Chain Vertices Searching Procedure , 2011, IEEE Transactions on Microwave Theory and Techniques.

[10]  Piotr Kowalczyk,et al.  On root finding algorithms for complex functions with branch cuts , 2017, J. Comput. Appl. Math..

[11]  Ivor T. A. Spence,et al.  Computing zeros of analytic functions in the complex plane without using derivatives , 2006, Comput. Phys. Commun..

[12]  Sunethra Weerakoon,et al.  A self-tuning modified firefly algorithm to solve univariate nonlinear equations with complex roots , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[13]  Michal Mrozowski.  Guided Electromagnetic Waves: Properties and Analysis , 1997 .

[14]  Piotr Kowalczyk,et al.  Complex Root Finding Algorithm Based on Delaunay Triangulation , 2015, ACM Trans. Math. Softw..

[15]  Arnold Schönhage,et al.  The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .

[16]  Kris Sikorski,et al.  A bisection method for systems of nonlinear equations , 1984, TOMS.

[17]  Elias Wegert,et al.  Visual Complex Functions: An Introduction with Phase Portraits , 2012 .

[18]  Leonie Kohl,et al.  Dynamics Of Automatic Control Systems , 2016 .

[19]  Marc Van Barel,et al.  A Derivative-Free Algorithm for Computing Zeros of Analytic Functions , 1999, Computing.

[20]  Piotr Kowalczyk,et al.  Propagation in the Open Cylindrical Guide of Arbitrary Cross Section With the Use of Field Matching Method , 2018, IEEE Transactions on Antennas and Propagation.

[21]  Jerzy Mazur,et al.  An Analysis of Probe-Fed Rectangular Patch Antennas With Multilayer and Multipatch Configurations on Cylindrical Surfaces , 2014, IEEE Transactions on Antennas and Propagation.

[22]  W. Zieniutycz.  Comments on "The ZEPLS Program for Solving Characteristic Equations of Electromagnetic Structures" , 1983 .

[23]  Francisco M. Fernández,et al.  Introduction to Perturbation Theory in Quantum Mechanics , 2000 .

[24]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[25]  James Hardy Wilkinson,et al.  Rounding errors in algebraic processes , 1964, IFIP Congress.

[26]  Michael N. Vrahatis,et al.  ZEAL: A mathematical software package for computing zeros of analytic functions , 2000 .

[27]  Piotr Kowalczyk,et al.  Efficient Complex Root Tracing Algorithm for Propagation and Radiation Problems , 2017, IEEE Transactions on Antennas and Propagation.

[28]  Li Wan.  A new method to find full complex roots of a complex dispersion equation for light propagation , 2011 .

[29]  M. Meylan,et al.  A parallel algorithm to find the zeros of a complex analytic function. , 2008 .

[30]  James R. Pinkert,et al.  An Exact Method for Finding the Roots of a Complex Polynomial , 1976, TOMS.

[31]  Tian Yubo,et al.  Solving Complex Transcendental Equations Based on Swarm Intelligence , 2009 .

[32]  Parry Y. Chen,et al.  Robust location of optical fiber modes via the argument principle method , 2016, Comput. Phys. Commun..

[33]  Elias N. Glytsis,et al.  Multilayer waveguides: efficient numerical analysis of general structures , 1992 .

[34]  D. Owen.  Handbook of Mathematical Functions with Formulas , 1965 .

[35]  R. Sorrentino,et al.  The ZEPLS Program for Solving Characteristic Equations of Electromagnetic Structures (Computer Program Descriptions) , 1975 .

[36]  L. Trefethen,et al.  Robust rational interpolation and least-squares , 2011 .

[37]  William H. Press,et al.  Numerical recipes in Fortran 77 : the art of scientificcomputing. , 1992 .

[38]  Michael B. Porter,et al.  Computational Ocean Acoustics , 1994 .

[39]  J. N. Lyness,et al.  A Numerical Method for Locating the Zeros of an Analytic Function , 1967 .

[40]  Lloyd N. Trefethen,et al.  Numerical Algorithms Based on Analytic Function Values at Roots of Unity , 2014, SIAM J. Numer. Anal..