A parallel algorithm for simple roots of polynomials (Q762886)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel algorithm for simple roots of polynomials |
scientific article; zbMATH DE number 3890620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for simple roots of polynomials |
scientific article; zbMATH DE number 3890620 |
Statements
A parallel algorithm for simple roots of polynomials (English)
0 references
1984
0 references
An algorithm for the simultaneous finding of simple roots is presented. It is based on the theory of divided differences. The most time-consuming parts can run in parallel on a SIMD computer (and thus also on a vector computer). The method compares favorably to Laguerre's and to Jenkins- Traub's method.
0 references
numerical examples
0 references
roots of polynomials
0 references
parallel computation
0 references
SIMD computer
0 references
comparison of methods
0 references
simple roots
0 references
vector computer
0 references
Laguerre
0 references
Jenkins-Traub
0 references
0 references
0.96617454
0 references
0.95286876
0 references
0.93929976
0 references
0.9347252
0 references
0 references
0.9222657
0 references
