A Markov Chain Approximation of a Segment Description of Chaos

Details A Markov Chain Approximation of a Segment Description of Chaos A Markov Chain Approximation of a Segment Description of Chaos

2010-02-03

arxiv.org/abs/1002.0843v1

Nonlinear Sciences

Chaotic Dynamics

Scientific paper

We test a Markov chain approximation to the segment description (Li, 2007) of chaos (and turbulence) on a tent map, the Minea system, the H\'enon map, and the Lorenz system. For the tent map, we compute the probability transition matrix of the Markov chain on the segments for segment time length (iterations) $T = 1, 2, 3, 100$. The matrix has $1, 2, 4$ tents corresponding to $T = 1, 2, 3$; and is almost uniform for $T = 100$. As $T \ra +\infty$, our conjecture is that the matrix will approach a uniform matrix (i.e. every entry is the same). For the simple fixed point attractor in the Minea system, the Reynolds average performs excellently and better than the maximal probability Markov chain and segment linking. But for the strange attractors in the H\'enon map, and the Lorenz system, the Reynolds average performs very poorly and worse than the maximal probability Markov chain and segment linking.

Affiliated with

Also associated with

No associations

Rating

A Markov Chain Approximation of a Segment Description of Chaos 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 A Markov Chain Approximation of a Segment Description of Chaos, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Markov Chain Approximation of a Segment Description of Chaos will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154116