go-v.orgcodex
Menu
Page tools

codex · Philosophy

Tinkerbell map

Diagram for Tinkerbell map
The Tinkerbell map is a discrete-time dynamical system given by: · image: Wikimedia Commons

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

xn+1=xn2−yn2+axn+byn yn+1=2xnyn+cxn+dyn Some commonly used values of a, b, c, and d are

a=0.9,b=−0.6013,c=2.0,d=0.50 a=0.3,b=0.6000,c=2.0,d=0.27 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.

Wikipedia contributors, "Tinkerbell map", Wikipedia, revision 1345633052, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex