Asynchronous polynomial zero-finding algorithms

DOI10.1016/S0167-8191(05)80057-2MaRDI QIDQ809547zbMATH OpenOpenAlexFDO

Authors 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

asynchronous parallel algorithmsDurant-Kerner methodEhrlich methodlocal convergencelocal memory parallel computersnumerical experimentspolynomial 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)

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.

Cited in

(4)

• Tchebychef-like method for the simultaneous finding zeros of analytic functions
• A family of root-finding methods with accelerated convergence
• scientific article; zbMATH DE number 1206074 (Why is no real title available?)
• Börsch-supan-like methods: point estimation and parallel implementation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809547)