, iterated functions
are the objects of deep study in computer science
and dynamical systems
. An iterated function is a function which is composed
with itself, repeatedly, a process called iteration
The formal definition of an iterated function on a set
Let be a set and
be a function. Define the 'th iterate
where is the identity function on , and .
In the above, denotes function composition; that is, .
Creating sequences from iteration
The sequence of functions is called a Picard sequence, named after Charles Émile Picard. For a given in , the sequence of values is called the orbit of .
If for some integer , the orbit is called a periodic orbit. The smallest such value of for a given is called the period of the orbit. The point itself is called a periodic point.
If m=1, that is, if f(x) = x for some x in X, then x is called a fixed point of the iterated sequence. The set of fixed points is often denoted as Fix(f). There exist a number of fixed-point theorems that guarantee the existence of fixed points in various situations, including the Banach fixed point theorem and the Brouwer fixed point theorem.
There are several techniques for convergence acceleration of the sequences produced by fixed point iteration. For example, the Aitken method applied to an iterated fixed point is known as Steffensen's method, and produces quadratic convergence.
Upon iteration, one may find that there are sets that shrink and converge towards a single point. In such a case, the point that is converged to is known as an attractive fixed point. Conversely, iteration may give the appearance of points diverging away from a single point; this would be the case for an unstable fixed point.
When the points of the orbit converge to one or more limits, the set of accumulation points of the orbit is known as the limit set or the ω-limit set.
The ideas of attraction and repulsion generalize similarly; one may categorize iterates into stable sets and unstable sets, according to the behaviour of small neighborhoods under iteration.
Other limiting behaviours are possible; for example, wandering points are points that move away, and never come back even close to where they started.
The idea of iteration can be generalized so that the iteration count n becomes a continuous parameter; in this case, such a system is called a flow.
If f and g are two iterated functions, and there exists a homeomorphism h such that , then f and g are said to be topologically conjugate. Clearly, topological conjugacy is preserved under iteration, as one has that , so that if one can solve one iterated function system, one has solutions for all topologically conjugate systems. For example, the tent map is topologically conjugate to the logistic map.
If the function can be described by a stochastic matrix, that is, a matrix whose rows or columns sum to one, then the iterated system is known as a Markov chain.
Famous iterated functions include the Mandelbrot set
and Iterated function systems
If f is the action of a group element on a set, then the iterated function corresponds to a free group.
Means of study
Iterated functions can be studied with the Artin-Mazur zeta function
and with transfer operators
In computer science
In computer science
, iterated functions occur as a special case of recursive functions
, which in turn anchor the study of such broad topics as lambda calculus
, or narrower onces, such as the denotational semantics
of computer programs.
- Vasile I. Istratescu, Fixed Point Theory, An Introduction, D.Reidel, Holland (1981). ISBN 90-277-1224-7