Scribd
Upload
18 views

Surajit Roy - Numerical Methods

The Newton-Raphson method is an iterative method used to find isolated roots of an equation f(x)=0. It uses the tangent line of the function at the current point to estimate a new x-value that is closer to the root. The method starts with an initial guess x0 and iteratively calculates x1=x0-f(x0)/f'(x0) until converging on a solution within a specified tolerance. Geometrically, it finds where the tangent line crosses the x-axis, providing a better approximation with each iteration.

Uploaded by

surojitr420
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Surajit Roy - Numerical Methods

The Newton-Raphson method is an iterative method used to find isolated roots of an equation f(x)=0. It uses the tangent line of the function at the current point to estimate a new x-value that is closer to the root. The method starts with an initial guess x0 and iteratively calculates x1=x0-f(x0)/f'(x0) until converging on a solution within a specified tolerance. Geometrically, it finds where the tangent line crosses the x-axis, providing a better approximation with each iteration.

Uploaded by

surojitr420
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Newton-Raphson

Method
An iterative method to find isolated
solutions of an equation f(x)=0

Name – Surajit Roy


Dept. – CSE
Year – 3rd
Sem – 6th
Uni. Roll No – 23600121005
Subject – Numerical Methods(OEC-IT601A)
INTRODUCTION
Newton Raphson Method is an iterative method and is
used to find isolated roots of an equation f(x) = 0.
• The object of this method is to correct the approximate root
X0 (say) successively to its exact value a

• This formula is known as the iteration formula for Newton


Raphson Method.
• The formula generates a sequence of successive corrections
on an approximate root X0 to get the correct root a f(x) = 0,
the sequence is convergent. The number of iterations
required depends on the desired degree of accuracy of the2
solution.
GEOMETRICAL INTERPRETATION OF
N-R METHOD

In the left side, we have a graph of the curve y=f(x) w.r.t.


P0 [x0, f(x0)]
ox and oy as axes. Let the tangent at P0 meet the x-axis
at x1 and the tangent at P1 meet the x-axis at x2 , etc
• We know that equation of the tangent is .
P1 [x1, f(x1)]
y - y1 = ( dy / dx) (x - x1)

3
DETERMINATION OF THE FORMULA

Thus,
y-f(x0) =f`(x0) (x-x0) ………………..(ii)
As the tangent meet the x axis at (x1,0)
position so it will satisfy the equation (ii)
Thus,
P0 [x0, f(x0)] 0 – f( x0 ) = f `(x0) (x1 - x0)
f `( x0 ) ( x1 - x0 ) = - f( x0 )
P1 [x1, f(x1)] x1 - x0 = f(x0) / f `(x0)
∴ x1 = x0 – [ f(x0) / f `(x0) ]
now we can write for n no. of iteration the equation will be,

4
REMARKS

If en be a tolerable error, we should terminate the iteration when, | x n + 1 - xn | ≤ en

Newton-Raphson Method fails when f `(x0) = 0 or very small in the neighbourhood the root.

If the initial approximation is very close to the, then the convergence in N-R Method is faster than the
iteration method.

The initial approximation must be taken very close to the root, otherwise the iterations may diverge
Example
Find the root of x3 – 8x – 4 = 0, which between 3 and 4, by Newton-Raphson
Method, correct to four decimal places.
THANK YOU!

KEEP
CALM
AND DO SOME

MATHS
References.
[1] Numerical Analysis and Computational Procedures – Dr. S. A. Mollah

You might also like