Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal and nearly optimal algorithms for approximating polynomial zeros |
scientific article |
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
