Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261)
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: Optimal and nearly optimal algorithms for approximating polynomial zeros |
scientific article; zbMATH DE number 915159
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal and nearly optimal algorithms for approximating polynomial zeros |
scientific article; zbMATH DE number 915159 |
Statements
Optimal and nearly optimal algorithms for approximating polynomial zeros (English)
0 references
25 March 1997
0 references
The author presents a new algorithm for approximating all complex zeros of a polynomial. The new algorithm is shown to be superior to the previous best algorithms -- in fact it is shown to be asymptotically optimal. Parallel aspects are also addressed and, even though no results on a parallel implementation are reported, the algorithm is expected to parallelize well.
0 references
complex polynomial zeros
0 references
parallel algorithms
0 references
computational complexity
0 references
0 references
0 references
0 references
0.9362247
0 references
0.92622316
0 references
0.92369634
0 references
0.91886634
0 references
0.9184288
0 references
0.9174029
0 references
0.9165417
0 references
0.9148965
0 references
0.9135583
0 references
