Iterated Function Article Index for
Iterated 		Articles about
Iterated Function 		Website Links For
Iterated 		 

Information About

Iterated Function
  CATEGORIES ABOUT ITERATED FUNCTION
   
dynamical systems
   
fractals
   
sequences
   
fixed points
   
functions and mappings
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...




DEFINITION

The formal definition of an iterated function on a Set X follows:

Let X be a set and f:X ightarrow X
be a Function . Define the n'th iterate
f^n of f by f^0=\operatorname{id}_X
where \operatorname{id}_X is the Identity Function on X, and f^{n+1} = f \circ f^n.

In the above, f \circ g denotes Function Composition ; that is, (f \circ g)(x)=f(g(x)).


CREATING SEQUENCES FROM ITERATION


The sequence of functions f^n is called a Picard sequence, named after Charles Émile Picard . For a given x in X, the Sequence of values f^n(x) is called the '''orbit''' of x.

If f^n(x) = f^{n+m}(x) for some integer m, the orbit is called a periodic orbit. The smallest such value of m for a given x is called the '''period of the orbit'''. The point x itself is called a Periodic Point .


FIXED POINTS


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 Theorem s 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.


LIMITING BEHAVIOUR


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 Point s 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 Set s and Unstable Set s, according to the behaviour of small Neighborhood s under iteration.

Other limiting behaviours are possible; for example, Wandering Point s are points that move away, and never come back even close to where they started.


FLOWS


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 .


CONJUGACY


If ''f'' and ''g'' are two iterated functions, and there exists a Homeomorphism ''h'' such that g=h^{-1} \circ f \circ h, then ''f'' and ''g'' are said to be Topologically Conjugate . Clearly, topological conjugacy is preserved under iteration, as one has that g^n=h^{-1}\circ f^n \circ h, 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 .


MARKOV CHAINS


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 .


EXAMPLES

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 Operator s.


SEE ALSO



REFERENCES

  • Vasile I. Istratescu, ''Fixed Point Theory, An Introduction'', D.Reidel, Holland (1981). ISBN 90-277-1224-7