Finding the roots of a polynomial on an MIMD multicomputer (Q811090)
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: Finding the roots of a polynomial on an MIMD multicomputer |
scientific article; zbMATH DE number 4215276
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the roots of a polynomial on an MIMD multicomputer |
scientific article; zbMATH DE number 4215276 |
Statements
Finding the roots of a polynomial on an MIMD multicomputer (English)
0 references
1990
0 references
This paper presents the parallelization on a distributed memory multicomputer of two iterative methods for finding all the roots of a given polynomial. It is shown that among the different classical processors networks topologies (ring, 2d-torus or n-cube), the hypercube topology minimizes the communications. Experiments are performed on the hypercube FPsT40 for illustration.
0 references
parallel computation
0 references
polynomial roots
0 references
distributed memory multicomputer
0 references
iterative methods
0 references
hypercube topology
0 references
