Lyapunov Fractals

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The algorithm for computing the fractal is summarized as follows:


1. Choose a string of A’s and B’s of any nontrivial length (e.g., AABAB).

2. Construct the sequence formed by successive terms in the string, repeated as many times as necessary.

3. Choose a point .

4. Define the function if , and if .

5. Let , and compute the iterates .

6. Compute the Lyapunov exponent: . In practice, is approximated by choosing a suitably large (in the Manipulate code, the variable “iterations” corresponds to ).

7. Color the point according to the value of obtained.

8. Repeat steps 3–7 for each point in the image plane.


Contributed by: Sourav Mukherjee (March 2011)
Open content licensed under CC BY-NC-SA



For more information, see the Wikipedia entry for “Lyapunov fractal”.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.