Online Computer Dictionary
Browse words

Based on
FOLDOC
Queried for: Iterated Function System
Definition:
(IFS) A class of fractals that yield naturallooking forms like ferns or snowflakes. Iterated Function Systems use a very easy transformation that is done recursively.
Definition from wikipedia.org
In mathematics, iterated function systems or IFSs are a method of constructing fractals; the resulting constructions are always selfsimilar.
IFS fractals, as they are normally called, can be of any number of dimensions, but are commonly computed and drawn in 2D. The fractal is made up of the union of several copies of itself, each copy being transformed by a function (hence "function system"). The canonical example is the Sierpinski gasket also called the Sierpinski triangle. The functions are normally contractive which means they bring points closer together and make shapes smaller. Hence the shape of an IFS fractal is made up of several possiblyoverlapping smaller copies of itself, each of which is also made up of copies of itself, ad infinitum. This is the source of its selfsimilar fractal nature.
Contents
Definition[edit]
Formally, an iterated function system is a finite set of contraction mappings on a complete metric space.^{[1]} Symbolically,
is an iterated function system if each is a contraction on the complete metric space .
Properties[edit]
Hutchinson (1981) showed that, for the metric space , such a system of functions has a unique compact (closed and bounded) fixed set S. One way of constructing a fixed set is to start with an initial point or set S_{0} and iterate the actions of the f_{i}, taking S_{n+1} to be the union of the image of S_{n} under the f_{i} ; then taking S to be the closure of the union of the S_{n}. Symbolically, the unique fixed (nonempty compact) set has the property
The set S is thus the fixed set of the Hutchinson operator
The existence and uniqueness of S is a consequence of the contraction mapping principle as is the fact that
for any nonempty compact set in . (For contractive IFS this convergence takes place even for any nonempty closed bounded set ). Random elements of S may be obtained by the "chaos game" below.
Recently it was shown that the IFSs of noncontractive type (i.e. composed of maps that are not contractions with respect to any topologically equivalent metric in X) can yield attractor.
These arise naturally in projective spaces, though classical irrational rotation on the circle can be adapted too.^{[2]}
The collection of functions generates a monoid under composition. If there are only two such functions, the monoid can be visualized as a binary tree, where, at each node of the tree, one may compose with the one or the other function (i.e. take the left or the right branch). In general, if there are k functions, then one may visualize the monoid as a full kary tree, also known as a Cayley tree.
Constructions[edit]
Sometimes each function is required to be a linear, or more generally an affine transformation and hence represented by a matrix. However, IFSs may also be built from nonlinear functions, including projective transformations and Möbius transformations. The Fractal flame is an example of an IFS with nonlinear functions.
The most common algorithm to compute IFS fractals is called the chaos game. It consists of picking a random point in the plane, then iteratively applying one of the functions chosen at random from the function system and drawing the point. An alternative algorithm is to generate each possible sequence of functions up to a given maximum length, and then to plot the results of applying each of these sequences of functions to an initial point or shape.
Each of these algorithms provides a global construction which generates points distributed across the whole fractal. If a small area of the fractal is being drawn, many of these points will fall outside of the screen boundaries. This makes zooming into an IFS construction normally impractical.
Although the theory of IFS requires each function to be contractive, in practice software that implements IFS only require that the whole system be contractive on average.^{[3]}
Examples[edit]
The diagram shows the construction on an IFS from two affine functions. The functions are represented by their effect on the biunit square (the function transforms the outlined square into the shaded square). The combination of the two functions forms the Hutchinson operator. Three iterations of the operator are shown, and then the final image is of the fixed point, the final fractal.
Early examples of fractals which may be generated by an IFS include the Cantor set, first described in 1884; and de Rham curves, a type of selfsimilar curve described by Georges de Rham in 1957.
History[edit]
IFS were conceived in their present form by John E. Hutchinson in 1981 ^{[4]} and popularized by Michael Barnsley's book Fractals Everywhere.
"IFSs provide models for certain plants, leaves, and ferns, by virtue of the selfsimilarity which often occurs in branching structures in nature."
—Michael Barnsley et al.^{[5]}
See also[edit]
 Lsystem
 Fractal compression
 Fractal flame
 Complex base systems
 Infinite compositions of analytic functions
Notes[edit]
 ^ Michael Barnsley, "Fractals Everywhere", Academic Press, Inc., 1988.
 ^ M. Barnsley, A. Vince, The Chaos Game on a General Iterated Function System
 ^ Draves, Scott; Erik Reckase (July 2007). "The Fractal Flame Algorithm" (pdf). Retrieved 20080717. Cite uses deprecated parameters (help)
 ^ Hutchinson, John E. (1981). "Fractals and self similarity". Indiana Univ. Math. J. 30 (5): 713–747. doi:10.1512/iumj.1981.30.30055.
 ^ Michael Barnsley, et al.,"Vvariable fractals and superfractals" PDF (2.22 MB)
References[edit]
 Draves, Scott; Erik Reckase (July 2007). "The Fractal Flame Algorithm" (pdf). Retrieved 20080717. Cite uses deprecated parameters (help)
 Falconer, Kenneth (1990). Fractal geometry: Mathematical foundations and applications. John Wiley and Sons. pp. 113–117, 136. ISBN 0471922870.
 Barnsley, Michael; Andrew Vince (2010). "The Chaos Game on a General Iterated Function System" (pdf). Ergodic Theory Dynam. Systems 31 (2011), no. 4, 1073–1079. Retrieved 20130605. Cite uses deprecated parameters (help)

Browse through top 20 categories or see more ...
 programming (659)
 application (76)
 networking (823)
 language (1034)
 operating_system (420)
 mathematics (228)
 graphics (155)
 compiler (21)
 library (41)
 WorldWide_Web (133)
 cryptography (36)
 database (166)
 algorithm (132)
 logic (61)
 software (72)
 audio (27)
 virtual_reality (10)
 communications (329)
 file system (28)
 filename_extension (25)