
Summary: We show that a generally convergent root-finding algorithm for cubic polynomials defined by \textit{C. McMullen} [Ann. Math. (2) 125, 467--493 (1987; Zbl 0634.30028)] is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
root-finding algorithms, Numerical computation of solutions to single equations, Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable, Small divisors, rotation domains and linearization in holomorphic dynamics, complex dynamics, Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets
root-finding algorithms, Numerical computation of solutions to single equations, Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable, Small divisors, rotation domains and linearization in holomorphic dynamics, complex dynamics, Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
