Newton-Raphson

Method

Prepard by: Engr. Marvin Villorente

 Newton-Raphson Method
f(x )

f ( x i)
x f x  f(xi )
i, i xi 1 = xi -
f (xi )

f ( x i-1 )

x i+ 2 x i+ 1 xi X

Figure 1 Geometrical illustration of the Newton-Raphson

2 method.
 Derivation
f(x)

AB
f(xi) B tan(  
AC

f ( xi )
f ' ( xi ) 
xi  xi 1
C  A X f ( xi )
xi+1 xi xi 1  xi 
f ( xi )

Figure 2 Derivation of the Newton-Raphson method.

3
 Algorithm for Newton-
Raphson Method

4
 Step 1

Evaluate f (x) symbolically.

5
 Step 2

xi
Use an initial guess of the root, , to estimate the
new value of thexi root,
1 , as
f xi 
xi 1 = xi -
f xi 

6
 Step 3

a
Find the absolute relative approximate error as

xi 1- xi
a =  100
xi 1

7
 Step 4
Compare the absolute relative approximate error
with the pre-specified relative error tolerance .
s

Go to Step 2 using
Yes
new estimate of the
Is a s ? root.

No Stop the algorithm

Also, check if the number of iterations has

exceeded the maximum number of iterations
allowed. If so, one needs to terminate the
algorithm and notify the user.

8
 Example 1
You are working for ‘DOWN THE TOILET COMPANY’
that makes floats for ABC commodes. The floating
ball has a specific gravity of 0.6 and has a radius of
5.5 cm. You are asked to find the depth to which
the ball is submerged when floating in water.

Figure 3 Floating ball

9 problem.
 Example 1 Cont.

The equation that gives the depth x in meters to

which the ball is submerged under water is
given by

f x   x 3-0.165 x 2+3.993 10- 4

Figure 3 Floating ball
problem.
Use the Newton’s method of finding roots of equations to find
a)the depth ‘x’ to which the ball is submerged under water.
Conduct three iterations to estimate the root of the above equation.
b)The absolute relative approximate error at the end of each
iteration, and
c)The number of significant digits at least correct at the end of each
iteration.
10
 Example 1 Cont.
Solution
To aid in the
understanding of how
this method works to find
the root of an equation,
the graph of f(x) is shown
to the right,
where
f x   x 3-0.165 x 2+3.993 10- 4
Figure 4 Graph of the function
f(x)
11
 Example 1 Cont.
Solve for f ' x 

f x   x 3-0.165 x 2+3.993 10 - 4

f ' x  3 x 2 -0.33 x
Let us assume the initial guess of the rootf of
x  0
0.05m
x0 is . This is a reasonable guess
x 0
(discuss x 0.11m
why
and are not good choices) as the
extreme values of the depth x would be 0 and
the diameter (0.11 m) of the ball.

12
 Example 1 Cont.
Iteration 1 f xi 
xi 1 = xi -
The estimate of the root is f xi 
f x0 
x1  x0 
f ' x0 

0.05 
0.053  0.1650.05  3.993 10  4
2

30.05  0.330.05
2

1.118 10  4
0.05 
 9 10  3
0.05   0.01242 
0.06242

13
 Example 1 Cont.

Figure 5 Estimate of the root for the first

14
iteration.
 Example 1 Cont.
a
The absolute relative approximate error at the end of
Iteration 1 is
x1  x0
a  100
x1
0.06242  0.05
 100
0.06242
19.90%
The number of significant digits at least correct is 0, as you
need an absolute relative approximate error of 0.05% or less
for at least one significant digits to be correct in your result.

15
 Example 1 Cont.
f xi 
xi 1 = xi -
f xi 
Iteration 2
The estimate of the root is
f x1 
x2  x1 
f ' x1 

0.06242 
0.062423  0.1650.062422  3.993 10 4
30.06242  0.330.06242
2

 3.9778110  7
0.06242 
 8.90973 10  3
0.06242  4.4646 10  5 
0.06238

16
 Example 1 Cont.

Figure 6 Estimate of the root for the

17
Iteration 2.
 Example 1 Cont.
a
The absolute relative approximate error at the end of
Iteration 2 is
x2  x1
a  100
x2
0.06238  0.06242
 100
0.06238
0.0716%

2 m
The maximum value of m for whicha 0.5 10 is
2.844. Hence, the number of significant digits at least
correct in the answer is 2.

18
 Example 1 Cont.
Iteration 3
The estimate of the root is
f x2 
x3  x2 
f ' x2 

0.06238 
0.062383  0.1650.062382  3.993 10  4
30.06238  0.330.06238
2

