TITLE:

Determination of Real Roots of a Non-Linear Equation Using NEWTON-RAPHSON Method.

BACKGROUND:
Around 1669, Isaac Newton gave a new algorithm to solve a polynomial equation and it was illustrated on
the example y^3-2^y-5=0. To find an accurate root of the equation, first one must guess a starting value,
here y>>2. Then just write y=2+p and after the substitution the equation becomes
p^3+6p^2+10p-1=0.
Because p is supposed to be small we neglect p^3+6p^2 compared to 10p-1 and the previous equation
gives p>>0.1, therefore it’s possible to better approximation of the rot is y>>2.1. it’s possible to repeat
this process and write p=0.1+q, the substitution gives
q^3+6.3q^2+10p-1+0
few years later new step was made by Raphson, on the equation x^3-bx+c=0 and for x>>g+
𝑐 + 𝑔3 − 𝑏𝑔
𝑏 − 3𝑔2

Here the denominator of the fraction is opposite of the derivative of the numerator.
This was the historical beginning of Newton-Raphson algorithm.
OBJECTIVE:
To find the nth root of the linear or non-linear equation.

THEORY:
We first remind the reader of some basic notation: If f(x)is a given function the value of x for
which f(x)= 0 is called a root or zero of the function. We also distinguish between various
types of roots: Simple and multiple roots.
More precisely; a root x0 is said to be:
𝑑𝑓
a simple root if f(x0) = 0 and 𝑑𝑥 ≠ 0
𝑑2 𝑓
a double root if f(x0) = 0 and 𝑑𝑥 2 ≠ 0
and so on.

METHODOLOGY:
Let x0 be a good estimate of r and let r = x0 + h. Since the true root is r,
and h = r −x0, the number h measures how far the estimate x0 is from the
truth.
Since h is small, we can use the linear (tangent line) approximation to
conclude that
0 = f(r) = f(x0 + h) _ f(x0) + hf
0(x0);
and therefore, unless f0(x0) is close to 0,
h _ −f(x0)
f0(x0) :
It follows that
r = x0 + h _ x0 − f(x0)
f0(x0) :
Our new improved (?) estimate x1 of r is therefore given by
x1 = x0 − f(x0)
f0(x0) :
The next estimate x2 is obtained from x1 in exactly the same way as x1 was
obtained from x0:
x2 = x1 − f(x1)
f0(x1) :
Continue in this way. If xn is the current estimate, then the next estimate
xn+1 is given by
xn+1 = xn − f(xn)
f0(xn)

PRACTICAL EEE EXAMPLE:

G(S) = 1/s(s-3)
H(S) =1
The characteristic equation:
1+G(S)H(S)=0
Or, 1+1/s(s-3) =0
Or, s^2-3*x+1=0
So the function is= f(s) = s^2-3*x+1=0

ALGORITHM:

1. Start
2. Read x ,e, n, d [ x is initial guess, e is the absolute error, ,n is operating loop,
d is checking slope
3. Do for i =1 to n in step of 2
 4. f =f(x)
5. f1=f’(x)
6. if (|𝑓1|< d), then display too small scope and go to 11
𝑓
7. x1 = x- ⁄𝑓1
8. if ([x1 – x)/x1 ] < e), then display the root as x1 and go to 11
9. x= x1 and end loop
10.display method does not converge due to oscillation
11.stop

FLOWCHART:

SIMULTION IN MATLAB PROGRAMMING ENVIRONMENT:

clc
syms x;
f=input('Give the function of x-- ');
fd=diff(f);
x=input('Give a initial value of x--');
z=input('Give the minimum considering error=');
fprintf('\n\n x0 x1 Error');
for i=1:100
a=subs(f);
b=subs(fd);
x0=x;
x1=x-(a/b);
x=x1;
e=abs(1-x0/x1);
fprintf('\n %4.8f %4.8f %6.8f\n',x0,x1,e);
if e<=z
break
end
end

OUTPUT:

Give the function of x-- x^2-3*x+1

Give a initial value of x--3
Give the minimum considering error=.001

x0 x1 Error
3.00000000 2.66666667 0.12500000

2.66666667 2.61904762 0.01818182

2.61904762 2.61803445 0.00038700

solution =

2.6180

RESULT AND COMPARISON:

By using, Bisection method we have got the root 2.6180 and using calculator we got the root 2.6180 .
The solutions are same.

CONCLUSION:
We can say that, NEWTON-RAPHSON method is an useful method for solving non-linear equation. It is
more accurate method than other method.

APPLICATION:
Analysing any nonlinear system we can use this method for finding roots of those equations.Exm:Control
System,Electrical Machine,Electronics etc.