Scribd
Upload
2 views21 pages

LESSON 04-NEWTON RAPHSON METHOD

The document discusses the Newton-Raphson method for finding roots of functions, which utilizes a tangent line for approximation rather than a secant line. It outlines the iterative process, including convergence tests to determine the suitability of initial values, and provides a structured algorithm for implementation. Additionally, it presents sample problems and tabulated results demonstrating the method's effectiveness in rapidly converging to the true root.

Uploaded by

jomar.cabangunay
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
2 views21 pages

LESSON 04-NEWTON RAPHSON METHOD

The document discusses the Newton-Raphson method for finding roots of functions, which utilizes a tangent line for approximation rather than a secant line. It outlines the iterative process, including convergence tests to determine the suitability of initial values, and provides a structured algorithm for implementation. Additionally, it presents sample problems and tabulated results demonstrating the method's effectiveness in rapidly converging to the true root.

Uploaded by

jomar.cabangunay
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
» tL Newton-Raph This method is also based on a linear approximation of a function. The [ie line that best approximates the graph of a function at a point on its re graph is the line tangent to the graph at that point. The Newton's Method makes use of this tangent line instead of the secant line to Wa approximate the root of a function. However, a test for convergence is m@ introduced to check whether the solution becomes convergent or Ba divergent at any initial value (x). This method is also applicable to G both polynomial and transcendental equations. yy i e Wee WN Open Methods The process begins by assuming an initial value x, that will be substituted later fo the iferation. The initial value x is then subjected to the convergence test formula to verify whether it is convergent or divergent. If follows that if the initial value Xp satisfies the convergent condition then it is used for iteration otherwise a new initial value Xp is selected and substituted to the convergence formula. Convergence Test: fo) - fo) FG)? IFO estimate the root of ff = x, employing an initial guess of x) Solution. The first derivative of the function can b as Sample Problem Starling with an initial guess of x, = 0.5, this iterative equation can be applied to compute Iteration | x, f(x) F(x) Xe Ea (%) 1 Os 0.106531 -1.89895 | 0.5561 0.100881 2 0.5561 | 0.017341 -1.98281 | 0.564846 0.015484 a 0.564846 | 0.003602 -1.9964 | 0.56665 0.003184 4 0.56665 0.000773 -1.99923 | 0.567037 0.000682 00% Thus, the approach rapidly converges on the true root. Notice that the true percent relative error at each iteration decreases much faster than it does in simple fixed-point iteration Use newton raphson method to locate the root of f(x) 10 7.724326 6.057076 4.865019 4.05882 3.583327 3.386118 3.35121 3.350174 7512 2349.589 726.1917 218.422 61.35194 14,23226 1.872548 0.052492 4.54E-05 3301 1409.26 609.1922 270.9284 129.0281 72.16838 53.6422 50.64878 50.5619 7.724326 6.057076 4.865019 4.05882 3.583327 3.386118 3.35121 3.350174 3.350173 27.52567§ 24.50261)

You might also like