# Fractals/Iterations in the complex plane/julia

## Contents

# Types[edit]

Classification of Julia sets according to :

- topology
- of filled Julia set's interior
- shape
^{[1]}

- local dynamics near periodic points
- connectedness
- position of parameter c on the parameter plane
^{[2]}

Filled Julia set can have :

- an non-empty interior ( Julia set is connected )
- parabolic: filled Julia set have parabolic cycle ( c is on boundary of hyperbolic componnent )
- Siegel : filled Julia sets containing Siegel disc. Julia set can be locally connected or not. That depends on the rotation number. ( c is on boundary of hyperbolic component )
- attracting : filled Julia set have attracting cycle ( c is inside hyperbolic component )
- superattracting : filled Julia set have superattracting cycle( c is in the center of hyperbolic component ). Examples : Airplane Julia set, Douady's Rabbit, Basillica.

- empty interior
- disconnected ( c is outside of Mandelbrot set )
^{[3]} - connected
- Cremer Julia sets ( c is on boundary of hyperbolic component , Julia set is connected but not locally connected)
- dendrits ( Julia set is connected and locally connected ). Examples :
- Misiurewicz Julia sets (c is a Misiurewicz point )
- Feigenbaum Julia sets ( )
- others which have no description

- disconnected ( c is outside of Mandelbrot set )

# Models of Julia set[edit]

- Thurston’s invariant lamination of Julia set
^{[4]} - graph of Julia set
^{[5]}^{[6]}- Schreier graphs

- spine of Julia set
- disked tree model ( Hubbard trees serve as a model for Julia sets of post-critically finite polynomials
^{[7]}) - Douady’s pinched disk model
- Milnor’s orbit portraits
- Dendritic model for Julia sets
^{[8]}

# Algorithms[edit]

**"... a single algorithm for computing all quadratic Julia sets does not exist." **
^{[9]}

Examples:

## Types[edit]

- Escape time ( attraction time to infinity ( attractor for all polynomials )
- attraction time to finite attractor inside filled Julia set )
- estimation of distance to Julia set ( DEM/J )
- Inverse Iteration Method = IIM/J
- Testing equicontinouty by Michael Becker
^{[10]} - orbit traps
^{[11]}^{[12]} - finding periodic repelling points using numerical methods. They are dense in the Julia set. ( Newton method
^{[13]})

## equicontinouty[edit]

"The Julia set of f then is the set of all points of G, at which this sequence of iterated functions is not equicontinous. The Fatou set is its complement. Laxly said the action of the iterated functions on near points is examined. Places, where points, which are near enough, remain near during iterations, belong to the Fatou set. Places, where points, as near they may be, are teared apart, belong to the Julia set. In the following I only consider functions, which map the Riemann sphere, i.e. the complex plane with an ideal point "infinity" added, to itself. The Julia sets are white, the Fatou sets black." Michael Becker

## accuracy[edit]

- Accuracy of Computer Generated Approximations to Julia Sets by John W. Hoggard
- plane scanning
- shadowing lemma
- Numerical Precision

## points[edit]

"We know the periodic points are dense in the Julia set, but in the case of weird ones (like the ones with Cremer points, or even some with Siegel disks where the disk itself is very 'deep' within the Julia set, as measured by the external rays), the periodic points tend to avoid certain parts of the Julia set as long as possible. This is what causes the 'inverse method' of rendering images of Julia sets to be so bad for those cases."
( answered Oct 26 '14 at 14:52 by Jacques Carette )^{[14]}

compare with:

## Special cases[edit]

- "The Julia set is nonempty when d ≥ 2, but the Fatou set may be empty (as demonstrated by Latt`es examples)."
^{[15]}

# See also[edit]

# References[edit]

- ↑ blog scientific american : fractal-kitties-illustrate-the-endless-possibilities-for-julia-sets By Evelyn Lamb on September 26, 2012
- ↑ math.stackexchange question : classification-of-points-in-the-mandelbrot-set
- ↑ images of disconnected Julia sets
- ↑ Simple topological models of Julia sets by L. Oversteegen
- ↑ Combinatorial Julia Sets (1) By Jim Belk
- ↑ Jacek Skryzalin: On Quadratic Mappings With and Attracting Cycle
- ↑ Eugene1806's Blog
- ↑ Hausdorff dimension of biaccessible angles of quadratic Julia sets and of the Mandelbrot set by Henk Bruin and Dierk Schleicher
- ↑ Computability of Julia sets by Mark Braverman, Michael Yampolsky
- ↑ Some Julia sets by Michael Becker, 6/2003. Last modification: 2/2004.
- ↑ orbit traps example video
- ↑ orbit traps making
- ↑ Newton's method in practice II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees by Robin Stoll, Dierk Schleicher
- ↑ Clustering of periodic points for a polynomial iteration of C
- ↑ Lucjan Emil Böttcher and his mathematical legacy Stanisław Domoradzki, Małgorzata Stawiska