TY - JOUR T1 - A Family of High-Order Parallel Rootfinders for Polynomials AU - Zheng , Shi-Ming JO - Journal of Computational Mathematics VL - 3 SP - 283 EP - 288 PY - 2000 DA - 2000/06 SN - 18 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9042.html KW - Parallel iteration, zeros of polynomial, order of convergence. AB -
In this paper we present a family of parallel iterations of order $m+2$ with parameter $m=0,1,...$ for simultaneous finding all zeros of a polynomial without evaluation of derivatives, which includes the well known Weierstrass-Durand-Dochev-Kerner and Börsch-Supan-Nourein iterations as the special cases for $m$=0 and $m$=1, respectively. Some numerical examples are given.