Professional Documents
Culture Documents
Null PDF
Null PDF
NON-LINEAR
EQUATIONS
Lecture 4: Newton Raphson method.
7. Newton Raphson Method
When the derivative of is of the simple form, the real root (non-
repeated) of the equation , can be computed rapidly by a process
known as the Newton Raphson method. Usually the problem is to find a
recurrence relation which enables us to find out a sequence converging
to the desired root .
Substituting this value of in we get a better approximation to
the root of as
……………….
This formula is known as the iteration formula for Newton Raphson Method.
Newton Raphson method: Geometrical significance
Then, from = =
Therefore,
3x cos x 1 0.
Solution: Let f ( x) 3x cos x 1. Since f (0) 2, f (0.5) 0.37, f (0.7) 0.34,
n xn f ( xn ) f '( xn ) f xn xn 1 xn hn
hn
f ' xn
0 0.5 -0.37 3.48 0.1063 0.6063
1 0.6063 -0.00286 3.56983 0.000801 0.607101
2 0.607101 -0.00000231 3.570489 0.00000064 0.60710164
3 0.60710106 -0.00000017 3.570489 0.00000003 0.60710163
Therefore, 6.0710 is the root of f(x) = 0, correct up to five decimal places.
Example 9: Find a real root of x x 4 0, by Newton-Raphson method, correct
x
Therefore, f(x) = 0 has a root between 1.6 and 1.7. Also, f '(1.6) = 4.12.
Taking x0 = 1.6, the successive iterations are computed in the following table:
n xn f ( xn ) f ' xn hn
f x xn 1 xn hn
f ' x
0 1.6 -0.27 4.12 0.066 1.666
1 1.666 0.0065 4.5352 -0.00143 1.66457
2 1.66457 0.0000318 4.525536 -0.000007 1.664563
3 1.664563 0.0000002 4.5254887 -0.000000004 1.664563
x 3n 10 2x 3n 10 1 10
x n 1 x n x n 1 2x n
3x 2n 3x 2n 3 x 2n
1 10 1 10
x1 2 x0 2 2 2.2 2.15537
3 x0 3 (2.2) 2
1 10
x2 2 2.15537 2.15444
3 (2.15537) 2
1 10
x3 2 2.15444 2.15443
3 (2.15444) 2
1 10
x4 2 2.15443 2.15443
2
3 (2.15443)
Therefore, 3 10 2.154 , correct to 4-significant figures.
Example 11: Find a real root of loge(x) = cos(x) by Newton Raphson method
correct to 6-significant figures.
1
Solution. Here f (x) loge (x) cos x and f '(x) sin x . Now f (1) 0.54 , f (2) 1.1 ,
x
therefore one root of f ( x) 0 lies between 1 and 2. Let x0 = 1.5 be the initial
approximation. Then f '(1.5) 1.6 . We then calculate the successive approximations
as follows:
n xn f ( xn ) f '(x n )
hn
f (x n ) xn1
f '(x n )
0 1.5 0.33472791 1.6641617 - 0.2011391 1.2988609
1 1.2988609 - 0.0071085944 1.7331582 0.0041014 1.3029624
2 1.30229624 - 2.773.350 × 10-6 1.7318283 0.0000021 1.3029640
3 1.3029640 - 2.1 × 10-9 1.7318277 0.0000000 1.3029640