Consider the code below that implements Newton’s method and answer the following questions.

(a) What is the largest real root of the function studied in this problem?

(b) What is the criterion for convergence in terms of the value x^(k) on the kth iteration?

(c) When I run the program with an initial guess x⁽⁰⁾ = 1.1, I get the following:

Explain the behavior of the error (i) near the initial guess and (ii) near the root.

Transcribed Image Text:

1 function problem3_9 2 fprintf('x \t error \n') 3 error = abs (x+log (x) -x); 4 fprintf('86.9f \t 86.6e \n',x, error) 5 while error > 10^(-8) 6 7 8 9 end X = X - (x+log (x) -x) /log(x); error = abs (x* log(x) -x); fprintf('%6.9f \t $6.6e \n',x, error)