Finding the roots of a polynomial on an MIMD multicomputer
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.
scientific article; zbMATH DE number 4215276