Newton-Raphson Method, is a Numerical Method, used for finding a root of an equation.

The method requires the knowledge of the derivative of the equation whose root is to be determined. So we would have to enter that manually in our code.

Newton-Raphson Method may not always converge, so it is advisable to ask the user to enter the maximum number of iteration to be performed in case the algorithm doesn’t converge to a root. Moreover, since the method requires division by the derivative of the function, one should add a condition that prevents division by zero.

The following is a simple version of the program that finds the root, and tabulates the different values at each iteration. Just like any other numerical method bisection method is also an iterative method, so it is advised to tabulate values at each iteration.

### PROGRAM(Simple Version):

/****************************** ****NEWTON RAPHSON METHOD***** 2017 (c) Manas Sharma - https://bragitoff.com ******************************/ #include<stdio.h> #include<math.h> /*Function whose root is to be determined*/ double f(double x){ return 3*x+sin(x)-exp(x); } /*Derivative of the function whose root is to be determined*/ double df(double x){ return 3-cos(x)-exp(x); } int main(){ double x,eps,x1; int maxSteps; printf("Enter the initial guess:n"); scanf("%lf",&x1); printf("Enter the desired accuracy:n"); scanf("%lf",&eps); printf("Enter the max. number of steps:n"); scanf("%d",&maxSteps); int iter=1; /*Newton-Raphson Method begins that tabulates the various values at each iteration*/ printf("____________________________________________________________________________________n"); printf("xtf(x)ttf'(x)ttx1tt|x-x1|ttf(x1)n"); printf("____________________________________________________________________________________n"); do{ x=x1; /* IF-Condition to prevent division by zero[To be done: Check for infinite values too]*/ if(fabs(df(x))>=0.000000001&&df(x)!=NAN){ /*New value of x using the NR Expression */ x1=x-f(x)/df(x); printf("%d.t%lft%lft%lft%lft%lfn",iter,f(x),df(x),x1,fabs(x-x1),f(x1)); iter++; } else{ printf("Sorry! The slope is 0 for one of the iterations.n NR Method failed.n"); return 0; } }while(fabs(x-x1)>=eps&&iter<=maxSteps); printf("_______________________________________________________________________________________nnOne of the roots of the given equation is:nn%lfnnn",x1); }

The better version of the above code uses a function called ‘rootNR’ to perform the NR task and return the root.

However, this function won’t tabulate the values at each iteration.

So in the following program I have also provided another function called ‘printNR’ that would return the root as well as print the various values at each iteration.

### PROGRAM(Better Version):

/****************************** ****NEWTON RAPHSON METHOD***** 2017 (c) Manas Sharma - https://bragitoff.com ******************************/ #include<stdio.h> #include<math.h> /*Function whose root is to be determined*/ double f(double x){ return x*x*x-27; } /*Derivative of the function whose root is to be determined*/ double df(double x){ return 3*x*x; } /*Function that returns the root from Newton-Raphson Method*/ double rootNR(double f(double x),double df(double x),double x1,double eps,double maxSteps){ double x; int i=1; do{ x=x1; if(fabs(df(x))>=0.000000001){ x1=x-f(x)/df(x); i++; } }while(fabs(x-x1)>=eps&&i<=maxSteps); return x1; } /*Newton-Raphson Method Function that tabulates the values at each iteration*/ double printNR(double f(double x),double df(double x),double x1,double eps,double maxSteps){ double x; int iter=1; printf("___________________________________________________________________________________________________n"); printf("itertxttf(x)ttf'(x)ttx1tt|x-x1|ttf(x1)n"); printf("___________________________________________________________________________________________________n"); do{ x=x1; if(fabs(df(x))>=0.000000001){ x1=x-f(x)/df(x); printf("%d.t%lft%lft%lft%lft%lft%lfn",iter,x,f(x),df(x),x1,fabs(x-x1),f(x1)); iter++; } }while(fabs(x-x1)>=eps&&iter<=maxSteps); return x1; } main(){ double x,eps,x1; int maxSteps; printf("Enter the initial guess:n"); scanf("%lf",&x); printf("Enter the desired accuracy:n"); scanf("%lf",&eps); printf("Enter the max. number of steps:n"); scanf("%d",&maxSteps); printf("__________________________________________________________________________________________________nnOne of the roots of the given equation is:nn%lfnnn",printNR(f,df,x,eps,maxSteps)); }

### OUTPUT:

### Related Posts:

Newton-Raphson C++ Program

Newton-Raphson Lab Manual(Contains Flow-chart and algorithm)

Thanks, you help me in my college jobs.

thanks, i need this program

i love you 2

Hello Manas, there would be a mistake on the maths formula.

f'(x[n]) = (f(x[n+1]) – f(x[n])) / (x[n+1] – x[n])

so,

when f(x[n+1]) = 0,

f'(x[n]) = -f(x[n]) / (x[n+1] – x[n])

so,

x[n+1] = x[n] – f(x[n]) / f'(x[n])

But the formula on the image shows that:

x[n+1] = x[n] – f'(x[n]) / f(x[n])

Hello Manas, there would be a mistake on the maths formula on the image.

f'(x[n]) = (f(x[n+1]) – f(x[n])) / (x[n+1] – x[n])

so,

when f(x[n+1]) = 0,

f'(x[n]) = -f(x[n]) / (x[n+1] – x[n])

so,

x[n+1] = x[n] – f(x[n]) / f'(x[n])

Hi there,

Indeed the formula in the image is wrong. Thanks for the correction.

Fortunately there was no such mistake in the program though.

Thanks again.

Thanks for this article! I’ve noticed that it was fixed.