UCLA MATH 151B, Summer 2020, FINAL EXAM

NAME STUDENT ID #
This is an open-book and open-note examination. Please show all your work.
There are 4 problems of total 100 points.

SCORE:

1
————–

2
————–

3
————–

4
————–

Total
———————
1.

a) Write the kth step update rule using the Newton’s method to solve
✓ ◆
x1 + sin(x2 )
F (x1 , x2 ) = (1)
10x2
(for the kth step, express xk1 and xk2 , using the variables corresponding to the previous
iteration k-1).
b) Write the kth step if one uses Euler method to solve
✓ ◆
dx 100x1
= (2)
dt x2
2.
The Trapezoidal Method for solving IVPs is an implicit scheme given by
h
wi+1 = wi + f (ti , wi ) + f (ti+1 , wi+1 )
2
Find the local truncation error of this method.
3.
a) Convert Convert y 000 = 4y 2 + y 0 + y 00 to a system of first-order ODEs.

b) Consider the BVP :

y 00 + y = 0, 0  x  b, y(0) = 0, y(b) = B. (3)

find b and B such that the BVP has (i) No solution (ii) Exactly one solution.
4.

(a) Consider the following system of equations,

x21 x2 + ex2 = 0, and
x21 x1 x2 + 4x22 = 0.
Give the appropriate equation(s) necessary to use the method of Steepest Descent to ap-
proximate the solution of the system of equations.
(b) Given the initial guess [x1 , x2 ]T = [1, 0]T , find the direction of the first step that would
be taken using the method of Steepest Descent.