MAT 461/561: 13.1 The Shooting Method For BVP: Announcements
MAT 461/561: 13.1 The Shooting Method For BVP: Announcements
James V. Lambers
Announcements
Final Exam: either oral (over Skype or Zoom or...) or coding project (on Assignments page), on
BVP. Please make your choice and let me know, all work must be completed by Thursday, May 14
(anytime)
• fy > 0 on domain
(y 1 )0 = y 2
(y 2 )0 = f (x, y 1 , y 2 )
where y 1 = y, y 2 = y 0 . Initial conditions: y 1 (a) = α, y 2 (a) = t. The goal is to find t∗ such that
F (t∗ ) = y 1 (b; t∗ ) − β = 0
where y 1 (x; t) is the solution y 1 (x) obtained from initial condition y 2 (a) = t. That is, we’re finding
a root of F (t).
1
Linear Problems
A linear BVP has an ODE of the form
therefore fy = q(x), fy0 = p(x). Therefore we assume q(x) > 0 since fy > 0 ensures unique solution.
2
To solve this BVP using the Shooting Method, we first solve these problems:
y(a) = y1 (a) + ty2 (a) = α + 0 = α, y 0 (a) = y10 (a) + ty20 (a) = t, β = y(b) = y1 (b) + ty2 (b)
Nonlinear Problems