Chapter 2: Solution of Non Linear Equations

Introduction
In this chapter we shall discuss some numerical methods for solving algebraic and transcendental
equations. The equation ( ) = 0 is said to be algebraic if ( ) is purely a polynomial in . If
( ) contains some other functions, namely, Trigonometric, Logarithmic, Exponential, etc., then
the equation ( ) = 0 is called a Transcendental Equation.
One of the most common problem encountered in engineering analysis is that given a function
( ), find the values of for which ( ) = 0. The solution (values of ) are known as the roots
of the equation ( ) = 0, or the zeroes of the function ( ).
Theorem: If a function ( ) assumes values of opposite sign at the end points of interval
( , ), i.e., ( ) ( ) < 0 then the interval will contain at least one root of the equation ( ) = 0, in
other words, there will be at least one number ∈ ( , ) such that ( ) = 0.
There are two types of methods available to find the roots of algebraic and transcendental equations of the
form ( ) = 0.
1. Direct Methods: These methods give the exact value of the roots (in the absence of round off errors)
in a finite number of steps and determine all the roots at the same time.
2. Iterative methods: These methods, also known as trial and error methods, are based on the
idea of successive approximations, i.e., starting with one or more initial approximations to
the value of the root, we obtain the sequence of approximations by repeating a fixed
sequence of steps over and over again till we get the solution with reasonable accuracy.
These methods generally give only one root at a time.
The indirect or iterative methods are further divided into two categories: bracketing and open methods.
The bracketing methods require the limits between which the root lies, whereas the open methods require
the initial estimation of the solution. Bisection and False position methods are two known examples of the
bracketing methods. Among the open methods, the Newton-Raphson and the method of successive
approximation are most commonly used. The most popular method for solving a non-linear equation is
the Newton-Raphson method and this method has a high rate of convergence to a solution.
Rate of Convergence
Definition: An iterate method is said to be of order or has the rate of convergence , if is the largest
positive number for which there exists a finite constant ≠ 0 such that | |≤ | |
where = − ξ is the error in the iterate.
Criterion to terminate iteration procedure: Since, we cannot perform infinite number of
iterations; we need a criterion to stop the iterations. We can select a tolerance e>0 and
generate , , , … , , until one of the following conditions is met:
1. The equation ( ) = 0 is satisfied to a given accuracy or ( ) is bounded by an error
tolerance e . ( ) ≤ e.
2. The magnitude of the difference between two successive iterates is smaller than a given
accuracy or an error bound e . | − | ≤ e.
| +1 − |
3. Relative error = ≤ e.
| |
Generally, we use the second criterion.

1
In chapter, we present the following indirect or iterative methods with illustrative examples:
1. Bisection Method 4. Iteration Method and
2. Regular Falsi Method 5. Newton-Raphson Method
3. Secant Method (Newton’s method)
A. Bisection Method (Interval halving method)
This is one of the simplest iterative methods and is strongly based on the property of intervals.
To find a root using this method, let the function ( ) be continuous between and and ( )
( ) < 0. Then there is a root of ( ) = 0, lying between and . Let the first approximation
be = ( + ) (i.e., average of the ends of the range).
Now, if ( ) = 0 then is a root of ( ) = 0. Otherwise, the root will lie between and
or and depending upon whether ( ) ( ) < 0 or ( ) ( ) < 0 respectively.

Then, we bisect the interval and continue the process till the root is found to be desired accuracy.
In the above figure, ( ) ( ) < 0; therefore, the root lies in between and . The second
approximation to the root now is = ( + ). If ( ) is negative as shown in the figure
then the root lies in between and , and the third approximation to the root is
= ( + ) and so on. This method is simple but slowly convergent. It is also called as
Bolzano method.
Procedure for the Bisection Method to Find the Root of the Equation ( ) = 0
Step 1: Choose two initial guess values (approximation) and such that ( ) ( ) < 0.
Step 2: Evaluate the mid point of and given by = ( + ) and also evaluate ( ).
Step 3: If ( ) ( ) < 0, then set = else set = . Then apply the formula of step 2.
Step 4: Stop evaluation when the difference of two successive values of obtained from
step 2, is numerically less than the prescribed accuracy.

