Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling (Q2175597)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7195040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling |
scientific article; zbMATH DE number 7195040 |
Statements
Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling (English)
0 references
29 April 2020
0 references
The authors propose an algorithm for counting the roots of a given polynomial in a fixed convex region on the complex plane by expressing their number as the winding number computed along the boundary of the region, provided that the boundary is sufficiently isolated from the roots of the polynomial. The correctness of the proposed algorithm is tested by means of some experiments. For the entire collection see [Zbl 1428.68016].
0 references
polynomial root finding
0 references
winding number
0 references
0.8778409957885742
0 references
0.8237460255622864
0 references
0.808908224105835
0 references
0.8082790970802307
0 references
0.7596977949142456
0 references