Description
1 Part I (50%)
This part is required to be submitted in class.
(1) Let F : Rn ! Rn and g(~x) = kF(~x)k
2
2. Show that
rg(~x)=2J(~x)
T F(~x),
where J(~x) is the Jacobian matrix of F(~x). In particular, if F(~x) = A~x ~b, then
rg(~x)=2AT (A~x ~b).
(2) Exercise 10.4.1. (a, b).
(3) Exercise 10.5.3. (a, b).
(4) Exercise 10.2.1. (a).
2 Part II (50%)
Consider the following nonlinear system
8
>< >:
15×1 + x2
2 4×3 = 13
x2
1 + 10×2 x3 = 11
x3
2 25×3 = 22.
Solve the system by applying the following methods with ~x(0) = ~0, and compare the performance of each method
in terms of the number of iterations, the running time, and the error, i.e.,
~x(k) ~x ⇤
1 where ~x ⇤ is the actual
solution.
(a) Use Newton’s method with the stopping criteria
~x(k) ~x(k1)
1 < 106.
(b) Use the method of Steepest Descent to approximate the solution.
(c) Use the homotopy method with the midpoint method and the Runge-Kutta method of order four respectively, where N = 10; 20; 50. Which way performs better?
Requirements Submit to CCLE a file lastname_firstname_hw7.zip containing the following files:
• MATLAB functions: Newton.m that implements Newton’s method, steep.m that implements the method
of steepest descent, homotopy.m that implements the homotopy method with various IVP solvers1, e.g.,
midpoint method and RK4; and a MATLAB script main.m that solves the given nonlinear system.
• A PDF report that displays the solutions and answers the above questions.
Remark: Please try to make your codes as ecient as possible so that the comparison is fair, especially to
reduce the number of function evaluations. For instance, you may create some intermediate variables to avoid
duplicate computations. The running time varies with programs and computer configurations.
1One input argument should be set as a string to specify which IVP solver is to be used.
1