Rigorous bounds for polynomial Julia sets

DOI10.3934/JCD.2016006zbMATH Open1375.37137OpenAlexW2548160608WikidataQ120793243 ScholiaQ120793243MaRDI QIDQ523958FDOQ523958

Authors: Luiz Henrique de Figueiredo, Diego Nehab, Jorge Stolfi, João Batista S.de Oliveira 

Publication date: 25 April 2017

Published in: Journal of Computational Dynamics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jcd.2016006

Recommendations

• The computational complexity of some Julia sets
• Computability of Julia sets
• On computational complexity of Siegel Julia sets
• The computational complexity of some Julia sets
• scientific article; zbMATH DE number 1918624

zbMATH Keywords

Julia setadaptive refinementcomputer-assisted prooffractalcell mappingrobust rendering

Mathematics Subject Classification ID

Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Numerical problems in dynamical systems (65P99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithmic approach to chain recurrence
• Introduction to Interval Analysis
• Repellers for real analytic maps
• Depth-First Search and Linear Graph Algorithms
• Dynamics in One Complex Variable. (AM-160)
• Cell-to-cell mapping. A method of global analysis for nonlinear systems
• Rational iteration: complex analytic dynamical systems
• The Lorenz attractor exists
• Title not available (Why is that?)
• Complex analytic dynamics on the Riemann sphere
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Affine arithmetic: concepts and applications
• GLOBAL ANALYSIS BY CELL MAPPING
• The computational complexity of some Julia sets
• A subdivision algorithm for the computation of unstable manifolds and global attractors
• Probabilities, intervals, what next? Optimization problems related to extension of interval computations to situations with partial information about probabilities
• Computability of Julia sets
• Efficient computations of Julia sets and their fractal dimension
• 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
• A quasi cell mapping approach to the global dynamical analysis of Newton's root-finding algorithm
• Dynamical systems, graphs, and algorithms
• On Hyperbolic Plateaus of the Henon Map
• Title not available (Why is that?)
• THE ACCURACY OF COMPUTER ALGORITHMS IN DYNAMICAL SYSTEMS
• Constructing an expanding metric for dynamical systems in one complex variable
• Rigorous investigation of the Ikeda map by means of interval arithmetic
• INTERVAL-BASED TRACING OF STRANGE ATTRACTORS
• A Fresh Look at Generalized Sampling
• Rigorous numerical studies of the dynamics of polynomial skew products of \(\mathbb C^2\)

Cited In (5)

• On Lagrange polynomials and the rate of approximation of planar sets by polynomial Julia sets
• Title not available (Why is that?)
• SOME PROPERTIES OF THE JULIA SETS OF QUADRATIC RATIONAL MAPS
• Structure of Julia sets of polynomial semigroups with bounded finite postcritical set
• Bounded nonwandering sets for polynomial mappings

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)