Tinkerbell map

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Deacon Vorbis (talk | contribs) at 00:40, 16 July 2017 (→‎top: LaTeX spacing clean up, replaced: \,</math> → </math> (2) using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Tinkerbell attractor with a=0.9, b=-0.6013, c=2, d=0.5. Used starting values of and .

The Tinkerbell map is a discrete-time dynamical system given by:

Some commonly used values of a, b, c, and d are

Like all chaotic maps, the Tinkerbell Map has also been shown to have periods; after a certain number of mapping iterations any given point shown in the map to the right will find itself once again at its starting location.

The origin of the name is uncertain; however, the graphical picture of the system (as shown to the right) shows a similarity to the movement of Tinker Bell over Cinderella Castle, as shown at the beginning of all films produced by Disney.

See also

References