In Matlab...

1. Implement Newton's method to find a root of a given function FOx),i.e. solve F(x)S0. The main program should read in x0 initial guess for the root, maxIT maximum number of iterations to be performed TOL tolerance for testing convergence and should call the Newton rootfinder (see below) Your program should output the input values, and then the iterates F xn) and upon convergence, the root. The values of FCX) and FOx) should be computed in a subprogram FCN(xn, Fn, DFn) called by the rootfinder. A good way to code Newton rootfinder and decide convergence is something like this (pseudocode): subprogram NewtonlD( x0 TOL, maxi x0 000.0 something big 1 print n labels for values for n-1 Max IT call FCN xn, Fn, DFn) returns Fn-F (xn), DFn-F (xn) 1 print n use formated printing in columns if ABS (dx TOL) then if ABS (Fn TOL then print DONE: root Fa' Fn, in ',n, iters break out of the loop how depends on the language. else print STUCK dx TOL BUT residual Fn, TOL break out of the loop endif endif Fn/DFna [take Newton step end for print "BAD: reached maxIT END subprogram