Review Questions and Problems
Review Questions and Problems
a program of the iteration that gives a printout of the 7. Maximum A. What is the largest possible a in
first approximations y0, y1, . . . , yN as well as their Example 1 in the text?
graphs on common axes. Try your program on two 8. Lipschitz condition. Show that for a linear ODE
initial value problems of your own choice. y r ⫹ p(x)y ⫽ r(x) with continuous p and r in
(b) Apply the iteration to y r ⫽ x ⫹ y, y(0) ⫽ 0. Also ƒ x ⫺ x 0 ƒ ⬉ a a Lipschitz condition holds. This is
solve the problem exactly. remarkable because it means that for a linear ODE the
(c) Apply the iteration to y r ⫽ 2y 2, y(0) ⫽ 1. Also continuity of f (x, y) guarantees not only the existence
solve the problem exactly. but also the uniqueness of the solution of an initial
(d) Find all solutions of y r ⫽ 2 1y, y(1) ⫽ 0. Which value problem. (Of course, this also follows directly
of them does Picard’s iteration approximate? from (4) in Sec. 1.5.)
(e) Experiment with the conjecture that Picard’s 9. Common points. Can two solution curves of the same
iteration converges to the solution of the problem for ODE have a common point in a rectangle in which the
any initial choice of y in the integrand in (7) (leaving assumptions of the present theorems are satisfied?
y0 outside the integral as it is). Begin with a simple ODE 10. Three possible cases. Find all initial conditions such
and see what happens. When you are reasonably sure, that (x 2 ⫺ x)y r ⫽ (2x ⫺ 1)y has no solution, precisely
take a slightly more complicated ODE and give it a try. one solution, and more than one solution.