Asynchronous polynomial zero-finding algorithms
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.
scientific article; zbMATH DE number 4213328