Ulam's method for random interval maps

نویسنده

  • Gary Froyland
چکیده

We consider the approximation of absolutely continuous invariant measures (ACIMs) of systems defined by random compositions of piecewise monotonic transformations. Convergence of Ulam’s finite approximation scheme in the case of a single transformation was dealt with by Li (1976 J. Approx. Theory 17 177–86). We extend Ulam’s construction to the situation where a family of piecewise monotonic transformations are composed according to either an iid or Markov law, and prove an analogous convergence result. In addition, we obtain a convergence rate for our approximations to the unique ACIM, and provide rigorous bounds for the L1 error of the Ulam approximation. AMS classification scheme numbers: 58F11, 65U05, 60G10, 28D99

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ulam formulae for random and forced

| The long term distribution of orbits of random dynamical systems or systems which are driven by external innuences can be diicult to estimate via simulation of long orbits. For deterministic systems, Ulam's method has been used successfully to provide a superior method of estimating long term distributions or natural invariant measures. In this note, we describe the extension of Ulam's method...

متن کامل

Ulam's Method for Lasota-Yorke Maps with Holes

Ulam’s method is a rigorous numerical scheme for approximating invariant densities of dynamical systems. The phase space is partitioned into connected sets and an inter-set transition matrix is computed from the dynamics; an approximate invariant density is read off as the leading left eigenvector of this matrix. When a hole in phase space is introduced, one instead searches for conditional inv...

متن کامل

Largest planar matching in random bipartite graphs

Given a distribution G over labeled bipartite (multi) graphs, G = (W; M; E) where jWj = jMj = n, let L(n) denote the size of the largest planar matching of G (here W and M are posets drawn on the plane as two ordered rows of nodes, an upper and a lower one, and a (w; m) edge is drawn as a straight line between w and m). The main focus of this work is to understand the asymptotic (in n) behavior...

متن کامل

Quenched stochastic stability for eventually expanding-on-average random interval map cocycles

The paper [FGTQ14] established fibrewise stability of random absolutely continuous invariant measures (acims) for cocycles of random Lasota-Yorke maps under a variety of perturbations, including “Ulam’s method”, a popular numerical method for approximating acims. The expansivity requirements of [FGTQ14] were that the cocycle (or powers of the cocycle) should be “expanding on average” before app...

متن کامل

Escape Rates Formulae and Metastablilty for Randomly Perturbed Maps

We provide escape rates formulae for piecewise expanding interval maps with ‘random holes’. Then we obtain rigorous approximations of invariant densities of randomly perturbed metabstable interval maps. We show that our escape rates formulae can be used to approximate limits of invariant densities of randomly perturbed metastable systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999