LAUSR

Abstract A well known result of J. Hubbard, D. Schleicher and S. Sutherland (see [27] ) shows that if f is a complex polynomial of degree d , then there is a finite set S d depending only on d such that, given any root α of f , there exists at least one point in S d converging under iterations of N f to α . Their proof depends heavily on the simply connectedness of the immediate basins of attraction of Newton's method. We show that for all order σ ≥ 2 , there exists a complex polynomial f such that the Julia set of Konig's method for multiple roots applied to it is disconnected. Consequently, our result establishes restrictions for extending the main result in [27] to higher order root-finding methods. As far as we know, there are no pictures of disconnected Julia sets for root finding algorithms applied to polynomials. Here we give a proof and provide pictures that illustrate such disconnectedness. We also show that the Fatou set of Konig's method for multiple roots converges to the Voronoi diagram under order of convergence growth, in the Hausdorff complementary metric.