Lyapunov Fractal

2017-12-30, post № 189

Java, mathematics, programming, #chaos, #chaos theory, #fractal geometry, #fractal viewer, #Java 1.8

Lyapunov fractals are mathematical objects living in the plane, graphing regions of stability or chaos regarding a certain logistical map following an ever-changing population growth, alternating between two values. I implemented a Lyapunov fractal viewer in Java 1.8 which lets you freely move around the plane, set sequences and iteration depths to explore the fractal. Source code can be seen below or downloaded, as can the Java executable (Lyapunov.java, Lyapunov.jar).

Zircon Zity

Articles on the topic of Lyapunov fractals are a post by Earl Glynn [1] from the year 2000 in which they talk about their Lyapunov fractal generator written in Pascal — a rewrite of a software written in 1992. Also worth reading is A. Dewdney’s article about Mario Markus’ work (Scientific American, September 1991).

My first encounter with this fractal was whilst browsing Wikipedia and stumbling across its Wikipedia entry. Since it was a fractal and looked fairly intricate and thus explorable, I set out to write my own renderer — I chose to implement it in Java, as it is a compiled language with a nice set of GUI libraries. Since Wikipedia listed an algorithm for generating Lyapunov fractal images, I thought an implementation would be fairly straight-forward. However, als always, the devil is in the detail and I quickly noticed that while the short Wikipedia entry looks convincing and well-written at first glance, lacks to answer deeper questions regarding the very topic it is about.

Eerie Tendrils

The following is a description of the fractal generation algorithm. It is a modified version of the algorithm detailed by Wikipedia which addresses certain ambiguities the original had (more on those later).

Fractal generation algorithm

  • Take as input a complex point (a,b)\in\mathbb{R}^2 and a sequence S^* consisting of the letters \text{A} and \text{B}; for example S^*=\text{AAAAAABBBBBB}.
  • Construct a function S\colon\mathbb{N}_0\to\{\text{A},\text{B}\},\quad n\mapsto S^*_{(n\mod |S^*|)} which returns the zero indexed 𝑛-th sequence entry and wraps around to the sequence’s start once the sequence’s end is hit.
  • Construct a function
    r\colon\mathbb{N}_0\to\{a,b\},\quad n\mapsto\begin{cases}a&\text{if }S(n)=\text{A}\\b&\text{if }S(n)=\text{B}\end{cases}
    which selects either 𝑎 or 𝑏.
  • Let x_0=0.5 and define x_n=r(n-1)\cdot x_{n-1}\cdot (1-x_{n-1}).
  • Calculate the Lyapunov exponent 𝜆 as follows.
    \lambda = \lim\limits_{N \to \infty} \frac{1}{N} \cdot \sum\limits_{n=1}^{N} \log_2{|r(n)\cdot(1-2\cdot x_n)|}
    Since calculating the limit as 𝑁 goes to infinity is rather difficult in practice, one can simply use a sufficiently large 𝑁 and pretend to have reached infinity.
  • Output a color value according to 𝜆. I chose green for 𝜆 < 𝟢 and blue for 𝜆 ≥ 𝟢, using arbitrarily defined value ranges to map 𝜆 to an actual color.
A Spec of Fractal

The following is a Java snippet which implements the algorithm described above.

