Asynchronous polynomial zero-finding algorithms
type: Item
instance of: scholarly article
title: Asynchronous polynomial zero-finding algorithms
zbMATH Open document ID: 0733.65029
DOI: 10.1016/S0167-8191(05)80057-2
author: T. L. Freeman
author: M. K. Bane
published in: Parallel Computing
publication date: 1991-01-01T00:00:00Z
review text: The authors prove local convergence theorems for ``partially asynchronous'' modifications of the Durand-Kerner and Ehrlich polynomial zero-finding algorithms, respectively. There is an extensive report on numerical experiments.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 4213328
zbMATH Keywords: Durant-Kerner method
zbMATH Keywords: Ehrlich method
zbMATH Keywords: asynchronous parallel algorithms
zbMATH Keywords: local memory parallel computers
zbMATH Keywords: local convergence
zbMATH Keywords: polynomial zero- finding algorithms
zbMATH Keywords: numerical experiments
reviewed by: Gerhard Merz
MaRDI profile type: Publication
full work available at URL: s0167-8191(05)80057-2
OpenAlex ID: W2085803963
description: scientific article; zbMATH DE number 4213328