Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578)
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: Rational cubic clipping with linear complexity for computing roots of polynomials |
scientific article; zbMATH DE number 7037961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rational cubic clipping with linear complexity for computing roots of polynomials |
scientific article; zbMATH DE number 7037961 |
Statements
Rational cubic clipping with linear complexity for computing roots of polynomials (English)
0 references
19 March 2019
0 references
approximation order
0 references
fast cubic clipping method
0 references
root-finding
0 references
convergence rate
0 references
linear computational complexity
0 references
0.9524242
0 references
0 references
0.9432586
0 references
0.93996406
0 references
0.9249177
0 references
0.89821607
0 references
0.88781327
0 references
0.88285923
0 references
