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

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05)

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