arlable Chapter 3. Nonlinear Equations in URE VaN 60 of Newton's method, using evaluations of f(n) n), and f"(Kn). The following remarks may be helpful in constructing the algorithm: (a) Drive a third order method for solving f(x) = 0 in a way similar to the derivation 6 Use the Taylor expansion with three terms plus a remainder term. Show that in the course of derivation a quadratic equation arises, and therefore two distinct schemes can be derived. (b) Show that the order of convergence (under the appropriate conditions) is cubic. (c) Estimate the number of iterations and the cost needed to reduce the initial error by a factor of 10 does not generate complex roots, make sure to start sufficiently close to a real root. its cubic convergence? Give two reasons. (d) Write a script for solving the problem of Exercise 5. To guarantee that your program (e) Can you speculate what makes this method less popular than Newton's method, despite 7. Consider Steffensen's method