Finding the roots of a polynomial on an MIMD multicomputer
type: Item
instance of: scholarly article
title: Finding the roots of a polynomial on an MIMD multicomputer
zbMATH Open document ID: 0734.65042
DOI: 10.1016/0167-8191(90)90032-5
author: Michel Cosnard
author: Pierre Fraigniaud
published in: Parallel Computing
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 4215276
zbMATH Keywords: parallel computation
zbMATH Keywords: polynomial roots
zbMATH Keywords: distributed memory multicomputer
zbMATH Keywords: iterative methods
zbMATH Keywords: hypercube topology
reviewed by: Prabhat Kumar Mahanti
MaRDI profile type: Publication
full work available at URL: 0167-8191(90)90032-5
OpenAlex ID: W2097461634
description: scientific article; zbMATH DE number 4215276