Why computers like Lebesgue measure
From MaRDI portal
This paper deals with computer chaos versus true trajectory chaos. It has been observed in practice that the histograms of computer simulations seem to display the invariant measure that is absolutely continuous with respect to the Lebesgue measure; and an explanation of this phenomenon is herein proposed. After emphasis on the deficiencies of the random perturbation models, the relation between computer orbits and absolutely continuous invariant measures is exhibited, and then it is shown that a large class of piecewise linear transformations have long periodic trajectory.
Recommendations
- Computer orbits
- Ergodic properties of computer orbits for simple piecewise monotonic transformations
- Computer arithmetic and sensitivity of natural measure
- On the significance of absolutely continuous invariant measures
- Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
Cites work
- Absolutely continuous measures for certain maps of an interval
- Computer orbits
- Differentiable dynamical systems and the problem of turbulence
- Effects of phase space discretization on the long-time behavior of dynamical systems
- Ergodic properties of computer orbits for simple piecewise monotonic transformations
- scientific article; zbMATH DE number 3947262 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3390021 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- Long Periodic Orbits of the Triangle Map
- On the Existence of Invariant Measures for Piecewise Monotonic Transformations
- On the significance of absolutely continuous invariant measures
- Random perturbations of transformations of an interval
- Randomness implies order
Cited in
(34)- Ergodic properties of computer orbits for simple piecewise monotonic transformations
- On the number of invariant measures for higher-dimensional chaotic transformations
- An invariant measure arising in computer simulation of a chaotic dynamical system
- What good are numerical simulations of chaotic dynamical systems?
- Pathologies generated by round-off in dynamical systems
- A survey of shadowing methods for numerical solutions of ordinary differential equations
- Absolutely continuous invariant measures for random maps with position dependent probabilities
- Invariant measures generated by sequences of approximating transformations
- Collapsing effects in numerical simulation of a class of chaotic dynamical systems and random mappings with a single attracting centre
- Statistical properties of discretizations of a class of chaotic dynamical systems
- Collapsing of chaos in one dimensional maps
- Quantitative statistical stability and linear response for irrational rotations and diffeomorphisms of the circle
- Dynamic Parrondo's paradox
- Randomly chosen chaotic maps can give rise to nearly ordered behavior
- Invariant measures for random maps via interpolation
- Maximum entropy method for position dependent random maps
- Dynamical properties of spatial discretizations of a generic homeomorphism
- INVARIANT MEASURES FOR HIGHER DIMENSIONAL MARKOV SWITCHING POSITION DEPENDENT RANDOM MAPS
- STRONG CHAOTIFICATION OF DISCRETE TIME SYSTEMS BY SMALL FEEDBACK CONTROL
- Computer orbits
- Numeration and discrete dynamical systems
- Analysis of an algorithm for computing invariant measures
- Some problems in analysis of discretizations of continuous dynamical systems
- Physical measures of discretizations of generic diffeomorphisms
- On the limits of probabilistic forecasting in nonlinear time series analysis II: Differential entropy
- Semidefinite characterisation of invariant measures for one-dimensional discrete dynamical systems
- A general piecewise spline maximum entropy method for position dependent random maps
- COARSE-GRAINED OBSERVATION OF DISCRETIZED MAPS
- ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
- Computer arithmetic and sensitivity of natural measure
- Cramér distance and discretisations of circle expanding maps I: theory
- Cramér distance and discretizations of circle expanding maps II: simulations
- Higher-dimensional point transformations and asymptotic measures for cellular automata
- Feasibility of numerical modelling: Information aspect
This page was built for publication: Why computers like Lebesgue measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118058)
