FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials (Q3598609)
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: FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials |
scientific article; zbMATH DE number 5501402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials |
scientific article; zbMATH DE number 5501402 |
Statements
3 February 2009
0 references
numerical examples
0 references
Vincent's theorem
0 references
real root isolation methods
0 references
linear and quadratic complexity bounds
0 references
positive roots of polynomials
0 references
continued fractions method
0 references
0.8539248704910278
0 references
0.7925270795822144
0 references
0.734670877456665
0 references
0.7280821800231934
0 references
