Asynchronous polynomial zero-finding algorithms (Q809547)
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 4213328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asynchronous polynomial zero-finding algorithms |
scientific article; zbMATH DE number 4213328 |
Statements
Asynchronous polynomial zero-finding algorithms (English)
0 references
1991
0 references
The authors prove local convergence theorems for ``partially asynchronous'' modifications of the Durand-Kerner and Ehrlich polynomial zero-finding algorithms, respectively. There is an extensive report on numerical experiments.
0 references
Durant-Kerner method
0 references
Ehrlich method
0 references
asynchronous parallel algorithms
0 references
local memory parallel computers
0 references
local convergence
0 references
polynomial zero- finding algorithms
0 references
numerical experiments
0 references
