Tent map

Tent map

In mathematics, the tent map is an iterated function, in the shape of a tent, forming a discrete-time dynamical system. It takes a point x_n on the real line and maps it to another point:

: x_{n+1}=left{ egin{matrix} mu x_n & mathrm{for}~~ x_n < frac{1}{2} \ \ mu (1-x_n) & mathrm{for}~~ frac{1}{2} le x_n . end{matrix} ight.

where &mu; is a positive real constant.

Behaviour

The tent map and the logistic map are topologically conjugate, and thus the behaviour of the two maps are in this sense identical under iteration.

Depending on the value of &mu;, the tent map demonstrates a range of dynamical behaviour ranging from predictable to chaotic.

* If &mu; is less than 1 the point "x" = 0 is an attractive fixed point of the system for all initial values of "x" i.e. the system will converge towards "x" = 0 from any initial value of "x".

* If &mu; is 1 all values of "x" less than or equal to 1/2 are fixed points of the system.

* If &mu; is greater than 1 the system has two fixed points, one at 0, and the other at &mu;/(&mu; + 1). Both fixed points are unstable i.e. a value of "x" close to either fixed point will move away from it, rather than towards it. For example, when &mu; is 1.5 there is a fixed point at "x" = 0.6 (because 1.5(1 − 0.6) = 0.6) but starting at "x" = 0.61 we get

::0.61 o 0.585 o 0.6225 o 0.56625 o 0.650625 ldots

* If &mu; is between 1 and the square root of 2 the system maps a set of intervals between &mu; − &mu;2/2 and &mu;/2 to themselves. This set of intervals is the Julia set of the map i.e. it is the smallest invariant sub-set of the real line under this map. If &mu; is greater than the square root of 2, these intervals merge, and the Julia set is the whole interval from &mu; − &mu;2/2 to &mu;/2 (see bifurcation diagram).

* If &mu; is between 1 and 2 the interval [&mu; − &mu;2/2, &mu;/2] contains both periodic and non-periodic points, although all of the orbits are unstable (i.e. nearby points move away from the orbits rather than towards them). Orbits with longer lengths appear as &mu; increases. For example:

::frac{mu}{mu^2+1} o frac{mu^2}{mu^2+1} o frac{mu}{mu^2+1} mbox{ appears at } mu=1

::frac{mu}{mu^3+1} o frac{mu^2}{mu^3+1} o frac{mu^3}{mu^3+1} o frac{mu}{mu^3+1} mbox{ appears at } mu=frac{1+sqrt{5{2}

::frac{mu}{mu^4+1} o frac{mu^2}{mu^4+1} o frac{mu^3}{mu^4+1} o frac{mu^4}{mu^4+1} o frac{mu}{mu^4+1} mbox{ appears at } mu approx 1.8393

* If &mu; equals 2 the system maps the interval [0,1] to itself. There are now periodic points with every orbit length within this interval, as well as non-periodic points. The periodic points are dense in [0,1] , so the map has become chaotic.

* If &mu; is greater than 2 the map's Julia set becomes disconnected, and breaks up into a Cantor set within the interval [0,1] . The Julia set still contains an infinite number of both non-periodic and periodic points (including orbits for any orbit length) but almost every point within [0,1] will now eventually diverge towards infinity. The canonical Cantor set (obtained by successively deleting middle thirds from subsets of the unit line) is the Julia set of the tent map for &mu; = 3.

Magnifying the Orbit Diagram

* A closer look at the orbit diagram shows that there are 4 separated regions at μ ≈ 1. For further magnification, 2 reference lines (red) are drawn from the tip to suitable x at certain μ (e.g., 1.10) as shown.

* With distance measured from the corresponding reference lines, further detail appears in the upper and lower part of the map. (total 8 separated regions at some μ)


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Baker's map — In dynamical systems theory, the baker s map is a chaotic map from the unit square into itself. It is named after a kneading operation that bakers apply to dough: the dough is cut in half, and the two halves are stacked on one another, and… …   Wikipedia

  • Dyadic transformation — xy plot where x = x0 ∈ [0, 1] is rational and y = xn for all n. The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth… …   Wikipedia

  • List of chaotic maps — In mathematics, a chaotic map is a map that exhibits some sort of chaotic behavior. Maps may be parameterized by a discrete time or a continuous time parameter. Discrete maps usually take the form of iterated functions. Chaotic maps often occur… …   Wikipedia

  • Chaos theory — This article is about chaos theory in Mathematics. For other uses of Chaos theory, see Chaos Theory (disambiguation). For other uses of Chaos, see Chaos (disambiguation). A plot of the Lorenz attractor for values r = 28, σ = 10, b = 8/3 …   Wikipedia

  • Dynamical system — This article is about the general aspects of dynamical systems. For technical details, see Dynamical system (definition). For the study, see Dynamical systems theory. Dynamical redirects here. For other uses, see Dynamics (disambiguation). The… …   Wikipedia

  • Rössler attractor — The Rössler attractor (pronEng|ˈrɒslɚFact|date=December 2007) is the attractor for the Rössler system, a system of three non linear ordinary differential equations. These differential equations define a continuous time dynamical system that… …   Wikipedia

  • Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… …   Wikipedia

  • Topological conjugacy — In mathematics, two functions are said to be topologically conjugate to one another if there exists a homeomorphism that will conjugate the one into the other. Topological conjugacy is important in the study of iterated functions and more… …   Wikipedia

  • Triangular function — The triangular function (also known as the triangle function, hat function, or tent function) is defined either as::egin{align}operatorname{tri}(t) = and (t) quad overset{underset{mathrm{def{{=} max(1 |t|, 0) = egin{cases}1 |t|, |t| < 1 ,… …   Wikipedia

  • Unimodal function — In mathematics, a function f ( x ) between two ordered sets is unimodal if for some value m (the mode), it is monotonically increasing for x ≤ m and monotonically decreasing for x ≥ m . In that case, the maximum value of f ( x ) is f ( m ) and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”