The Newton-Raphson method

Experiment Name:
C implementation of Newton-Raphson method.

Theory:
Newton-Raphson method (also known as the Newton’s iteration method), named after Isaac
Newton and Joseph Raphson, is a technique for finding roots of both algebraic and
transcendental equation.

Figure: N-R method

The graph of y=f(x) crosses the x-axis at the point “r” corresponding to the equation f(x) =0.
Let, x0 be an approximate root of the equation f(x) =0. Starting with an initial value x0, we
generate a sequence x0, x1, x2, x3… by repeated application of the iterative step,

This process can be continued till the absolute value of the difference between the successive
approximation say xn and xn+1 is less than the prescribed degree of accuracy Q,

i.e.

| X n+1 − Xn | < Q.

Newton’s method may not work if there are points of inflection, local maximum or minimum
around x0 or the root. The method is very expensive – it needs the function evaluation and
then the derivative evaluation. If the tangent is parallel to the X axis, then the method does
not converge. Also, if the function has multiple roots then Newton’s method will only find
one.

Port City International University Md. Jahidul Islam, CEN 01606343

 The Newton-Raphson method

Code:

Result:

Discussion: From the study, we find out that the convergence rate of N-R method is fast as
compared to other methods. The effectiveness of using scientific calculator in solving non-
linear equations using this method also reduces the time complexity for solving non linear
equation. The N-R method can be used very effectively to determine the intrinsic value based
on its measured permittivity. The derivation of N-R formula, algorithm, drawbacks and C
implementation in N-R method has also been discussed.

References:
[1] “Saba Akram & Qurrat ul Ann”, Newton Raphson Method, Volume 6, Issue 7, July-
2015, ISSN 2229-5518 IJSER © 2015

Port City International University Md. Jahidul Islam, CEN 01606343