Piotr Kowalczyk
Abstract
A simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points is created, where the signs of the real and imaginary parts of the function change simultaneously. To verify and refine the results, an iterative algorithm is applied. The validity of the presented technique is supported by the results obtained in numerical tests involving three different types of functions.
- Milton Abramowitz and Irene A. Stegun. 1972. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover Publications, New York, NY. Google Scholar
Digital Library
- George B. Dantzig. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, N.J.Google Scholar
- Ajoy Ghatak and K. Thyagarajan. 1998. An Introduction to Fiber Optics. Cambridge University Press, New York.Google Scholar
- Kenneth S. Gritton, J. D. Seader, and Wen-Jing Lin. 2001. Global homotopy continuation procedures for seeking all roots of a nonlinear equation. Comput. Chem. Eng. 25, 7--8, 1003--1019. DOI:http://dx.doi.org/10.1016/S0098-1354(01)00675-5Google ScholarCross Ref
- Piotr Kowalczyk and Michal Mrozowski. 2007. A new conformal radiation boundary condition for high accuracy finite difference analysis of open waveguides. Opt. Express 15, 20, 12605--12618. DOI:http://dx.doi.org/10.1364/OE.15.012605Google ScholarCross Ref
- P. Lamparillo and R. Sorrentino. 1975. The ZEPLS program for solving characteristic equations of electromagnetic structures (Computer Program Descriptions). IEEE Trans. Microwave Theory Tech. 23, 5, 457--458.Google ScholarCross Ref
- Yunliang Long and Hongyan Jiang. 1997. Numerical analysis of surface wave on microstrip antenna with lossy substrate. Electron. Lett. 33, 19, 1592--1593. DOI:http://dx.doi.org/10.1049/el:19971103Google ScholarCross Ref
- Yunliang Long and Hongyan Jiang. 1998. Rigorous numerical solution to complex transcendental equations. Int. J. Infrared Millimeter Waves 19, 5, 785--790.Google ScholarCross Ref
- Jerzy J. Michalski and Piotr Kowalczyk. 2011. Efficient and systematic solution of real and complex eigenvalue problems employing simplex chain vertices searching procedure. IEEE Trans. Microwave Theory Tech. 59, 9, 2197--2205. DOI:http://dx.doi.org/10.1109/TMTT.2011.2160277Google ScholarCross Ref
- Gary L. Miller, Todd Phillips, and Donald R. Sheehy. 2011. Beating the spread: Time-optimal point meshing. In Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG'11). ACM, New York, 321--330. DOI:http://dx.doi.org/10.1145/1998196.1998252 Google ScholarDigital Library
- Michal Mrozowski. 1997. Guided Electromagnetic Waves: Properties and Analysis. Electronic and Electrical Engineering Research Studies Computer Methods in Electromagnetics, Vol. 3, Research Studies Press, New York, NY.Google Scholar
- Michal Mrozowski and Jerzy Mazur. 1992. Matrix theory approach to complex waves {in shielded lossless guides}. IEEE Trans. Microwave Theory Tech. 40, 4, 781--785.Google ScholarCross Ref
- James R. Pinkert. 1976. An exact method for finding the roots of a complex polynomial. ACM Trans. Math. Softw. 2, 4. Google ScholarDigital Library
- William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. 1992. Numerical Recipes in Fortran 77: The Art of Scientific Computing. Cambridge University Press, Cambridge, UK. Google ScholarDigital Library
- Arnold Schonhage. 1982. The fundamental theorem of algebra in terms of computational complexity. Tech. Rep. Mathematisches Institut der Universitat Tubingen.Google Scholar
- G. W. Stewart. 1994. On the convergence of multipoint iterations. Numer. Math. 68, 1, 143--147.Google ScholarCross Ref
- L. Wan. 2011. A new method to find full complex roots of a complex dispersion equation for light propagation. ArXiv e-prints (Aug. 2011).Google Scholar
- Changying Wu, Jianzhou Li, Gao Wei, and Jiadong Xu. 2010. A novel method to solve the complex transcendental equation for the permittivity determination in short-circuited line. In PIERS Proceedings.Google Scholar
- Tian Yu-Bo. 2009. Solving complex transcendental equations based on swarm intelligence. IEEJ Trans. Elect. Electron. Eng. 4, 6, 755--762. http://dx.doi.org/10.1002/tee.20477Google ScholarCross Ref
- W. Zieniutycz. 1983. Comments on: The ZEPLS program for solving characteristic equations of electromagnetic structures. IEEE Trans. Microwave Theory Tech. 31, 5, 420.Google ScholarCross Ref
Index Terms
- Complex Root Finding Algorithm Based on Delaunay Triangulation
Recommendations
A spectral characterization of the Delaunay triangulation
The Delaunay triangulation of a planar point set is a fundamental construct in computational geometry. A simple algorithm to generate it is based on flips of diagonal edges in convex quads. We characterize the effect of a single edge flip in a ...
Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
A fast unstructured mesh generation algorithm based on conforming centroidal Voronoi Delaunay triangulation (CfCVDT) algorithm (Ju, 2007) is proposed in this paper. In the new algorithm, the constrained Delaunay triangulation (CDT) algorithm is used ...
Quality Meshing with Weighted Delaunay Refinement
Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra, called slivers, that can occur in such a mesh can be eliminated by the sliver exudation ...
Comments