Dynamics of Newton-like root finding methods
Beatriz Campos, Jordi Canela, Pura Vindel
TL;DR
The paper addresses why Newton-like root-finding operators applied to quadratics share a universal rational form. It develops a symmetry-based framework using $\lambda^d$-odd/$\lambda^d$-even maps to derive a general operator for $p(z)=z^d-c$, then specializes to $p(z)=z^2-c$ to obtain a canonical operator $O(z)=z^n \prod_{i=1}^{k}\frac{z-r_i}{1-r_i z}$ and analyzes its fixed points and stability. Key contributions include a general symmetry theorem for Newton-like schemes and a detailed dynamical analysis that yields explicit stability regions (e.g., a disk in parameter space for $z=1$) and fixed-point structure, with extensive demonstrations across Chebyshev-Halley, King, Jarratt, and Ostrowski-Chun families. The findings provide a unified understanding of the dynamical behavior of Newton-like methods on quadratics and offer a constructive path to generate new Newton-type algorithms, aided by parameter-planes that reveal robust regions free of undesirable attractors.
Abstract
When exploring the literature, it can be observed that the operator obtained when applying \textit{Newton-like} root finding algorithms to the quadratic polynomials $z^2-c$ has the same form regardless of which algorithm has been used. In this paper we justify why this expression is obtained. This is done by studying the symmetries of the operators obtained after applying Newton-like algorithms to a family of degree $d$ polynomials $p(z)=z^d-c$. Moreover, we provide an iterative procedure to obtain the expression of new Newton-like algoritms. We also carry out a dynamical study of the given generic operator and provide general conclusions of this type of methods.
