Connectivity of Julia sets of Newton maps: a unified approach (Q1989545): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1501.05488 / rank | |||
Normal rank |
Latest revision as of 23:28, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connectivity of Julia sets of Newton maps: a unified approach |
scientific article |
Statements
Connectivity of Julia sets of Newton maps: a unified approach (English)
0 references
26 October 2018
0 references
This paper is divided in three parts. In Part one, a historical introduction about Newton's method and the connectivity of Julia sets is given. The terminology used in the proofs and preliminary results are mentioned in the second part. The proof of the main result is given in the third part. The authors give a unified and direct proof of the fact that the Julia set of Newton's method applied to a holomorphic function (a polynomial of degree more than 1 or a transcendental entire function) on the complex plane is connected or, equivalently, of the simple connectivity of each of its stable components, both in finite and infinite degree case. This proof is based on the new approach introduced by the authors in [Invent. Math. 198, No. 3, 591--636 (2014; Zbl 1316.30027)].
0 references
Newton's method
0 references
root-finding algorithm
0 references
iteration
0 references
Julia set
0 references