next up previous
Next: Permutations Up: Periodic Orbits Previous: An Aufbau Algorithm

Topological Entropy of Orbits

The topological entropy of a return map can be computed by partitioning the phase space, computing Markov type transition matrices according to the Rules $L$ and $U$ for lower and upper bounds, computing the largest eigenvalue for these matrices, and taking logarithms. There are two simpler ways to estimate the topological entropy of a map. One depends on the properties of periodic orbits associated with the map. This method will be described in the present Section. The second method relies on the properties of the symbol string representing a chaotic trajectory. It will be described in the following Section.



Subsections

root 2006-09-08