ch02_8
ch02_8
y ' = f (t , y ), y (0) = 0
The same conclusion will then hold for the initial value problem
y ' = f (t , y ), y (0) = 0
as holds for the integral equation.
t
φ (t ) = ∫ f [ s, φ ( s )] ds
0
fi
ff
The Method of Successive Approximations
One method of showing that the integral equation has a unique
solution is known as the method of successive approximations or
Picard’s iteration method. We begin by choosing an initial function
that in some way approximates the solution. The simplest choice
utilizes the initial condition
φ0 (t ) = 0
The next approximation φis 1 obtained by substituting φ0 ( sfor
) φ (s)
into the right side of the integral equation. Thus
t t
φ1 (t ) = ∫ f [ s, φ0 ( s )] ds = ∫ f [ s, 0] ds
0 0
t
Similarly, φ2 (t ) = ∫ f [ s, φ1 ( s )] ds
0
t
And in general,
φn +1 (t ) = ∫ f [ s, φn ( s )] ds
0
Examining the Sequence
As described on the previous slide, we can generate the sequence
Each member of the sequence satis ed the initial condition, but in general none
satis es the di erential equation. However, if for some n = k, we nd
φk +1 (t ) = φk (t ) , then φk (t ) is a solution of the integral equation and hence of the
initial value problem, and the sequence is terminated.
In general, the sequence does not terminate, so we must consider the entire
in nite sequence. Then to prove the theorem, we answer four principal
questions.
fi
fi
ff
fi
fi
Four Principal Questions about the
Sequence φ (t ) = ∫ f [s,φ (s)] ds
t
n +1 n
0
2 4 6 8 2n
φn (t ) = t + t /2! + t /3! + t /4! + !+ t / n!
This can be proved true for all n ≥ 1 by mathematical induction. It was already
established for n =1 and if we assume it is true for n = k, we can prove it true for n =
k+1:
t
φk +1 (t ) = ∫ 2 s [1 + φk ( s )] ds
0
t 4 2k
2 s s
= ∫ 2 s [1 + s + + !+ ] ds
0
2! k!
4 2k 2 ( k +1)
t 2 t t
= t + + !+ +
2! k! (k + 1)!
Thus, the inductive proof is complete.
Example 1: The Limit of the Sequence (3 of 6)
φn (t ) = t 2 + t 4/2! + t 6/3! + t 8/4! + !+ t 2 n/ n!
2
φ1 (t )
1
t
-2 -1 0 1 2
n
t 2k ∞
t 2k t2
φ (t ) = lim φn (t ) = lim ∑ =∑ = e −1
k =1 k! k =1 k!
n →∞ n →∞
1.0
k=1→
← k=20
0.5
t
-3 -2 -1 1 2 3
t
U (t ) = ∫ φ ( s ) −ψ ( s ) ds
0
Notice that U(0) = 0 and U(t) ≥ 0 for t ≥ 0 and U(t) is di erentiable with
U ' (t ) = φ (t ) −ψ (t )
This gives:
U ' (t ) − AU (t ) ≤ 0 and multiplying by e -At
-At -At
(e U (t ))' ≤ 0 ⇒ e U (t ) ≤ 0 ⇒ U (t ) ≤ 0 for t ≥ 0
The only way for the function U(t) to be both greater than and less than zero is for it
to be identically zero. A similar argument applies in the case where t ≤ 0. Thus we
can conclude that our solution is unique.
fi
ff
Theorem 2.8.1: The First Step in the Proof
y ' = f (t , y ), y (0) = 0
t
φn +1 (t ) = ∫ f [ s, φn ( s )] ds
0
If the assumptions of this theorem are not satis ed, you cannot be guaranteed
a unique solution to the IVP. There may be no solution or there may be more
than one solution.
ff
fi