Asynchronous polynomial zero-finding algorithms

DOI10.1016/S0167-8191(05)80057-2zbMath0733.65029OpenAlexW2085803963MaRDI QIDQ809547

T. L. Freeman, M. K. Bane

Publication date: 1991

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80057-2

zbMATH Keywords

numerical experimentslocal convergenceEhrlich methodasynchronous parallel algorithmsDurant-Kerner methodlocal memory parallel computerspolynomial zero- finding algorithms

Mathematics Subject Classification ID

Related Items (3)

Tchebychef-like method for the simultaneous finding zeros of analytic functions ⋮ Börsch-supan-like methods: point estimation and parallel implementation ⋮ A family of root-finding methods with accelerated convergence

This page was built for publication: Asynchronous polynomial zero-finding algorithms