Faster numerical univariate polynomial root-finding by means of subdivision iterations (Q2110240)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Faster numerical univariate polynomial root-finding by means of subdivision iterations |
scientific article; zbMATH DE number 7635844
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster numerical univariate polynomial root-finding by means of subdivision iterations |
scientific article; zbMATH DE number 7635844 |
Statements
Faster numerical univariate polynomial root-finding by means of subdivision iterations (English)
0 references
21 December 2022
0 references
polynomial roots
0 references
subdivision
0 references
sparse polynomials
0 references
real polynomial root-finding
0 references
0.94381654
0 references
0.92857885
0 references
0.92734647
0 references
0.90884984
0 references
0.9016087
0 references
0.8992057
0 references
0.8876008
0 references
