Newton-Raphson Method

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 method.

2
 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

Use an initial guess of the root, xi , to estimate the new

value of the root, xi 1 , as
f  xi 
xi 1 = xi -
f  xi 

6
 Step 3

Find the absolute relative approximate error a 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 new
Yes
estimate of the root.
Is a s ?

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
 Convergence
f ( x)
Comparing x n 1  xn  '
with x n 1   ( xn ) of the iteration method,
f ( x)
f ( xn )
 ( xn )  xn 1  xn 
f '( xn )
f ( x)
In general  ( x)  x 
f '( x )
f ( x ) f "( x )
 '( x ) 
 f '( x)
2

Since iteration method converges if  '( x) 1

 Newton's method converges if f ( x) f "( x)   f '( x) 
2

in the interval considered.

The rate at which the iteration method converges if
the initial approximation to the root is sufficiently close to
the desired root is called the rate of convergence.
 Example 1

Q1. Using Newton-Raphson method find the

real root of the equation 3x=cosx + 1
correct to four decimal places.

11
 Solution
f ( x)  3 x  cos x  1
f (0)  2()ve
f (1)  1.4597()ve
 A root of f(x)=0 lies between 0 and 1.
 Cont…
 Also f’(x)=3+sin x

New Iteration formula gives,

f ( xn )
xn 1  xn 
f '( xn )
3xn  cos x  1
 xn  ...............(1)
3  sin xn
 Cont…
 Put n=0 the first approximation is given by

x0 sin x0  cos x0  1
x1 
3  sin x0
0.6sin 0.6  cos 0.6  1

3  sin 0.6
 0.6071
 Cont..
Put n=1,
Then second approximation is
x1 sin x1  cos x1  1
x2 
3  sin x1
.6071sin(.6071)  cos(.6071)  1

3  sin(.6071)
 0.6071
 Cont..
Clearly X1 = X2 .
Hence desired root is 0.6071 correct to 4
decimal places.
 Example 2
Q 2: Find to four places of decimal, the
smallest root of the equation
x
e  sin x
 Solution
The given equation is
f ( x)  e  x  sin x  0
So that,
 xn
e  sin xn
xn 1  xn   xn
e  cos xn
Take x0 = 0.6, then

x1  0.58848
x2  0.588559
 Cont..
Hence desired value of the root is a 0.5885

19 http://numericalmethods.eng.usf.edu
 Example 3
Evaluate 12 to four decimal places by Newton's iteration method.
Sol. Let x  12 so that x 2  12  0 .........(1)
Take f ( x )  x 2 12, Newton ' s iteration formula gives ,
f ( xn ) xn2  12 1  12 
xn 1  xn   xn    xn   ........(2)
f '( xn ) 2 xn 2 xn 
Now since f (3)   3 and f (4)  4
The root of (1) lies between 3 and 4.
take x0  3.5, from eqn.(2),
1 12  1  12 
x1   x0     3.5    3.4643
2 x0  2  3.5 

20
 1 12  1 12 
x2   x1     3.4643    3.4641
2 x1  2 3.4643 
1 12 
x3   x2    3.4641
2 x2 
Since, x2  x3 upto 4 decimal places.
So , 12  3.4641.

21
 Newton Iterative formula
The reciprocal or inverse of s number ‘a’ can be
considered as a root of the equation
which can be1solve
a 0
x
by Newton’s method.

1 1
f ( x)   a, f '( x )   2
x x
 Cont…
 Newton’s Formula gives,

1 
  a
 xn 
xn 1  xn 
 1 
 2 
x n 

xn 1  xn (2  axn )
 Square Root
 The square root of ‘a’ can be considered
as a root of equation x 2  a  0 solved
by Newton’s method.

f ( x )  x  a, f ( x )  2 x
2

xn2  a
xn 1  xn 
2 xn
1 a 
xn 1   xn  
2 xn 
 Inverse Square Root
 Equation is 1
a 0
2
x

Iterative Formula is

1
xn 1  xn (3  axn )
2

2
General Formula for pth root

( p  1) x  a
p
xn 1  n
p 1
px
n
 Newton’s Iterative Formulae
Inverse: Inverse Square Root:
1
xn 1  xn (2  axn ) xn1  xn  3  axn2 
2

Square Root: For pth root :

1 a
xn 1   xn   ( p  1) x  a
p
2 xn  xn 1  n
p 1
px n
27
 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.165x 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.

28
 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.165x 2+3.993 10- 4
Figure 4 Graph of the function f(x)

29
 Example 1 Cont.
Solve for f '  x 

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

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

30
 Example 1 Cont.
Iteration 1
The estimate of the root is

f  x0 
x1  x0 
f '  x0 

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

3 0.05  0.33 0.05

2

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

31
 Example 1 Cont.

Figure 5 Estimate of the root for the first iteration.

32
 Example 1 Cont.
The absolute relative approximate error a 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 5% or less for at least one
significant digits to be correct in your result.

33
 Example 1 Cont.
Iteration 2
The estimate of the root is
f  x1 
x2  x1 
f '  x1 

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

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

34
 Example 1 Cont.

Figure 6 Estimate of the root for the Iteration 2.

35
 Example 1 Cont.
The absolute relative approximate error a 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.

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

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

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

37
 Example 1 Cont.

Figure 7 Estimate of the root for the Iteration 3.

38
 Example 1 Cont.
The absolute relative approximate error a 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.

39
 Advantages and Drawbacks
of Newton Raphson Method

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

41
 Drawbacks
1. Divergence at inflection points
Selection of the initial guess or an iteration value of the root that is
close to the inflection point of the function f  xmay
 start
diverging away from the root in their Newton-Raphson method.

For example, to find the root of the equation f  x    x  1  0.512  0.

3

The Newton-Raphson method reduces to xi 1  xi 

x3
i  3
 1  0.512
.
3 xi  1
2

Table 1 shows the iterated values of the root of the equation.

The root starts to diverge at Iteration 6 because the previous estimate
of 0.92589 is close to the inflection point of x  1.
Eventually after 12 more iterations the root converges to the exact
value of x  0.2.
42
 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  0.512  0
3
18 0.2000
43
 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.03 xi2  2.4 10 6
xi 1  xi 
3xi2  0.06 xi

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

denominator will equal zero. or near a zero number

44
 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 for f  x   x  2  0 the equation has no real
2

roots.

45
 Drawbacks – Oscillations near local
maximum and minimum
Table 3 Oscillations near local maxima and 6
f(x)
mimima in Newton-Raphson method. 5

f  xi  a %
Iteration
Number xi 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 local
7 5.7395 34.942 102.99
minima for f  x   x  2 .
2
8 2.6955 9.266 112.93
9 0.97678 2.954 175.96
46
 Drawbacks – Root Jumping
4. Root Jumping
 
In some cases where the function f x 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 root.
1.5
f(x)

For example 1

f  x   sin x  0 0.5

x
Choose 0

x0  2.4  7.539822
-2 0 2 4 6 8 10
-0.06307 0.5499 4.461 7.539822
-0.5

It will converge to x0 -1

-1.5

instead of x  2  6.2831853 Figure 11 Root jumping from intended

location of root for
f  x   sin
. x0
47
THE END