Pages that link to "Item:Q423881"
From MaRDI portal
The following pages link to A geometric algorithm for winding number computation with complexity analysis (Q423881):
Displaying 5 items.
- Finding the number of roots of a polynomial in a plane region using the winding number (Q316523) (← links)
- An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
- Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle/HOL (Q2303242) (← links)
- On the winding number problem with finite steps (Q3790422) (← links)
- (Q5449989) (← links)