2
Order of Convergence of Bisection Method
As the error decreases with each step by a factor of (i.e. = ), then the convergence in the
bisection method is linear.
Example 1: Find the root of equation − − 1 = 0 for the root lying between 1 and 2, correct
to two decimal places by bisection method.
Solution: Let ( ) = − −1=0
Since (1) = 1 − 1 − 1 = −1 ≤ 0 and
(2) = 2 − 2 − 1 = 5 ≥ 0
Therefore, (1) is negative and (2) is positive, so at least one real root will lie between 1 and 2.
Iteration: Now using Bisection Method, we can take first approximation
= = = 1.5 ⟹ ( ) = (1.5) = 0.875 ≥ 0 ( ) ( )>0
So the root will be between 1 and 1.5
Iteration: The second approximation is given by
.
= = = 1.25 ⟹ ( ) = (1.25) = −0.297 < 0
Therefore, (1.5) is positive and (1.25) is negative, so that root will lie between 1.25 and 1.5
Iteration: The third approximation is given by
. .
= = = 1.375 ⟹ ( ) = (1.375) = 0.22460 > 0 ,
Therefore the required root lies between 1.25 and 1.375
Iteration: The fourth approximation is given by
+ 1.375 + 1.25
= = = 1.313 ⟹ ( ) = (1.313) = −0.0494 < 0
2 2
Therefore, (1.313) is negative and (1.375) is positive. Thus root lies between 1.313 and 1.375
Iteration: The fifth approximation is given by
+ 1.313 + 1.375
= = = 1.344 ⟹ ( ) = (1.344) = 0.0837 > 0
2 2
(1.313) is negative and (1.344) is positive, so root lies between 1.313 and 1.344
Iteration: The sixth approximation is given by
. .
= = = 1.3285 and (1.3285) = 0.016186 > 0
Iteration: The seventh approximation is given by
. .
= = = 1.3208
From above iterations, the root of ( ) = − − 1 = 0 up to two places of decimals is
1.3208, which is of desired accuracy.

Example 2:- Solve the equation − 5 + 3 = 0 using the Bisection method in the interval
[0,1] with error = 0.001.
Solution: Here ( ) = − 5 + 3, = 0 and = 1
is continuous in the given interval [0,1] and (0) = 3 > 0, (1) = −1 < 0. Hence, there is a
root of the equation in the given interval.
3
 = = = 0.5 and (0.5) = 0.625 > 0

Then, the root lies in the interval [0.5,1] and = |0.5 − 1| = 0.5 > 0.001
.
= = 0.75 and (0.75) = −0.328125 < 0

Then, the root lies in the interval [0.5,0.75] and = |0.5 − 0.75| = 0.25 > 0.001
. .
= = 0.625 and (0.625) = 0.11914 > 0

Then, the root lies in the interval [0.625,0.75] and = |0.625 − 0.75| = 0.125 > 0.001
. .
= = 0.6875 and (0.6875) = −0.112548 < 0

Then, the root is in the interval [0.625,0.6875] & = |0.625 − 0.6875| = 0.0.0625 > 0.001
. .
= = 0.65625 and (0.65625) = 0.001373 > 0

Then, the root lies in the interval [0.65625,0.6875] and

= |0.65625 − 0.6875| = 0.03125 > 0.001
. .
= = 0.671875 and (0.671875) = −0.05607986 < 0

Then, the root lies in the interval [0.65625,0.671875] and

= |0.65625 − 0.671875| = 0.015625 > 0.001
. .
= = 0.6640625 and (0.6640625) = −0.02747488 < 0

Then, the root lies in the interval [0.65625,0.6640625] and

= |0.65625 − 0.6640625| = 0.0078125 > 0.001
. .
= = 0.66015625 and (0.66015625) = −0.01308 < 0

Then, the root lies in the interval [0.65625,0.66015625] and

= |0.65625 − 0.66015625| = 0.00390625 > 0.001
. .
= = 0.658203125 and (0.658203125 ) = −0.00586 < 0

Then, the root lies in the interval [0.65625,0.658203125] and

= |0.65625 − 0.658203125| = 0.001953125 > 0.001
. .
= = 0.657226562 and (0.657226562 ) = −0.002246 < 0

Then, the root lies in the interval [0.65625,0.657226562] and

= |0.65625 − 0.657226562| = 0.000976562 < 0.001
Since|0.65625 − 0.657226562| = 0.000976562 < 0.001 = , the process terminates and the
approximate root of the equation is = 0.657226562 .
4
Example 3:- Approximate √2 using bisection method correct to two decimal places.

Solution: let = √2 ⟺ −2=0⟹ ( )= −2

Now (1) = −1 ≤ 0 (2) = 1 ≥ 0

