On the guaranteed convergence of new two-point root-finding methods for polynomial zeros (Q742856): Difference between revisions

Given a polynomial of degree \(n\) with \(n\) distinct zeros, a new iterative method for computing simultaneously all of its roots is proposed. The method is multi-step, derivative-free and it is shown to have cubic \(R\)-order of convergence. It is based on the Weierstrass correction and on the Ostrowski two-point method for finding a single root of a nonlinear equation. In addition, the paper provides a computationally verifiable condition to guarantee the convergence of the method, depending only on the \(n\) initial guesses and on the polynomial coefficients. However, since the derived condition is only sufficient, it may be quite restrictive. Some variations of the method are investigated as well as accelerated single-step versions with \(R\)-order of convergence greater than three. Two numerical examples illustrate the behavior of the proposed methods.