0% found this document useful (0 votes)
26 views14 pages

Newton Raphson Method good

Uploaded by

leopard mpande
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
0% found this document useful (0 votes)
26 views14 pages

Newton Raphson Method good

Uploaded by

leopard mpande
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/ 14

Lok Nayak Jai Prakash Institute of Technology

Chapra, Bihar-841302
Newton-
Raphson
method...

Dr. G.K. Mathematics-II (Numerical Methods)


Prajapati
Lecture Notes
LNJPIT,
Chapra May 11, 2020
Newton-
Raphson
method:
by

Dr. G.K.Prajapati
Department of Applied Science and Humanities
LNJPIT, Chapra, Bihar-841302

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton- Newton-Raphson method:
Raphson
method...

Dr. G.K. Let a root of f (x) = 0 lie in the interval (a, b). Let x0 be an
Prajapati
initial approximation to the root in this interval. The
LNJPIT, Newton-Raphson method to find this root is defined by
Chapra
f (xk ) 0
xk+1 = xk − provided f (xk ) 6= 0
Newton-
Raphson f 0 (xk )
method:
This method is called the Newton-Raphson method or simply
the Newton’s method. The method is also called the
tangent method.

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton-
Raphson
method...

Dr. G.K.
Prajapati

LNJPIT,
Chapra

Newton-
Raphson
method:

Figure: Newton-Raphson
method

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton-
Raphson
method...
Example
Dr. G.K.
Prajapati Perform four iterations of the Newton’s method to find the
LNJPIT,
smallest positive root of the equation f (x) = x3 − 5x + 1 = 0.
Chapra

Solution: We have f (0) = 1, f (1) = −3. Since, f (0)f (1) < 0,


Newton-
Raphson the smallest positive root lies in the interval (0, 1). Applying
method:
the Newton’s method, we obtain
f (xk ) x3k − 5xk + 1
xk+1 = xk − = x k − =
f 0 (xk ) 3x2k − 5
2x3k − 1
, k = 0, 1, 2, ...
3x2k − 5

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton-
Raphson
Let x0 = 0.5. We have the following results.
method...

Dr. G.K.
2x30 − 1 2(0.5)3 − 1
x1 = = = 0.176471,
Prajapati
3x20 − 5 3(0.5)2 − 5
LNJPIT,
Chapra
2x31 − 1 2(0.176471)3 − 1
x2 = = = 0.201568,
Newton- 3x21 − 5 3(0.176471)2 − 5
Raphson
method:
2x32 − 1 2(0.201568)3 − 1
x3 = = = 0.201640,
3x22 − 5 3(0.201568)2 − 5

2x33 − 1 2(0.201640, )3 − 1
x4 = = = 0.201640.
3x23 − 5 3(0.201640, )2 − 5

Therefore, the root correct to six decimal places is


x ≡ 0.201640.
Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...
Newton-
Raphson
method...
Example
Dr. G.K.
Prajapati Using Newton-Raphson method solve x log10 x = 12.34 with
x0 = 10.
LNJPIT,
Chapra
Solution: Here f (x) = x log10 x − 12.34. Then
Newton- 1
Raphson f 0 (x) = log10 x + = log10 x + 0.434294. Applying the
method: loge 10
Newton’s method, we obtain
f (xk ) xk log10 xk − 12.34
xk+1 = xk − 0 = xk − =
f (xk ) log10 xk + 0.434294
(0.434294)xk + 12.34
, k = 0, 1, 2, ...
log10 xk + 0.434294

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton- Let x0 = 10. We have the following results.
Raphson
method... (0.434294)x0 + 12.34 (0.434294)(10) + 12.34
x1 = = =
Dr. G.K.
Prajapati
log10 x0 + 0.434294 log10 10 + 0.434294
11.631465.
LNJPIT, (0.434294)x1 + 12.34
Chapra x2 = =
log10 x1 + 0.434294
Newton-
Raphson
(0.434294)(11.631465) + 12.34
method:
= 11.594870.
log10 (11.631465) + 0.434294
(0.434294)x2 + 12.34
x3 = =
log10 x2 + 0.434294
(0.434294)(11.594870) + 12.34
= 11.594854.
log10 (11.594870) + 0.434294
We have |x3 − x2 | = |11.594854 − 11.594870| = 0.000016.
Therefore, We may take x ≡ 11.594854 as the root correct to
four decimal places.
Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...
Newton-
Raphson Example
method...

