The Computable Differential Equation Lecture ... - Bruce E. Shapiro
The Computable Differential Equation Lecture ... - Bruce E. Shapiro
The Computable Differential Equation Lecture ... - Bruce E. Shapiro
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
CHAPTER 2. SUCCESSIVE APPROXIMATIONS 31<br />
Solution.<br />
x = x 4 + 2x 2 + x − 3<br />
0 = x 4 + 2x 2 − 3<br />
= (x − 1)(x + 1)(x 2 + 3)<br />
Hence the real fixed points are x = 1 and x = −1.<br />
A function f : R ↦→ R has a fixed point if and only if its graph intersects with the<br />
line y = x. If there are multiple intersections, then there are multiple fixed points.<br />
Consequently a sufficient condition is that the range of f is contained in its domain.<br />
⇐=<br />
Figure 2.1: A sufficient condition for a bounded continuous function to have a fixed<br />
point is that the range be a subset of the domain. A fixed point occurs whenever<br />
the curve of f(t) intersects the line y = t.<br />
<strong>The</strong>orem 2.1 (Sufficient condition for fixed point). Suppose that f(t) is a continuous<br />
function that maps its domain into a subset of itself, i.e.,<br />
<strong>The</strong>n f(t) has a fixed point in [a, b].<br />
f(t) : [a, b] ↦→ S ⊂ [a, b] (2.17)<br />
Proof. If f(a) = a or f(b) = b then there is a fixed point at either a or b. So assume<br />
that both f(a) ≠ a and f(b) ≠ b. By assumption, f(t) : [a, b] ↦→ S ⊂ [a, b], so that<br />
Since both f(a) ≠ a and f(b) ≠ b, this reduces to<br />
f(a) ≥ a and f(b) ≤ b (2.18)<br />
f(a) > a and f(b) < b (2.19)<br />
Let g(t) = f(t) − t. <strong>The</strong>n g is continuous because f is continuous. Thus ⇐=<br />
c○2007, B.E.<strong>Shapiro</strong><br />
Last revised: May 23, 2007<br />
Math 582B, Spring 2007<br />
California State University Northridge