// choose a or b according to Seq and n
static double r(String Seq, int n, double a, double b) {
    if (Seq.charAt(n%Seq.length()) == 'A') return a; else return b;
// calculate a pixel color (0x00rrggbb) for given parameters
static int LyapunovPixel(double a, double b, String Seq, int N) {
    // array of all x_n; x_0, the starting value, initialize all x_n values
    double[] X = new double[N+1]; X[0] = .5;
    for (int n = 1; n <= N; n++) X[n] = r(Seq,n-1,a,b)*X[n-1]*(1-X[n-1]);

    // calculate the Lyapunov exponent (to a certain precision dictated by N)
    double lmb = 0;
    for (int n = 1; n <= N; n++)
        lmb += Math.log(Math.abs(r(Seq,n,a,b)*(1-2*X[n])))/Math.log(2);
    lmb /= N;

    // infinity was hit, use a black pixel
    if (Double.isInfinite(lmb)) return 0x000000;

    // color pixel according to Lyapunov exponent
    double MIN = -1, MAX = 2;
    if (lmb < 0) return ((int)(lmb/MIN*255))<<8;
    else         return ((int)(lmb/MAX*255))<<0;
Lyapunov Spike

Coming back to Wikipedia’s algorithm, there were a few things I found irritating at best when attempting my implementation and thus addressed in the algorithm description seen above. A closer look at potentially misleading or ambiguos statements follows, together with my reasoning to resolve them.

  1. It is not clear whether the sequence is zero or one indexed, though it has to be zero indexed as x_0=0.5, x_{n+1}=r_n\cdot\dots evaluates to x_1=r_0\cdot\dots, implying the definition of r_0 and thus S_0.
  2. It is not clear which logarithm is meant; the natural logarithm, a generic \log_b or the dyadic logarithm — the latter is actually used. To find the actual logarithm base, I dug deeper and used Wikipedia’s external links to find a post by Earl Glynn [2], answering this question.
  3. It is not clear what is meant by the second half of the sentence beneath the Lyapunov exponent. It reads “… dropping the first summand as r_0(1-2x_0)=r_n\cdot 0=0 for x_0=0.5.” As the sum starts with 𝑛 = 𝟣 and one would not dare to calculate \log_2{|r(0)\cdot(1-2\cdot x_0)|}=\log_2{0} for x_0=0.5, this sentence’s existence bewilders me.
  4. It is not clear how exactly the colors are derived, only that they have something to do with the Lyapunov exponent. I simply chose arbitrary values that looked convincing for mapping 𝜆 to a pixel color.
Dark Swirl

One of the most frustrating bugs I came across was an unexplainable axis flip. My code generated the fractal just fine except for the fact that every image was flipped along the diagonal crossing the origin with a 𝟦𝟧° angle to the horizontal. It was as though the coordinates (a,b) were swapped somewhere in my code and I simply could not figure out where.
Finally, after hours of looking at the same code over and over again, a closer look at Earl Glynn’s post [3] brought an end to my misery. Just below the three welcoming fractal renderings, a screenshot of their software is shown — complete with a blue and red line indicating the coordinate system’s orientation. 𝑎 and 𝑏 are — contrary to all coordinate systems involving parameters named after the first two letters in the latin alphabet — indeed flipped. Wikipedia’s images must have simply ran with this decision, without noting it.
Because of this flip, when one wants to render images specified in the reversed sequence format, they simply have to swap all letters (for example \text{BBBABA} becomes \text{AAABAB}).

As Glynn themself says, “I would have reversed the ‘a’ and ‘b’ labels to be consistent with normal ‘x’ and ‘y’ axes conventions, but conform here with the same convention as used by Markus.” (Referring to Mario Markus, co-author of Lyapunov Exponents of the Logistic Map with Periodic Forcing.)

Slurping Cell

After having eliminated all vagueness regarding the fractal generation, writing the outer Java viewer hull was a fairly easy task. As a template I took my Mandelbrot Set III viewer (the reason why most variable names reference complex numbers) complete with multithreading, allowing a pixely fractal exploration until one stops their exploration, letting the thread catch up and display a higher resolution image. The same is done for rendering 𝟦K images and saving them to files in the background — 𝟦K renderings are saved as .png files and named according to their parameters. A list of program controls follows.


  • Mouse dragging lets one pan the complex plane.
  • Mouse scrolling lets one zoom the complex plane.
  • Pressing N evokes a dialogue box where one can specify an iteration depth 𝑁.
  • Pressing S evokes a dialogue box where one can enter a sequence S^*.
  • Pressing R resets all fractal parameters to the default.
  • Pressing P initiates a 𝟦K fractal rendering. The 𝟦K fractal rendering thread can be killed by exiting the program prematurely, thus losing (!) the rendering.
Source code: Lyapunov.java

Christmas MMXVII

2017-12-25, post № 188

art, haiku, poetry, #fractal, #Mandelbrot set

Barren trees, white snow.
Cold and lasting winter nights.
Quiet fire crackling.

Extra assets: christmas-mmxvii_3840x2160_Zre-0.07260896657140253_Zim-1.0189280554672742_Zom4.2347449158655235E-5_exp10.0.png, christmas-mmxvii_3840x2160_Zre-0.1_Zim0.8208333333333333_Zom1.0_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.2414848181469273_Zim0.6531287941676606_Zom7.735540101454311E-4_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.2573939011468711_Zim0.6626558339458328_Zom0.003757102126136367_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.257519137884409_Zim0.6596344976527314_Zom0.003757102126136367_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.2577190734690804_Zim0.6491054222668752_Zom1.0449567633177853E-4_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.25830186749402073_Zim0.6562374511470165_Zom0.003757102126136367_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.2639375206832253_Zim0.661873104336221_Zom0.003757102126136367_exp2.0.png, christmas-mmxvii_3840x2160_Zre-0.5920744438285481_Zim0.6223507702642866_Zom0.001310020508637622_exp10.0.png, christmas-mmxvii_3840x2160_Zre-1.078557459661914_Zim0.0013629651915028644_Zom2.056788397238397E-4_exp10.0.png, christmas-mmxvii_3840x2160_Zre-1.0795059900715473_Zim0.0019801746138562704_Zom9.394913865827938E-8_exp10.0.png, christmas-mmxvii_3840x2160_Zre-1.0795204623082653_Zim0.001986335491027004_Zom8.718964248596124E-6_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.014267818842289582_Zim0.8757391939928414_Zom3.180067514517283E-7_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.014268050319035682_Zim0.875739600311054_Zom7.602033756829732E-12_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.1489024246864608_Zim0.8115432472089417_Zom0.1215766545905694_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.1818451624613391_Zim0.5834271760896379_Zom4.429692754456193E-6_exp2.0.png, christmas-mmxvii_3840x2160_Zre0.19119078150143407_Zim0.5580753310569773_Zom0.00515377520732012_exp2.0.png, christmas-mmxvii_3840x2160_Zre0.3393255185281519_Zim0.05084607656695634_Zom0.0010611166119964739_exp2.0.png, christmas-mmxvii_3840x2160_Zre0.3454368344026098_Zim0.07837435638763426_Zom1.7696434542799824E-4_exp2.0.png, christmas-mmxvii_3840x2160_Zre0.48931705754005517_Zim0.8353520087329283_Zom0.1215766545905694_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.5621121033237614_Zim0.5274830095539802_Zom1.851109557514574E-4_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.5623370155779666_Zim0.5274794912343124_Zom3.753228214182955E-6_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.5795717096354351_Zim0.52598024900317_Zom0.003930061525912896_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.7845681819806357_Zim0.3348175156806971_Zom5.5533286725436733E-5_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.7848831649875558_Zim0.33459492235520616_Zom0.0014555783429306911_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.7930282238102471_Zim0.31165896178752694_Zom0.016423203268260675_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.909441937980956_Zim-0.23239898340787288_Zom2.1514733098945913E-5_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9094942449769182_Zim-0.23238966806958306_Zom7.501723576108304E-6_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9096462046985022_Zim-0.23226313617973524_Zom9.261387130997916E-6_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9096493042407041_Zim-0.23226986959517934_Zom4.7731107381130684E-8_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9096493337216294_Zim-0.23226989449090887_Zom6.252872956926572E-11_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.922468619207676_Zim0.4409769981662472_Zom0.009697737297875248_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9269776124194835_Zim0.4465018384668457_Zom3.229246017998565E-6_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9269776422975966_Zim0.4465019328199905_Zom1.5445383597460583E-6_exp10.0.png, christmas-mmxvii_3840x2160_Zre0.9625881992664431_Zim-0.2700908626366791_Zom1.0449567633177995E-4_exp10.0.png, christmas-mmxvii_640x480_Zre0.5809964320245223_Zim0.757110444863151_Zom0.01824800363140075_exp10.0.png, christmas-mmxvii_main.jar, christmas-mmxvii_main.java, christmas-mmxvii_mandel.java, christmas-mmxvii_mk.sh, christmas-mmxvii_without-coordinates.png

Python Matrix Module

2017-12-16, post № 187

mathematics, programming, Python, #linear algebra, #matrices

Matrices are an important part of linear algebra. By arranging scalars in a rectangular manner, one can elegantly encode vector transformations like scaling, rotating, shearing and squashing, solve systems of linear equations and represent general vector space homomorphisms.
However, as powerful as matrices are, when actually applying the theoretical tools one has to calculate specific values. Doing so by hand can be done, yet gets cumbersome quite quickly when dealing with any matrices which contain more than a few rows and columns.

So, even though there are a lot of other implementations already present, I set out to write a Python matrix module containing a matrix class capable of basic matrix arithmetic (matrix multiplication, transposition, …) together with a set of functions which perform some higher-level matrix manipulation like applying Gaussian elimination, calculating the reduced row echelon form, determinant, inversion and rank of a given matrix.

Module source code can be seen below and downloaded. When saved as matrix.py in the current working directory, one can import the module as follows.

>>> import matrix
>>> A = matrix.Matrix([[13,  1, 20, 18],
...                    [ 9, 24,  0,  9],
...                    [14, 22,  5, 18],
...                    [19,  9, 15, 14]])
>>> print A**-1
        -149/1268  -67/634   83/1268 171/1268
          51/1268 239/1902 -105/1268 -33/1268
Matrix(    73/634 803/4755  -113/634 -87/3170 )
          13/1268  -75/634  197/1268 -83/1268

Matrices are defined over a field, typically \mathbb{F}=\mathbb{R} [1] in theoretical use, though for my implementation I chose not to use a double data structure [2], as it lacked the conceptual precision in numbers like a third [3]. As one cannot truly represent a large portion of the reals anyways, I chose to use \mathbb{F}=\mathbb{Q}, which also is a field though can be — to a certain scalar size and precision — accurately represented using fractional data types (Python’s built-in Fraction is used here).

To simplify working with matrices, the implemented matrix class supports operator overloading such that the following expressions — A[i,j], A[i,j]=l, A*B, A*l, A+B, -A, A/l, A+B, A-B, A**-1, A**"t", ~A, A==B, A!=B — all behave in a coherent and intuitive way for matrices A, B, scalars l and indices i, j.

When working with matrices, there are certain rules that must be obeyed, like proper size when adding or multiplying, invertibility when inverting and others. To minimize potential bug track down problems, I tried to include a variety of detailed exceptions (ValueErrors) explaining the program’s failure at that point.

Apart from basic matrix arithmetic, a large part of my module centers around Gaussian elimination and the functions that follow from it. At their heart lies the implementation of GaussianElimination, a function which calculates the reduced row echelon form rref(A) of a matrix together with the transformation matrix T such that T*A = rref(A), a list of all matrix pivot coordinates, the number of row transpositions used to achieve row echelon form and a product of all scalars used to achieve reduced row echelon form.
From this function, rref(A) simply returns the first, rrefT(A) the second parameter. Functions rcef(A) (reduced column echelon form) and rcefS(A) (A*S = rcef(A)) follow from repeated transposition.
Determinant calculation uses characteristic determinant properties (multilinear, alternating and the unit hypercube has hypervolume one).

Using these properties, the determinant is equal to the product of the total product of all factors used in transforming the matrix into reduced row echelon form and the permutation parity (minus one to the power of the number of transpositions used).
Questions regarding invertibility and rank can also conveniently be implemented using the above described information.

All in all, this Python module implements basic matrix functionality paired with a bit more involved matrix transformations to build a usable environment for manipulating matrices in Python.

Source code: python-matrix-module.py
Jonathan Frech's blog; built 2021/04/16 21:21:49 CEST