Tent map

In mathematics, the tent map with parameter μ is the real-valued function fμ defined by f μ ( x ) := μ min { x , 1 − x } , {\displaystyle f_{\mu }(x):=\mu \min\{x,\,1-x\},} the name being due to the tent-like shape of the graph of fμ. For the values of the parameter μ within 0 and 2, fμ maps the unit interval [0, 1] into itself, thus defining a discrete-time dynamical system on it (equivalently, a recurrence relation).

Source: Wikipedia — Tent map (CC BY-SA 4.0)

Tent map

In mathematics, the tent map with parameter μ is the real-valued function fμ defined by f μ ( x ) := μ min { x , 1 − x } , {\displaystyle f_{\mu }(x):=\mu \min\{x,\,1-x\},} the name being due to the tent-like shape of the graph of fμ. For the values of the parameter μ within 0 and 2, fμ maps the unit interval [0, 1] into itself, thus defining a discrete-time dynamical system on it (equivalently, a recurrence relation).

Source: Wikipedia "Tent map" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy