Unformatted text preview: , x 1 = 1 . (d) Which of these methods converges fastest? Rank the methods. 2. Write a matlab code newton.m which implements Newton’s method (as discussed in class). Test your code on the function in problem 1 with initial guess x = 0 . Take your tolerances f tol and x tol to be 10-5 and set the maximum number of iterations to 100. Submit the mﬁle and the diary....
View Full Document
- Spring '08
- initial guess, Root-finding algorithm, positive real root, matlab code newton.m