pter 03.04 vton-Raphson Method of Solving a Nonlinea ation ing this oh vee should be able to 1. derive the Newton-Rap 2D. develop the algorithm of the Newton-Ra 3. use the Newton-Raphson method to solve a no AL disewss the drawhacks of the Newton-Raphson method. method, inear equation, and Bin xls such as the bisection method and the false position method of finding roots rear equation f(x) = 0 require bracketing of the root by (wo guesses. Such met Ned Aracketiny methods, These methods are always convergent since they are base ‘ng the interval between the two guesses so as to Zero in on the root of the equation In the Newton-Raphson method, the root is not bracketed. In fact, only one | “of the root is needed to get the iterative process started to find the root of an equ ethod hence falls in the category of open methods, Convergence in open meth: uaranteed but if the method does converge, it does so much faster than the bract ods, vation Newton-Raphson method is based on the principle that if the initial guess of the | then if one draws the tangent to the curve at f(x,), the point x, the x-axis is an improved estimate of the root (Figure 1). n of the slope of a funetion, at x= x,