File Exchange

## newtonraphson(f,df,​xo,tol)

version 1.0.0.0 (614 Bytes) by
Newton Raphson Method comparison with BISECTION and REGULA-FALSI METHOD

Updated 22 Aug 2016

Let the given equation be f(x) = 0 and the initial approximation for the root is x0. Draw a tangent to the curve y = f(x) at x0 and extend the tangent until x-axis. Then the point of intersection of the tangent and the x-axis is the next approximation for the root of f(x) = 0. Repeat the procedure with x0 = x1 until it converges.

f(x) =x^3-3*x+1
the above function has two roots in between -2 to -1 and in between 1 to 2.

% Newton Raphson Method comparison with BISECTION and REGULA-FALSI METHOD
%%
clear all
clc
x=-3:0.01:3;
y=x.^3-3*x+1;
plot(x,y)
grid on
%%
a=1;
b=2;
xo=2;
tol=0.01;
f=inline('x^3-3*x+1');
df=inline('3*x^2-3');
disp('Regula falsi Method')
disp('--------------------')
R=Regulafalsi(f,a,b,tol);
disp('Bisection Method')
disp('--------------------')
B=bisection(f,a,b,tol);
disp('Newton Raphson Method ')
disp('----------------------')
N=newtonraphson(f,df,xo,tol);

### Cite As

N Narayan rao (2021). newtonraphson(f,df,xo,tol) (https://www.mathworks.com/matlabcentral/fileexchange/58749-newtonraphson-f-df-xo-tol), MATLAB Central File Exchange. Retrieved .