Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems

Details Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems

2001-02-23

arxiv.org/abs/math/0102187v1

Mathematics

Dynamical Systems

34 pages, 1 figure

Scientific paper

We give a definition of generalized indicators of sensitivity to initial conditions and orbit complexity (a measure of the information that is necessary to describe the orbit of a given point). The well known Ruelle-Pesin and Brin-Katok theorems, combined with Brudno's theorem give a relation between initial data sensitivity and orbit complexity that is generalized in the present work. The generalized relation implies that the set of points where the sensitivity to initial conditions is more than exponential in all directions is a 0 dimensional set. The generalized relation is then applied to the study of an important example of weakly chaotic dynamics: the Manneville map.

Affiliated with

Also associated with

No associations

Rating

Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465915