Baker map

This simulation computes a class of generalized baker maps defined in the unit square as follows:
xn+1 = xn / a + [b yn] / b
yn+1 = b yn mod 1
where [y] = y - y mod 1 is the integer part of y, i.e., the largest integre not larger than y.



Activities

  1. Start the simulation by pressing Start. By default the orbit will be erased after the first 100 steps to skip the transitory until the system is on the attractor (well, very very close to it).
  2. Use different initial values for x and y. Is there any difference in the displayed section? Discuss your answer.
  3. Use the mouse to select smaller and smaller parts of the attractor section. The increased resolution will show that the attractor has structure at all magnification levels: it is a fractal, much like a Cantor set.
  4. Notice that at higher magnifications you will have to wait longer to get a number of solution points high enough to see the attractor.
  5. Press Whole space to recover the original magnification.
  6. Change the values of the integers a and b and discuss the shortcomings of computing this kind of maps with finite binary precision (for instance, when b is even).
  7. You can run the example baker of Dynamics Solver for a much faster simulation, which allow exploring the Cantor set structure of the attractor.



This is an English translation of the Basque original for a course on mechanics, oscillations and waves.
It requires Java 1.5 or newer and was created by Juan M. Aguirregabiria with Easy Java Simulations (Ejs) by Francisco Esquembre. I thank Wolfgang Christian and Francisco Esquembre for their help.