Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4032925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential and parallel complexity of approximate evaluation of polynomial zeros |
scientific article; zbMATH DE number 4032925 |
Statements
Sequential and parallel complexity of approximate evaluation of polynomial zeros (English)
0 references
1987
0 references
By modification and extension of ideas which are, among others, originally due to Turan, Lehmer and Weyl, the author develops sequential and parallel algorithms for the approximation of complex polynomial zeros and establishes new upper bounds on the respective arithmetic and Boolean complexity of these methods. Questions of practical implementation are discussed as well as applications to the solution of related problems.
0 references
sequential and parallel algorithms
0 references
complex polynomial zeros
0 references
upper bounds
0 references
arithmetic and Boolean complexity
0 references
practical implementation
0 references
0 references
0 references
0 references
0.8710004687309265
0 references
0.8676838874816895
0 references
0.8673845529556274
0 references
0.8671252727508545
0 references
0.8469380140304565
0 references
