Attractors of Iterated Affine Transform Systems

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

An iterated function system (IFS) maps a set of affine transforms on a point and the resulting images repeatedly. If the system contains functions, there are points after iterations and the number of points grows exponentially. To reduce the volume of data, instead of applying all of the functions of the system at each step, only one is chosen, according to some given probability. This Demonstration shows how the attractors for eight particular systems emerge as you increase the number of iterations. There are two astonishing things about IFS: first, the attractor does not depend on the initial point; second, the probabilities for each transform can concentrate the points in certain regions and improve the picture. Fractal structures can be explored with the zoom control.

Contributed by: Bernard Vuilleumier (March 2011)
Open content licensed under CC BY-NC-SA



Hutchinson demonstrates that, if the transformations are contracting (i.e., the determinant of the matrix is less than 1), there exists an attractor and it is unique (J. E. Hutchinson, "Fractals and self-similarity," Indiana Univ. Math Journal, 30, 1981 pp. 713-747).

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.