Title:
How well can one resolve the state space of a chaotic map?
How well can one resolve the state space of a chaotic map?
Author(s)
Lippolis, Domenico
Advisor(s)
Cvitanović, Predrag
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
All physical systems are affected by some noise that limits the resolution that can be attained in partitioning their state space. For chaotic, locally hyperbolic flows, this resolution depends on the interplay of the local stretching/contraction and the smearing due to noise. My goal is to determine the `finest attainable' partition for a given hyperbolic dynamical system and a given weak additive
white noise. That is achieved by computing the local eigenfunctions of the Fokker-Planck evolution operator in linearized neighborhoods of the periodic orbits of the corresponding deterministic system, and using overlaps of
their widths as the criterion for an optimal partition. The Fokker-Planck evolution is then represented by a finite transition graph, whose spectral determinant yields time averages of dynamical observables. The method applies in
principle to both continuous- and discrete-time dynamical systems. Numerical tests of such optimal partitions on unimodal maps support my hypothesis.
Sponsor
Date Issued
2010-04-06
Extent
Resource Type
Text
Resource Subtype
Dissertation