Deterministic Chaos

6.Q. IFS Driven by the Tent Map and the Logistic Map

Recall the Driven IFS method for representing data. We take the tent and logistic maps as the generators of our examples.

Here are some examples with the logisitc and tent maps, for the indicated s.

Logistic
0.9, 0.99
1.5, 1.5
2.4, 2.9
3.1, 3.5
3.55, 3.57
3.6, 3.7
3.8, 3.825
3.826, 3.827
3.828, 3.829
3.846, 3.999
Tent
1.2, 1.32
1.4, 1.5
1.7, 1.8
1.9, 1.999
s = 0.9. The fixed point x = 0 is stable, and the iterates rapidly converge to that fixed point. In fact, the convergece is monotone: the first point lies in bin 4 (so T4 is applied), the next two in bin 3, the next three in bin 2, and all the others in bin 1. s = 0.99. The fixed point x = 0 is stable, and the iterates converge to that fixed point, but more slowly. Note three values lie in bin 3 and six lie in bin 2.

Here are some animations of how the driven IFS varies with the s parameter of the logistic and tent maps.

Return to Deterministic Chaos.