Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0898-1221(87)90186-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111468049 / rank | |||
Normal rank | |||
Revision as of 21:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential and parallel complexity of approximate evaluation of polynomial zeros |
scientific article |
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
