2013
DOI: 10.1090/s0002-9939-2013-11636-9
|View full text |Cite
|
Sign up to set email alerts
|

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 applied to complex polynomials is not always connected.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…2. If λ = 5 then Equation (6) gives that a = 0 and p(z) = z 3 + b becomes an unicritical polynomial.…”
Section: Dynamics Of C λmentioning
confidence: 99%
See 1 more Smart Citation
“…2. If λ = 5 then Equation (6) gives that a = 0 and p(z) = z 3 + b becomes an unicritical polynomial.…”
Section: Dynamics Of C λmentioning
confidence: 99%
“…Though the Julia set of Newton method (applied to a polynomial) is always connected [9], there are other members of Konig's methods with a disconnected Julia set [6]. The Chebyshev's method applied to non-generic cubic polynomials is dealt in [4], where the connectivity question of their Julia sets remain to be answered.…”
Section: Introductionmentioning
confidence: 99%
“…Buff and Henriken [6] established some local and global properties of König's methods. Though the Julia set of Newton's method for any given polynomial is connected [26], there exists a polynomial f n such that the Julia set of K fn,n is not connected for any given integer n ≥ 3 [10].…”
Section: Introductionmentioning
confidence: 99%