On the Julia set of König’s root–finding algorithms

Abstract

As is well known, the Julia set of Newton’s method applied to complex polynomials is connected. The family of König’s root–finding algorithms is a natural generalization of Newton’s method. We show that the Julia set of König’s root–finding algorithms of order σ ≥ 3 \sigma \geq 3 applied to complex polynomials is not always connected.