The usual methods for producing pictures of Julia sets are iterating a complex function on a mesh of initial points in the complex plane, which leave us wondering whether the point sampling was reliable, whether the grid was fine enough, whether the partial orbits were long enough, and whether rounding errors were relevant. To avoid point sampling, function iteration and rounding errors, the authors present an algorithm for computing images of polynomial Julia sets by using the core idea in celling mapping and label propagation. The algorithm can reliably classify entire rectangles in the complex plane as being on either side of the Julia set and computes a refinable quadtree decomposition of the complex plane adapted to the Julia set which can be used for rendering and for approximating geometric properties such as the area of the filled Julia set and the fractal dimension of the Julia set. Also, the algorithm works for different types of filled Julia sets: connected sets with non-empty interior, connected sets with empty interior, and totally disconnected Cantor sets.
- A Fresh Look at Generalized Sampling
- A quasi cell mapping approach to the global dynamical analysis of Newton's root-finding algorithm
- A subdivision algorithm for the computation of unstable manifolds and global attractors
- Affine arithmetic: concepts and applications
- An algorithmic approach to chain recurrence
- Cell-to-cell mapping. A method of global analysis for nonlinear systems
- Complex analytic dynamics on the Riemann sphere
- Computability of Julia sets
- Constructing an expanding metric for dynamical systems in one complex variable
- Depth-First Search and Linear Graph Algorithms
- Dynamical systems, graphs, and algorithms
- Dynamics in One Complex Variable. (AM-160)
- Efficient computations of Julia sets and their fractal dimension
- GLOBAL ANALYSIS BY CELL MAPPING
- scientific article; zbMATH DE number 3969683 (Why is no real title available?)
- scientific article; zbMATH DE number 1194122 (Why is no real title available?)
- scientific article; zbMATH DE number 98590 (Why is no real title available?)
- scientific article; zbMATH DE number 738999 (Why is no real title available?)
- scientific article; zbMATH DE number 739000 (Why is no real title available?)
- scientific article; zbMATH DE number 1552394 (Why is no real title available?)
- scientific article; zbMATH DE number 1787316 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- INTERVAL-BASED TRACING OF STRANGE ATTRACTORS
- Introduction to Interval Analysis
- On Hyperbolic Plateaus of the Henon Map
- Probabilities, intervals, what next? Optimization problems related to extension of interval computations to situations with partial information about probabilities
- Rational iteration: complex analytic dynamical systems
- Repellers for real analytic maps
- Rigorous investigation of the Ikeda map by means of interval arithmetic
- Rigorous numerical studies of the dynamics of polynomial skew products of \(\mathbb C^2\)
- THE ACCURACY OF COMPUTER ALGORITHMS IN DYNAMICAL SYSTEMS
- The computational complexity of some Julia sets
- The Lorenz attractor exists
- The range of values of a circular complex polynomial over a circular complex interval
- The range of values of a complex polynomial over a complex interval
- On Lagrange polynomials and the rate of approximation of planar sets by polynomial Julia sets
- Bounded nonwandering sets for polynomial mappings
- SOME PROPERTIES OF THE JULIA SETS OF QUADRATIC RATIONAL MAPS
- Explicit estimates on distance estimator method for Julia sets of polynomials
- THE ACCURACY OF COMPUTER ALGORITHMS IN DYNAMICAL SYSTEMS
- scientific article; zbMATH DE number 1918624 (Why is no real title available?)
- Structure of Julia sets of polynomial semigroups with bounded finite postcritical set
This page was built for publication: Rigorous bounds for polynomial Julia sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q523958)
