So long as each ti is a contraction certainly true in

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n of all of the Ti produce points that stay in A. Lemma 2.4.2 Σ ⊆ A. With Lemma 2.4.2 we have shown that the points generated by the random algorithm all lie in the attractor A of the IFS. Next we show that every sequence Σ produced by the random algorithm comes arbitrarily close to filling up the attractor A. In computational terms, this means the (finite) sequence of points generated by an implementation of the random algorithm eventually will fill in the attractor to the resolution of the monitor. Pixels are not points, so eventually every pixel containing points of A will have been visited by the 52 CHAPTER 2. ITERATED FUNCTION SYSTEMS random sequence, and the image on the screen will not change, regardless of the additional runtime. When the Ti are linear, this stabilization of the image can occur rather rapidly; for nonlinear Ti , it can take a very, very long time, and we need to seek other approaches. A central notion, one we shall use in many instances in addition to proving the equivalence of the random and determinis...
View Full Document

Ask a homework question - tutors are online