Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
It is a fact of experience that computer simulations -- of a relatively naive sort -- are generally fairly reliable indicators of the properties of concrete dynamical systems. The author presents the results of some computer experiments on the orbit structure of the discrete maps on a finite set which arise when an expanding map of the circle is iterated ``naively on the computer. The author also comments on what mathematical questions ought to be answered in order to account for the reliability in practice of orbit following on the computer as an indicator of the ergodic properties of the underlying map.
- Chaotic maps on a measure space and the behavior of the orbit of a state
- CHAOTIFICATION OF DISCRETE DYNAMICAL SYSTEMS GOVERNED BY CONTINUOUS MAPS
- Chaotic orbits for differentiable maps near anti-integrable limits
- On maps with dense orbits and the definition of chaos
- Discretization of homoclinic orbits, rapid forcing and “invisible” chaos
- Periodic and chaotic orbits of a discrete rational system
- scientific article; zbMATH DE number 149716
- Chaotic features of a class of discrete maps without fixed points
- Discrete chaos in fractional cosine and standard maps
- Ergodic properties of computer orbits for simple piecewise monotonic transformations
- Why computers like Lebesgue measure
- On maps with dense orbits and the definition of chaos
- Rigorous computation of diffusion coefficients for expanding maps
- Optimal linear responses for Markov chains and stochastically perturbed dynamical systems
- Adaptive cellular integration of linearly implicit differential equations
- Iterated maps on discretized meshes of the unit interval
- Statistical properties of dynamical systems -- Simulation and abstract computation
- Sturdy cycles in the chaotic ``Tribolium castaneum data series
- Accurate bounds on Lyapunov exponents for expanding maps of the interval
- Supercritical behavior of disordered orbits of a circle map.
- Cryptography-based chaos via geometric undersampling of ring-coupled attractors
- Emergence of randomness from chaos
- Rigorous approximation of diffusion coefficients for expanding maps
- Dynamical properties of spatial discretizations of a generic homeomorphism
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems
- From chaos to randomness via geometric undersampling
- Periodicity and Predictability in Chaotic Systems
- Computer orbits
- scientific article; zbMATH DE number 4050584 (Why is no real title available?)
- scientific article; zbMATH DE number 2052977 (Why is no real title available?)
- Physical measures of discretizations of generic diffeomorphisms
- The challenging problem of industrial applications of multicore-generated iterates of nonlinear mappings
- BRANCHING PROCESSES AND COMPUTATIONAL COLLAPSE OF DISCRETIZED UNIMODAL MAPPINGS
- An elementary way to rigorously estimate convergence to equilibrium and escape rates
- Degree of recurrence of generic diffeomorphisms
- COARSE-GRAINED OBSERVATION OF DISCRETIZED MAPS
- Probability, statistics and computation in dynamical systems
- Numerical coalescence of chaotic trajectories
- Cramér distance and discretisations of circle expanding maps I: theory
- Cramér distance and discretizations of circle expanding maps II: simulations
- Is every approximate trajectory of some process near an exact trajectory of a nearby process?
This page was built for publication: Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4235997)
