Efficient computations of Julia sets and their fractal dimension
The computation of the fractal dimension is straightforward using the box-counting method. However, this approach may require very long computation times. If the Julia set is the connected common boundary of two or more basins of attraction, then a recursive version of the box- counting method can be made storage- and time-efficient. The method is also suitable for the computation of the Julia sets. We apply the method to verify a result of D. Ruelle regarding the dimension of Julia sets of \(R(z)=z^ 2+c\) for small \(c\in {\mathbb{C}}\), to Newton's method for complex polynomials of degree 3 and to a sequence of Julia sets from the renormalization transformation for hierarchical lattices. We also discuss the computation of Julia sets and their information dimension by the inverse iteration method. In all examples tested we find that the information dimension is less than the fractal dimension.
- Cayley's problem and Julia sets
- Complex analytic dynamics on the Riemann sphere
- Five turbulent problems
- scientific article; zbMATH DE number 3854071 (Why is no real title available?)
- scientific article; zbMATH DE number 3969683 (Why is no real title available?)
- scientific article; zbMATH DE number 3794378 (Why is no real title available?)
- scientific article; zbMATH DE number 3894124 (Why is no real title available?)
- On the iteration of a rational function: Computer experiments with Newton's method
- Repellers for real analytic maps
- Parameter identification of 1D recurrent fractal interpolation functions with applications to imaging and signal processing
- The graph of fractal dimensions of Julia sets
- The computational complexity of some Julia sets
- Rigorous bounds for polynomial Julia sets
- Spectral Properties of Laplacians on Snowflake Domains and Filled Julia Sets
- Effortless estimation of basins of attraction
This page was built for publication: Efficient computations of Julia sets and their fractal dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091002)