6.1 Iteration of Maps

Map

f:AB is a map if for every aA, there exists a unique bB such that f(a)=b.

Iteration (of a Map)

Is an evolution in a subset URn consisting of

xn=f(xn1),nN

The mth iteration of the map f by:

f(0)(x)=f(x),f(m)(x)=f(f(m1)(x))

Linear Map

f:RnRn is linear if ARn×n such that

f(x)=Ax

Fixed Points and Periodic Points

x=f(x) f(m)(x)=x, and f(k)(x)x,1m

Invariant Sets

Let f:ΩRΩR be a map.
DΩ is invariant if f(D)D

xD,f(x)D

Stable/Unstable Sets

Let xΩ be a fixed point under the iteration of f.
Stable:

Ws={xΩ|limnf(n)=x}

Unstable:

Wu={xΩ|limnf(n)(x)=x}

Intersection of Invariant Sets

D=n=0fn(D)=Df(D)f(f(D))

Trapping Set

A trapping region is a closed connected invariant set D such that

f(D)D

Attracting Set

If f:ΩΩ be a map and D be a trapping region under f. Then

A=n=0f(n)(D) is the attracting set D under f

If x0A such that the orbit O(x0) is dense in A, then A is called an attractor.

Contraction Maps

A map is a contraction if:

d(f(x),f(y))λd(x,y)

Contraction Principle

Let IR be a closed interval, possibly infinite on one or both sides, and f:II a λ-contraction. Then f has a unique fixed point x0 and |fn(x)x0|λn|xx0| for every xR, that is, every orbit of f converges to x0 exponentially.