The Polynomial Pivots as Initial Values for a New Root-Finding Iterative Method

Abstract EN

A new iterative method for polynomial root-finding based on the development of two novel recursive functions is proposed.

In addition, the concept of polynomial pivots associated with these functions is introduced.

The pivots present the property of lying close to some of the roots under certain conditions; this closeness leads us to propose them as efficient starting points for the proposed iterative sequences.

Conditions for local convergence are studied demonstrating that the new recursive sequences converge with linear velocity.

Furthermore, an a priori checkable global convergence test inside pivots-centered balls is proposed.

In order to accelerate the convergence from linear to quadratic velocity, new recursive functions together with their associated sequences are constructed.

Both the recursive functions (linear) and the corrected (quadratic convergence) are validated with two nontrivial numerical examples.

In them, the efficiency of the pivots as starting points, the quadratic convergence of the proposed functions, and the validity of the theoretical results are visualized.