Thus, by intermediate value theorem there exist at least one root in [1,2].

Now, = = = 1.5 ⟹ ( ) = (1.5) = 0.25 ≥ 0 ( ) ( )≤0

.
= = = 1.25 ⟹ ( ) = (1.25) = −0.4375 ≤ 0 ( ) ( )≤0

. .
= = = 1.375 ⟹ ( ) = (1.375) = −0.109375 ≤ 0 ,

and ( ) ( ) ≤ 0, implies

+ 1.375 + 1.5
= = = 1.4375 ⟹ ( ) = (1.4375) = 0.0664 ≥ 0
2 2
Similarly = 1.406, = 1.414, = 1.418

Hence, √2 approximated to 1.418 in 3 decimal places

Example 4:- Use the Bisection method to find a root of the equation – 4 – 8.95 = 0 accurate to three
decimal places.
Solution: Here ( )= – 4 – 8.95 = 0
(2) = 2 – 4(2)– 8.95 = −8.95 ≤ 0
(3) = 3 – 4(3) – 8.95 = 6.05 ≥ 0
Hence, a root lies between 2 and 3. Hence, we have = 2 and = 3. The results of the algorithm
for Bisection method are shown in Table.

n a b X1 b – x1 f(x1 )
1 2 3 2.5 0.5 –3.25
2 2.5 3 2.75 0.25 0.84688
3 2.5 2.75 2.625 0.125 –1.36211
4 2.625 2.75 2.6875 –0.0625 –0.28911
5 2.6875 2.75 2.71875 –0.03125 0.27092
6 2.6875 2.71875 2.70313 0.01563 –0.01108
7 2.70313 2.71875 2.71094 –0.00781 0.12942
8 2.70313 2.71094 2.70704 –0.0039 0.05921
9 2.70313 2.70704 2.70508 0.00195 0.02410
10 2.70313 2.70508 2.70410 0.00098 0.00640
11 2.70313 2.70410 2.7036 0.00048 -0.00256
Hence the root is 2.704 accurate to three decimal places

5
Exercises 1: Using the bisection method solves the following equations.
1. Approximate √2 , correct to three decimal places.
2. − 9 + 1 = 0 for the root lying between 2 and 3, correct to three significant figures.
3. Perform five iterations to obtain the smallest positive root of ( ) = − 5 + 1 = 0.
4. 3 − = 0 for 1 ≤ ≤ 2, accurate to within 10 .

Exercises 2: Use the bisection method find the drag coefficient needed for a parachutist of
mass = 68.1 kg to have a velocity of = 40 / after free-falling for time = 10 . Note:
( ⁄ )
The acceleration due to gravity is = 9.8 / and ( ) = 1− − .

B. False position method (Regula-falsi method)

This method is essentially same as the bisection method except that instead of bisecting the interval.
Here we choose two points and such that ( )and ( ) have opposite signs. Intermediate
value property suggests that the graph of the = ( ) crosses the x-axis between these two
points and therefore, a root lies between these two points.
Thus to find the real root of ( ) = 0 using Regula-Falsi method, we replace the part of the
curve between the points ( , ( )) and ( , ( )) by a chord in the interval and we take the
point of intersection of this chord with x-axis as initial (or first) approximation.
Now, the equation of the chord joining the points is,
( ) ( )
− ( )= ( − )

