Iterated maps on discretized meshes of the unit interval
True chaos can never arise in computer simulation of simple dynamical systems. Finite mantissa arithmetics implies that the trajectory of every point in iterated maps must be periodic. Here, discretized numerical versions of unimodal maps from the unit interval to itself are studied. The author defines some special notions for these maps and proves a number of results, which enable to formulate its principal conclusion: the paper characterizes a class of mappings, for which the existence of a finite set of attractive periods for connected intervals are proved. Some related earlier results and simple examples are presented.
- Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
- Spatial discretization of mappings
- scientific article; zbMATH DE number 5773468
- Statistical properties of discretizations of a class of chaotic dynamical systems
- On the eventual periodicity of piecewise linear chaotic maps
- Computer orbits
- scientific article; zbMATH DE number 3812576 (Why is no real title available?)
- Is every approximate trajectory of some process near an exact trajectory of a nearby process?
- On the abundance of aperiodic behaviour for maps on the interval
- Period Three Implies Chaos
- Stable Attracting Sets in Dynamical Systems and in Their One-Step Discretizations
- What good are numerical simulations of chaotic dynamical systems?
- Construction of mappings with attracting cycles
- Spatial discretization of mappings
- An augmented phase plane approach for discrete planar maps: introducing next-iterate operators
- scientific article; zbMATH DE number 1001234 (Why is no real title available?)
- scientific article; zbMATH DE number 2043552 (Why is no real title available?)
This page was built for publication: Iterated maps on discretized meshes of the unit interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277773)