Lyapunov fractal

Standard Lyapunov logistic fractal with iteration sequence AB, in the region [2, 4] × [2, 4].
Generalized Lyapunov logistic fractal with iteration sequence AABAB, in the region [2, 4] × [2, 4].
Generalized Lyapunov logistic fractal with iteration sequence BBBBBBAAAAAA, in the growth parameter region (A,B) in [3.4, 4.0] × [2.5, 3.4], known as Zircon Zity.

In mathematics, Lyapunov fractals (also known as Markus–Lyapunov fractals) are bifurcational fractals derived from an extension of the logistic map in which the degree of the growth of the population, r, periodically switches between two values A and B.

A Lyapunov fractal is constructed by mapping the regions of stability and chaotic behaviour (measured using the Lyapunov exponent \lambda) in the a−b plane for given periodic sequences of a and b. In the images, yellow corresponds to \lambda < 0 (stability), and blue corresponds to \lambda > 0 (chaos).

Properties

Lyapunov fractals are generally drawn for values of A and B in the interval [0,4]. For larger values, the interval [0,1] is no longer stable, and the sequence is likely to be attracted by infinity, although convergent cycles of finite values continue to exist for some parameters. For all iteration sequences, the diagonal a = b is always the same as for the standard one parameter logistic function.

The sequence is usually started at the value 0.5, which is a critical point of the iterative function. The other (even complex valued) critical points of the iterative function during one entire round are those that pass through the value 0.5 in the first round. A convergent cycle must attract at least one critical point; therefore all convergent cycles can be obtained by just shifting the iteration sequence, and keeping the starting value 0.5. In practice, shifting this sequence leads to changes in the fractal, as some branches get covered by others; notice for instance how the Lyapunov fractal for the iteration sequence AB is not perfectly symmetric with respect to a and b.

Algorithm for generating Lyapunov fractals

An algorithm, for computing the fractal is summarized as follows.

  1. Choose a string of As and Bs of any nontrivial length (e.g., AABAB).
  2. Construct the sequence S formed by successive terms in the string, repeated as many times as necessary.
  3. Choose a point (a,b) \in [0,4] \times [0,4].
  4. Define the function r_n = a if S_n = A, and r_n = b if S_n = B.
  5. Let x_0 = 0.5, and compute the iterates x_{n+1} = r_n x_n (1 - x_n).
  6. Compute the Lyapunov exponent:
    \lambda = \lim_{N \rightarrow \infty} {1 \over N} \sum_{n = 1}^N \log \left|{dx_{n+1} \over dx_n}\right| = \lim_{N \rightarrow \infty} {1 \over N} \sum_{n = 1}^N \log |r_n (1 - 2x_n)|
    In practice, \lambda is approximated by choosing a suitably large N.
  7. Color the point (a,b) according to the value of \lambda obtained.
  8. Repeat steps (3–7) for each point in the image plane.

External links