Lyapunov fractal

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. For instance, the Lyapunov fractal for the iteration sequence AB (see top figure on the right) is not perfectly symmetric with respect to a and b. ==Algorithm==

The algorithm for computing Lyapunov fractals works as follows: • Choose a string of As and Bs of any nontrivial length (e.g., AABAB). • Construct the sequence S formed by successive terms in the string, repeated as many times as necessary. • Choose a point (a,b) \in [0,4] \times [0,4]. • Define the function r_n = a if S_n = A, and r_n = b if S_n = B. • Let x_0 = 0.5, and compute the iterates x_{n+1} = r_n x_n (1 - x_n). • 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 and dropping the first summand as r_0 (1 - 2x_0) = r_n \cdot 0 = 0 for x_0=0.5. • Color the point (a,b) according to the value of \lambda obtained. • Repeat steps (3–7) for each point in the image plane. == More Iterations ==

Markus-Ljapunow Exponent 3.jpg Markus-Ljapunow Exponent 6.jpg Markus-Ljapunow Exponent 7.jpg Markus-Ljapunow Exponent 8.jpg Markus-Ljapunow Exponent 5.jpg Markus-Ljapunow Exponent 4.jpg Markus-Ljapunow Exponent 2.jpg Markus-Ljapunow Exponent 1.jpg == More dimensions ==

Lyapunov fractals can be calculated in more than two dimensions. The sequence string for a n-dimensional fractal has to be built from an alphabet with n characters, e.g. "ABBBCA" for a 3D fractal, which can be visualized either as 3D object or as an animation showing a "slice" in the C direction for each animation frame, like the example given here. == Notes ==