Pages that link to "Item:Q423881"

The following pages link to A geometric algorithm for winding number computation with complexity analysis (Q423881):

Displayed 2 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)