7:00 PM-9:30 PM Superior A - Level C
Continued successful interaction between computational observations of random-like behavior and mathematically rigorous description of dynamical systems will depend on the development of methods for computing the invariant measures of invariant sets whose accuracy can be assessed. This minisymposium will be devoted to a discussion of a method first proposed by Stanislaw Ulam for approximating the absolutely continuous invariant measures of finite-dimensional maps. There will be a discussion of convergence rates in the absolutely continuous case, and presentation of recent results on approximation of measures and attractors where the Birkhoff Ergodic theorem holds almost everywhere (Lebesgue). Our purpose is to present an easily implemented alternative to the computation of invariant measures (histograms) by box counting-a procedure for which there are to our knowledge no general estimates. We show how the method can be used to calculate Lyapunov exponents. Highlighted will be extensions of the original method to multi-dimensional maps and set-valued maps. Convergence rates of the method will be discussed in the absolutely continuous case, and results on the approximation of attractors and invariant measures will be presented for the singular case.
Organizer: Fern Y. Hunt
National Institute of Standards and Technology
DS97 Homepage | Program Updates|
Registration | Hotel Information | Transportation | Program-at-a-Glance | Program Overview