A geometric algorithm for winding number computation with complexity analysis
DOI10.1016/j.jco.2012.02.001zbMath1262.65057OpenAlexW2090705063MaRDI QIDQ423881
Juan Carlos Díaz Martín, Juan Luis García Zapata
Publication date: 30 May 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2012.02.001
roots of polynomialsdiscrete geometrywinding numbercontour integrationcomplexity boundcomplex analysiszeros of analytic functionsroot-finding algorithmmethod of twist counting of Henrici
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Numerical computation of roots of polynomial equations (65H04)
Related Items (2)
Cites Work
- On condition numbers and the distance to the nearest ill-posed problem
- A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- A derivative-free algorithm for computing zeros of analytic functions
- A globally convergent zero finding method.
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- Solving a Polynomial Equation: Some History and Recent Progress
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computational Complexity of Two-Dimensional Regions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A geometric algorithm for winding number computation with complexity analysis
