A note on some improvements of the simultaneous methods for determination of polynomial zeros

Applying Gauss-Seidel approach to the improvements of two simultaneous methods for finding polynomial zeros, presented in 9], two iterative methods with faster convergence are obtained. The lower bounds of the R-order of convergence for the accelerated methods are given. The improved methods and their accelerated modifications are discussed in view of the convergence order and the number of numerical operations. The considered methods are illustrated numerically in the example of an algebraic equation.