Calculating polynomial zeros on a local memory parallel computer (Q582813)
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 4131539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculating polynomial zeros on a local memory parallel computer |
scientific article; zbMATH DE number 4131539 |
Statements
Calculating polynomial zeros on a local memory parallel computer (English)
0 references
1989
0 references
Investigation of three different algorithms (convergence order two, three and four) for the calculation of all zeros of a polynomial (degree 3 to 36) on a linear chain of up to eight transputers. Speedups for different strategies are presented.
0 references
parallel computation
0 references
algorithms
0 references
convergence order
0 references
zeros of a polynomial
0 references
transputers
0 references
0.8194326162338257
0 references
0.812388002872467
0 references
0.8111000061035156
0 references
