Finding the number of roots of a polynomial in a plane region using the winding number

DOI10.1016/j.camwa.2013.11.013zbMath1350.65042OpenAlexW2066444315MaRDI QIDQ316523

Juan Luis García Zapata, Juan Carlos Díaz Martín

Publication date: 27 September 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2013.11.013

zbMATH Keywords

algorithmwinding numbercontour integrationroot findingnumber of roots

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

An adaptive subdivision method for root finding of univariate polynomials ⋮ Representing rational curve segments and surface patches using semi-algebraic sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric algorithm for winding number computation with complexity analysis
• Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices
• 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
• Computing the zeros of analytic functions
• Solving a Polynomial Equation: Some History and Recent Progress
• A simple but exact and efficient algorithm for complex root isolation
• Theory of Real Computation According to EGC
• Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
• A Numerical Method for Locating the Zeros of an Analytic Function
• Polynomials

This page was built for publication: Finding the number of roots of a polynomial in a plane region using the winding number