Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569)

The article is devoted to the classical problem of finding precise local and semilocal convergence theorems for families of multi-point iterative procedures for simultaneous computation of zeros of a given polynomial. The authors develop a new approach for the study of the local convergence of multi-point iterative methods. Two local convergence results for the multi-point Weierstrass-type methods (Theorems 5.1 and 5.2) are presented. These results improve and the ones of \textit{N. Kyurkchiev} and \textit{R. Ivanov} [God. Sofiĭ. Univ., Fak. Mat. Mekh. 78, No. 1, 132--136 (1988; Zbl 0745.65030)] and generalize the findings of \textit{P. D. Proinov} and \textit{M. D. Petkova} [Japan J. Ind. Appl. Math. 31, No. 2, 279--292 (2014; Zbl 1297.65052)]. A semilocal convergence result for the multi-point Weierstrass-type methods is given. In this result, the initial conditions and the error estimates are computationally verifiable which is of practical importance. Two numerical examples to show the applicability of the semilocal convergence are given.