We investigate the Halley method of exponential maps. Our main result is that, unlike Newton's method, the Julia set of Halley's method may be disconnected when applied to entire maps of form where p and q are polynomials and q is non-constant. We also describe the nature of the fixed points and classify rational Halley's maps of entire functions.
The article deals with singular perturbation of polynomial maps where is a complex parameter and n is the degree, which is a particular case of the family of rational maps known as McMullen maps. Our main result shows that even when the geometric limit of the Julia set converges to the unit circle or the annulus for a.e. Lebesgue , as n tends to infinity, the measure of maximal entropy always converges to the Lebesgue measure supported on the unit circle. Additionally we describe the dynamics on the Julia set and show that is related to a quotient of a shift of n symbols by an equivalence relation. Finally we prove that the Thurston pull-back map associated with a particular four-circle inversion is a ramified Galois covering. From the arithmetical point of view we prove that each n -circle inversion can be defined over its field of moduli.
The aim of this paper is to study the local dynamical behaviour of a broad class of purely iterative algorithms for Newton’s maps. In particular, we describe the nature and stability of fixed points and provide a type of scaling theorem. Based on those results, we apply a rigidity theorem in order to study the parameter space of cubic polynomials, for a large class of new root finding algorithms. Finally, we study the relations between critical points and the parameter space.