Dr. G.K.
Derive the Newton’s method for finding 1/N , where N > 0.
Prajapati Hence, find 1/17, using the initial approximation as
LNJPIT,
(i) 0.05, (ii) 0.15. Do the iterations converge
Chapra
1 1
Solution: Let x = =⇒ N = . Define a function
Newton- N x
Raphson
1 1
method:
f (x) = − N so that f 0 (x) = − 2 . Applying the Newton’s
x x
method, we obtain
1
−N
f (xk ) x
= xk −  k  = xk + xk − N x2k =
 
xk+1 = xk − 0
f (xk ) 1
− 2
xk
2xk − N x2k , k = 0, 1, 2, ...

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton-
Raphson
method...
(i) With N = 17, and x0 = 0.05, we obtain the sequence of
Dr. G.K.
Prajapati approximations
LNJPIT, x1 = 2x0 − N x20 = 2(0.05) − 17(0.05)2 = 0.0575.
Chapra

Newton- x2 = 2x1 − N x21 = 2(0.0575) − 17(0.0575)2 = 0.058794.


Raphson
method:

x3 = 2x2 − N x22 = 2(0.058794) − 17(0.058794)2 = 0.058823.

x4 = 2x3 − N x23 = 2(0.058823) − 17(0.058823)2 = 0.058823.

Since, |x4 − x3 | = 0, the iterations converge to the root. The


required root is 0.058823.

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton-
Raphson
(ii) With N = 17, and x0 = 0.15, we obtain the sequence of
method... approximations
Dr. G.K.
Prajapati
x1 = 2x0 − N x20 = 2(0.15) − 17(0.15)2 = −0.0825.
LNJPIT,
Chapra
x2 = 2x1 − N x21 = 2(−0.0825.) − 17(−0.0825.)2 = −0.280706.
Newton-
Raphson
method:
x3 = 2x2 − N x22 = 2(−0.280706) − 17(−0.280706)2 =
−1.900942.

x4 = 2x3 − N x23 = 2(−1.900942) − 17(−1.900942)2 =


−65.23275.

We find that xk → −∞ as k increases. Therefore, the


iterations diverge very fast. This shows the importance of
choosing a proper initial approximation.
Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...
Newton-
Raphson
method...
Example
Dr. G.K. Derive the Newton’s method for finding the q th root of a
Prajapati
positive number N , N 1/q , where N > 0, q > 0. Hence,
LNJPIT, compute 171/3 correct to four decimal places, assuming the
Chapra
initial approximation as x0 = 2.
Newton-
Raphson
method: Solution: Let x = N 1/q =⇒ N = xq . Define a function
f (x) = xq − N so that f 0 (x) = qxq−1 . Applying the Newton’s
method, we obtain
f (xk ) xqk − N
xk+1 = xk − 0 = xk − =
f (xk ) qxq−1
q
(q − 1)xk + N
, k = 0, 1, 2, ...
qxq−1

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton-
Raphson
method...

Dr. G.K.
Prajapati

LNJPIT,
Chapra
For computing 171/3 , we have q = 3 and N = 17. Hence, the
method becomes
Newton-
Raphson (3 − 1)x3k + 17 2x3k + 17
method: xk+1 = = , k = 0, 1, 2, ...
3x3−1
k
3x2k

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...


Newton- With x0 = 2, we obtain the following results.
Raphson
method...
2x30 + 17 2(2)3 + 17
Dr. G.K. x1 = = = 2.75,
Prajapati 3x20 3(2)2
LNJPIT,
Chapra 2x31 + 17 2(2.75)3 + 17
x2 = = = 2.582645,
3x21 3(2.75)2
Newton-
Raphson
method: 2x32 + 17 2(2.582645)3 + 17
x3 = = = 2.571332,
3x22 3(2.582645)2

2x33 + 17 2(2.571332)3 + 17
x4 = = = 2.571282.
3x23 3(2.571332)2

Since, |x4 − x3 | = |2.571282 − 2.571332| = 0.00005., We may


take x = 2.571282 as the required root correct to four decimal
places.
Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...
Newton-
Raphson
method...

Dr. G.K.
Prajapati

LNJPIT,
Chapra

Newton-
Raphson
Thanks !!!
method:

Dr. G.K. Prajapati LNJPIT, Chapra Newton-Raphson method...

You might also like