Math4501 Lecture 3
Review from last lecture
Bisection method for finding root
P1. Let be a continuous function on , find such that .
P2. Let be a continuous function on , find such that .
Theorem 1:
solution to P1 exists if .
Theorem 2:
Fixed point theorem:
If solution to P2 exists, then .
Bijection method
Obtain two sequence and .
Initially, we set and .
If , then and are Cauchy sequence. So their limit exists.
.
Simple iteration method
Definition of Simple Iteration
Given , we define a sequence by
If a simple iteration converges, the it converges to a fixed point of
Proof
Let .
is continuous if and only if is continuous at .
Definition of Lipschitz continuous
A function is Lipschitz continuous if for all , there exists a constant such that
for some .
Lipschitz continuous is a stronger condition than continuous.
If a function is Lipschitz continuous, then it is continuous.
However, the converse is not true.
Definition of contraction mapping
A function is a contraction mapping if it is Lipschitz continuous with .
Theorem of simple iteration
Let is a contraction mapping (Lipschitz continuous with , with pointwise ontinuous ).
Then
- has a unique fixed point
- Simple iteration converges to for any .
Proof
Uniqueness:
Suppose and are two fixed points of .
Then .
Thus, , which implies .
A more general result:
Brouwer’s fixed point theorem
Convergence:
Let be the unique fixed point of .
Then,
\begin{aligned} |x_n-\xi|&=|g(x_{n-1})-g(\xi)|\\ &\leq L|x_{n-1}-\xi|\\ &=L|g(x_{n-2})-g(\xi)|\\ &\leq L^2|x_{n-2}-\xi|\\ &\vdots\\ &\leq L^n|x_0-\xi|Thus, we can always find such that for any . Choose .
Therefore, converges to .