An elementary approach to rigorous approximation of invariant measures

Abstract

We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general statement on the approximation of fixed points for operators between normed vector spaces, allowing an explicit estimation of the error. We show the flexibility of our approach by applying it to piecewise expanding maps and to maps with indifferent fixed points. We show how the required estimations can be implemented to compute invariant densities up to a given error in the $L^1$ or $L^{\infty }$ distance. We also show how to use this to compute an estimation with certified error for the entropy of those systems. We show how several related computational and numerical issues can be solved to obtain working implementations, and experimental results on some one dimensional maps.

27 pages, 10 figures. Main changes: added a new section in which we apply our method to Manneville-Pomeau maps

Cited by in corpus (9)

• Spectral Galerkin methods for transfer operators in uniformly expanding dynamics
• Automatic Generation of Bounds for Polynomial Systems with Application to the Lorenz System
• Self consistent transfer operators. Invariant measures, convergence to equilibrium, linear response and control of the statistical properties
• A multiresolution algorithm to approximate the Hutchinson measure for IFS and GIFS
• Recursive divergence formulas for perturbing unstable transfer operators and physical measures
• A general framework for the rigorous computation of invariant densities and the coarse-fine strategy
• Existence of multiple noise-induced transitions in a Lasota-Mackey map
• Accurate bounds on Lyapunov exponents for expanding maps of the interval
• Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable