Difference between revisions of "Horseshoe map"
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 38: | Line 38: | ||
== See also == | == See also == | ||
| + | * [[Chaos theory]] | ||
| + | * [[Fractal]] | ||
* [[Stephen Smale|Smale, Stephen]] | * [[Stephen Smale|Smale, Stephen]] | ||
Revision as of 05:09, 15 September 2015
In the mathematics of chaos theory, a horseshoe map is any member of a class of chaotic maps of the square into itself.
(TO DO: expand, organize, cross-reference, illustrate.)
Description
It is a core example in the study of dynamical systems.
The map was introduced by Stephen Smale while studying the behavior of the orbits of the van der Pol oscillator.
The action of the map is defined geometrically by squishing the square, then stretching the result into a long strip, and finally folding the strip into the shape of a horseshoe.
Most points eventually leave the square under the action of the map.
They go to the side caps where they will, under iteration, converge to a fixed point in one of the caps.
The points that remain in the square under repeated iteration form a fractal set and are part of the invariant set of the map.
The squishing, stretching and folding of the horseshoe map are typical of chaotic systems, but not necessary or even sufficient.
Uniformity
In the horseshoe map, the squeezing and stretching are uniform.
They compensate each other so that the area of the square does not change.
The folding is done neatly, so that the orbits that remain forever in the square can be simply described.
Characteristics
Characteristic of a horseshoe map:
- There are an infinite number of periodic orbits;
- Periodic orbits of arbitrarily long period exist;
- The number of periodic orbits grows exponentially with the period; and
- Close to any point of the fractal invariant set there is a point of a periodic orbit.
See also
External links
- Horseshoe map @ Wikipedia
