On the dynamics of Stirling's iterative root-finding method for rational functions
Abstract
We study the dynamics of Stirling's iterative root-finding method for rational and polynomial functions. It is seen that the Scaling theorem is not satisfied by Stirling's iterative root-finding method. We prove that for a rational function with simple zeroes, the zeroes are the superattracting fixed points of and all the extraneous fixed points of are rationally indifferent. For a polynomial with simple zeroes, we show that the Julia set of is connected. Also, the symmetry of the dynamical plane and free critical orbits of Stirling's iterative method for quadratic unicritical polynomials are discussed. The dynamics of this root-finding method applied to M\"{o}bius map is investigated here. We have shown that the possible number of Herman rings of this method for M\"{o}bius map is at most .
Keywords
Cite
@article{arxiv.2502.05811,
title = {On the dynamics of Stirling's iterative root-finding method for rational functions},
author = {Nitai Mandal and Gorachand Chakraborty},
journal= {arXiv preprint arXiv:2502.05811},
year = {2025}
}
Comments
17 pages