Setting = 0 in the above equation, we get the first approximation to the root is given by
( ) ( )
= (x1,f(x1)
( ) ( )

In general, the ( + 1) approximation to the root is given by x0 x2 x3

( )− ( )
=
( )− ( )
(x0, f(x0))

Note: - This algorithm cannot be implemented to find a tangential root. That is a root that is
tangent to the x-axis and either positive or negative on both side of the root. For example ( ) =
( − 3)2, has a tangential root at = 3.
Procedure for the False Position Method to Find the Root of the Equation ( ) = 0
Step1: choose two initial guess values (approximations) and where > such that
( ) ( ) < 0.
Step 2: find the next approximation using the formula
( ) ( )
= ( )
and also evaluate ( ).
( )

6
Step 3: If ( ) ( ) < 0, then go to the next step. If not, rename as and then go to the
next step.
Step 4: Evaluate successive approximations using the formula
( ) ( )
= ( ) ( )
where = 2, 3, 4, …
But before applying the formula for , ensure whether ( ) ( ) < 0; if not, rename
as and proceed.
Step 5: stop the evaluation when | − | < , where is the prescribed accuracy.
Note: The order (or rate) of convergence of false position method is 1.618.
Example: Find a real root of the equation ( ) = − 2 − 5 = 0 by the method of false
position up to three places of decimal.
Solution: Given that ( ) = −2 −5=0
So that (2) = 2 − 2(2) − 5 = −1 and (3) = 3 − 2(3) − 5 = 16.
Therefore, a root lies between 2 and 3.
First approximation: therefore taking = 2, = 3, ( ) = −1, ( ) = 16, then by regula-
falsi method, we get = − ( )
( ) ( )

=2− (−1) = 2 + = 2.0588

Now ( ) = (2.0588) = (2.0588) − 2(2.0588) − 5 = −03911.
Therefore, the root lies between 2.0588 and 3.
Second Approximation: Now, taking = 2.0588, = 3 ( ) = −0.3911, ( ) = 16,
then by Regula-Falsi method, we get = − ( ) ( ) ( )
.
= 2.0588 − (−0.3911) = 2.0813
.
Now ( ) = (2.0813) = (2.0813) − 2(2.0813) − 5 = −0.1468
Therefore, the root lies between 2.0813 and 3.
Third Approximation: Now, taking = 2.0813, = 3 ( ) = −0.1468, ( ) = 16, then
by Regula-Falsi method, we get = − ( )
( ) ( )
.
= 2.0813 − (−0.1468) = 2.0897
.
Now ( ) = (2.0897) = (2.0897) − 2(2.0897) − 5 = −0.054
Therefore, the root lies between 2.0897 and 3.
Fourth Approximation: Now, taking = 2.0897, = 3 ( ) = −0.054, ( ) = 16, then
by Regula-Falsi method, we get = − ( )
( ) ( )
.
= 2.0897 − (−0.054) = 2.0928
.
Now ( ) = (2.0928) = (2.0928) − 2(2.0928) − 5 = −0.0195
Therefore, the root lies between 2.0928 and 3.

Fifth Approximation: Now, taking = 2.0928, = 3 ( ) = −0.0195, ( ) = 16, then

by Regula-Falsi method, we get = − ( ) ( )
( )

7
 .
= 2.0928 − (−0.0195) = 2.0939
.
Now ( ) = (2.0939) = (2.0939) − 2(2.0939) − 5 = −0.0074
Therefore, the root lies between 2.0939 and 3.
Sixth Approximation: Now, taking = 2.0939, = 3 ( ) = −0.0074, ( ) = 16, then
by Regula-Falsi method, we get = − ( )
( ) ( )
.
= 2.0939 − (−0.0074) = 2.0943
.
Now ( ) = (2.0943) = (2.0943) − 2(2.0943) − 5 = −0.0028
Therefore, the root lies between 2.0943 and 3
Seventh Approximation: Now, taking = 2.0943, = 3 ( ) = −0.0028, ( ) = 16,
then by Regula-Falsi method, we get = − ( ) ( ) ( )
.
= 2.0943 − (−0.0028) = 2.0945
.
Hence, the root and are corrected to 3 decimal places.
Therefore, the root is 2.094 correct to 3 decimal places.
Exercise 1: Using False position method, find a root of the function
1. ( )= − 3 to an accuracy of four decimal places in [0.5, 1]
2. ( )= − 3 + 5 correct to four decimal places.
3. ( )= − log − 12 correct to three decimal places.
Exercise 2: The velocity of a falling parachutist is given by
( ⁄ )
= 1− where = 9.8 / . For a parachutist with a drag coefficient = 15
/ , compute the mass so that the velocity is = 35 at = 9 . Use the false-position method to
determine m to a level of accuracy 0.1%.
C. Secant Method
The Secant method is similar to the Regula-Falsi method, except for the fact that we drop the
condition that ( ) should have opposite signs at the two points used to generate the next
approximation. Instead, we always retain the last two points to generate the next. Thus, if
and are two approximations to the root, then the next approximation to root is given
by = − ( ) ( ( ), = 1, 2, 3, …
)
Geometrically, in Secant method we replace the function ( ) by a straight line passing through
the points ( , ( ) and ( , ( ) and take the point of intersection of the straight line
with the x-axis as the next approximation to the root. In contrast to the Regula-Falsi method, the
Secant iteration does not bracket the root and it is not even necessary to bracket the root to start
the iteration. Hence, it is obvious that the iteration may not always coverage on the other hand, it
generally converges faster. Thus, by dropping the necessity of bracketing the root, we improve
the rate of convergence, however, in some cases; the iteration may not converge at all.

Procedure for Secant Method to Find the Root of ( ) = .

Step 1: Choose the interval [ , ] in which ( ) = 0 has a root, where >

8
Step 2: Find the next approximation of the required root using the formula
−
= − ( )
( )− ( )
Step 3: Find the successive approximations of the required root using the formula
−
= − ( ), = 1, 2, 3, …
( )− ( )
Step 4: Stop the process when the prescribed accuracy is obtained.
Note: The rate of convergence for the Secant method as p = 1.618 is superliner .
2 2 = 1 in the interval [0, 2] using Secant method.
Example: Compute root of the equation
The root should be correct to three decimal places.
Solution: we have, = 1.42, = 1.43, ( ) = – 0.0086, ( ) = 0.00034
By secant method,
Approximation: First approximation is given by
−
= − ( )
( )− ( )
1.43 − 1.42
= 1.43 − (0.00034) = 1.4296 ( ) = −0.000011
0.00034 − 0.0086
Approximation: second approximation is given by
−
= − ( )
( )− ( )
1.4296 − 1.43
= 1.4296 − (−0.000011) = 1.4292
−0.000011 − 0.00034
Since and agree up to three decimal places hence the required root is 1.429
D. Iteration Method (Method of Successive Approximation)
This method is also known as the direct substitution method or method of fixed iterations. To
find the root of the equation ( ) = 0 by successive approximations, we rewrite the given
equation in the form = ( ).
Now, first we assume the approximate value of root (let 0 ), then substitute it in ( ) to have a
first approximation 1 given by
1 = ( 0)
Similarly, the second approximation 2 is given by
2 = ( 1)
In general, 1 = ( )
Procedure for Iteration Method to Find the Root of the Equation ( ) = 0
Step 1: Take an initial approximation as 0 .
Step 2: Find the next (first) approximation 1 by using 1 = ( 0 ).
Step 3: Follow the above procedure to find the successive approximations 1 by using
1 = ( ), = 1, 2, 3, …
Step 4: Stop the evaluation where relative error ≤ , where is the prescribed accuracy.
Note 1: The iteration method = ( ) is convergent if ′ ( ) < 1.

9
Note 2: When ′ ( ) > 1 ⟹ ′ ( ) > 1 or ′ ( ) < −1, the iterative process is divergent.
Note 3: The rate of convergence of iteration method is 1. In other words, iteration method
converges linearly.
Example: Find a real root correct up to four decimal places of the equation 2 – ln – 7 = 0
using iteration method.
Solution: Here, we have f(x) = 2x − lnx − 7 = 0
Now, we find that (3) = −1.447 < 0 and (4) = 0.398 > 0
Therefore, at least one real root of ( ) = 0 lies between 3 and 4.
Now, the given equation can be rewritten as
x = (lnx + 7) = g(x), say.
Now, ( )= , from which we clearly note that | ( )| < 1 for all ∈ (3, 4).
Again since | (4)| < | (3)| , the root is near to = 4.
Let the initial approximation be = 3.6 because (3.6) tends to zero. Then from the iterative
formula = ( ), we obtain
1 1
x = g(x ) = (lnx + 7) = (ln3.6 + 7) = 3.77815
2 2
x = g(3.77815) = 3.78863
x = g(3.78863) = 3.78924
x = g(3.78924) = 3.78927
Hence, the root of the equation correct to the four places of decimals is 3.7893.

Example 2: Find the real root of equation ( ) = + – 1 = 0 by using iteration method.

Solution: Here, (0) =– 1 and (1) = 1 so a root lies between 0 and 1. Now, = so that,
√
1
( )=
√1 +
( )=− ⟹ | ( )| < 1 for <1
( )
Hence iterative method can be applied.
Take, x = 0.5 we get x = g(x ) = = = 0.81649
√ .
1 1
x = g(x ) = = = 0.74196
1+ x √1.81649
1 1
x = g(x ) = = = 0.75767
1+ x √1.74196
⋮
1
x = g(x ) = = 0.75487
1+ x
Exercise: Find the cube root of 15 correct to four significant figures by iterative method.
E. Newton-Raphson Method (Newton’s method)

10
The Newton-Raphson method is the best-known method of finding roots of a function ( ). The
method is simple and fast. One drawback of this method is that it uses the derivative ′( ) of the
function as well as the function f (x) itself.
This method can be derived from Taylor’s series as follows:
Let ( ) = 0 be the equation for which we are assuming 0 be the initial approximation and
ℎ be a small corrections to 0 , so that ( 0 + ℎ) = 0.
Expanding it by Taylor’s series, we get
2
( )= ( 0 + ℎ) = ( 0 ) + ℎ ′ ( 0 ) + 2!
′′ (
0) + ⋯ = 0.
Since ℎ is small, we can neglect second and higher degree terms in ℎ and therefore, we get
( 0) + ℎ ′( 0) = 0
( 0) ′(
From which we have, ℎ = − ′(
where 0) ≠0
0)
Hence, if 0 be the initial approximation, then next (or first) approximation 1 is given by
( 0)
1 = 0 +ℎ = 0 − ′( )
0
( )
The next and second approximation 2 is given by 2 = 1 − ′( )
( )
In general, 1 = − ′( )

This formula is well known as Newton-Raphson formula or Newton’s method.

Algorithm for Newton-Raphson Method to Find the Root of the Equation ( ) = 0

Step 1: Take a trial solution (initial approximation) as 0 . Find ( 0 ) and ′ ( 0 )
Step 2: Follow the above procedure to find the successive approximations 1 using the

11
 ( )
formula 1 = − ′( )
, where = 0, 1, 2, 3, …
Step 3: Stop the process when | 1 − | ≤ , where is the prescribed accuracy.

Order (or Rate) of Convergence of Newton-Raphson Method

Hence by definition, the order of convergence of Newton-Raphson method is 2 i.e., Newton

Raphson method is quadratic convergent. This also shows that subsequent error at each step is
proportional to the square of the previous error and as such the convergence is quadratic.
Example 1: Find the real root of the equation log – cos = 0 correct to three places of
decimal by Newton-Raphson’s method.
Solution: Let log – cos = 0

12
So that (1) = −0.5403 and (2) = 1.1092.
∴ The root lies between 1 and 2.
Also, (1.1) = 1.1 − 1.1 = 0.0953 − 0.4535 = −0.3582
(1.2) = 1.2 − 1.2 = −0.18
(1.3) = 1.3 − 1.3 = −0.0051
(1.4) = 1.4 − 1.4 = 0.1665
Thus the root lies between 1.3 and 1.4 .
Since ( ) = − and ( )= +
Then by Newton’s-Rapton method, we get
( ) −
= − = −
( ) 1
+
+ − +
= , = 0, 1, 2, …
1+
Let us take the initial data = 1.3
First approximation: By taking = 0, we get the first approximation
+ − +
=
1+
1.3 + (1.3) 1.3 − 1.3 1.3 + 1.3 1.3
= = 1.3029
1 + 1.3 1.3
Second approximation: By taking = 1, we get the second approximation
+ − +
=
1+
1.3029 + (1.3029) 1.3029 − 1.3029 1.3029 + 1.3029 1.3029
=
1 + 1.3029 1.3029
2.9401
= = 1.303
2.2564
Hence the required root is 1.303 correct to three decimal places.
Example 2: Find the real root of the equation – 5 + 2 = 0 between 4 and 5 by Newton-
Raphson’s method.
Solution: Let ( ) = – 5 + 2 = 0
Now, (4) = −2 and (4) = 2
Therefore, the root lies between 4 and 5.
Now, Newton-Raphson’s method becomes
( )
Since, ( ) = 2 − 5, then = −
( )
–5 + 2 –2
= − = , = 0, 1, 2, …
2 −5 2 −5
Let take = 4 the initial approximation, then
First approximation: By taking = 0, we get the first approximation

13
 –2 4 –2
= = = 4.6667
2 − 5 2(4) − 5
Second approximation: By taking = 1, we get the second approximation
–2 4.6667 – 2
= = = 4.5641
2 − 5 2(4.66667) − 5
Third approximation: By taking = 2, we get the second approximation
–2 4.5641 – 2
= = = 4.5616
2 − 5 2(4.5641) − 5
Fourth approximation: By taking = 3, we get the second approximation
–2 4.5616 – 2
= = = 4.5616
2 − 5 2(4.5616) − 5
Since = , hence the root of the equation is 4.5616 correct to four decimal places.

Exercise 1: Evaluate √12 to four decimal places by Newton’s iterative method.

Exercise 2: Find by Newton’s method, the real root of the equation
4
a. − 11 + 8 = 0, correct to five decimal places and the root near 2.
b. log10 = 1.2, correct to five decimal places.
c. = , correct to four decimal places.

14