4.44 10  11
0.06238 
 8.91171 10  3

0.06238   4.9822 10  9 
0.06238

19
 Example 1 Cont.

Figure 7 Estimate of the root for the

20
Iteration 3.
 Example 1 Cont.
a
The absolute relative approximate error at the end of
Iteration 3 is
x2  x1
a  100
x2
0.06238  0.06238
 100
0.06238
0%

The number of significant digits at least correct is 4, as

only 4 significant digits are carried through all the
calculations.

Therefore, the root is 0.06238

21
 Advantages and
Drawbacks of Newton
Raphson Method

22
 Advantages
 Converges fast (quadratic
convergence), if it converges.
 Requires only one guess

23
 Drawbacks
1. Divergence at inflection points
Selection of the initial guess or an iteration value of the
x  function
root that is close to the inflection point off the
may start diverging away from the root in ther Newton-
Raphson method.
f x  x  1  0.512 0
3

For example, to find the root of the equation

. 
xi 1  xi  i
3 3

x  1  0.512
3xi  1
2

The Newton-Raphson method reduces to

.
x 1
Table 1 shows the iterated values of the root of the equation.
The root starts
x 0to.2diverge
. at Iteration 6 because the previous
estimate of 0.92589 is close to the inflection point
24
 Drawbacks – Inflection
Points
Table 1 Divergence near inflection
point.
Iteration xi
Number
0 5.0000
1 3.6560
2 2.7465
3 2.1084
4 1.6000
5 0.92589
6 −30.119
7 −19.746 Figure 8 Divergence at inflection
point for f x  x  13  0.512 0
18 0.2000
25
 Drawbacks – Division by
Zero
2. Division by zero
For the equation
f x   x 3  0.03x 2  2.4 10  6 0
the Newton-Raphson
method reduces to
xi3  0.03xi2  2.4 10  6
xi 1  xi 
3 xi2  0.06 xi

For x0 0 or x0 0.02 , the Figure 9 Pitfall of division by

denominator will equal zero or near a zero
zero. number

26
 Drawbacks – Oscillations near
local maximum and minimum
3. Oscillations near local maximum and minimum

Results obtained from the Newton-Raphson method

may oscillate about the local maximum or minimum
without converging on a root but converging on the
local maximum or minimum.
Eventually, it may lead to division by a number close to
zero and may diverge.
For example forf x  x  2 0
2
the equation has no
real roots.

27
 Drawbacks – Oscillations near
local maximum and minimum
Table 3 Oscillations near local 6
f(x)
maxima and mimima in Newton- 5
Raphson method.
Iteration
Number xi  
f xi a % 4

3
0 –1.0000 3.00 3

1 0.5 2.25 300.00 2 2

2 –1.75 5.063 128.571 11

3 –0.30357 2.092 476.47 4

x
4 3.1423 11.874 109.66 -2 -1
0
0 1 2 3
-1.75 -0.3040 0.5 3.142
5 1.2529 3.570 150.80 -1

6 –0.17166 2.029 829.88

Figure 10 Oscillations around
7 5.7395 34.942 102.99
local minimaf for
x  x 2  2
8 2.6955 9.266 112.93
.
9 0.97678 2.954 175.96

28
 Drawbacks – Root Jumping
4. Root Jumping
f x
In some cases where the function is oscillating and has a
number of roots, one may choose an initial guess close to a root.
However, the guesses may jump and converge to some other
1.5
root. f(x)
1


For
f xexample
sin x 0 0.5

x
0
-2 0 2 4 6 8 10

x0 2.4
Choose 7.539822 -0.06307
-0.5
0.5499 4.461 7.539822

x 0 -1

It will converge to -1.5

x 2 6.2831853 Figure 11 Root jumping from

instead of intended location of
root forf x  sin x 0
29 .
 Additional Resources
For all resources on this topic such as digital
audiovisual lectures, primers, textbook chapters,
multiple-choice tests, worksheets in MATLAB,
MATHEMATICA, MathCad and MAPLE, blogs,
related physical problems, please visit
THE END
 Exercise
1.Find the root using newton Raphson

of f(x)=x2+2x -2 ,x0=0
Stop iteration if error is less than
0.1%.

32
33 http://numericalmethods.eng.usf.edu
34 http://numericalmethods.eng.usf.edu
35 http://numericalmethods.eng.usf.edu
36 http://numericalmethods.eng.usf.edu
37 http://numericalmethods.eng.usf.edu
38 http://numericalmethods.eng.usf.edu
39 http://numericalmethods.eng.usf.edu