Influence of the multiplicity of the roots on the basins of attraction of Newton’s method

In this work, we develop and implement two algorithms for plotting and computing the measure of the basins of attraction of rational maps defined on the Riemann sphere. These algorithms are based on the subdivisions of a cubical decomposition of a sphere and they have been made by using different computational environments. As an application, we study the basins of attraction of the fixed points of the rational functions obtained when Newton’s method is applied to a polynomial with two roots of multiplicities m and n. We focus our attention on the analysis of the influence of the multiplicities m and n on the measure of the two basins of attraction. As a consequence of the numerical results given in this work, we conclude that, if m > n, the probability that a point in the Riemann Sphere belongs to the basin of the root with multiplicity m is bigger than the other case. In addition, if n is fixed and m tends to infinity, the probability of reaching the root with multiplicity n tends to zero.