Analysis of an algorithm for computing invariant measures

DOI10.1016/0362-546X(94)E0062-LzbMath0826.58022OpenAlexW2091565530MaRDI QIDQ4322991

Phil Diamond, Peter E. Kloeden, Alexei V. Pokrovskii

Publication date: 22 November 1995

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0362-546x(94)e0062-l

zbMATH Keywords

Markov chainsinvariant measures

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Ergodic theory (37A99)

Related Items (2)

Feasibility of numerical modelling: Information aspect ⋮ Basin of attraction of cycles of discretizations of dynamical systems with SRB invariant measures.

Cites Work

• General random perturbations of hyperbolic and expanding transformations
• Why computers like Lebesgue measure
• Finite approximation for the Frobenius-Perron operator. A solution to Ulam's conjecture
• Small perturbations of chaotic dynamical systems
• Error estimates of the Markov finite approximation of the Frobenius-Perron operator
• Long Periodic Orbits of the Triangle Map
• Equilibrium states and the ergodic theory of Anosov diffeomorphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of an algorithm for computing invariant measures