Page |6

THE SOLUTION OF ALGEBRAIC & TRANSCENDENTAL EQUATIONS

CH 01
In this Lesson, we have discussed about the solution of equations f ( x ) = 0 where f ( x ) linear, non-linear,
algebraic or transcendental function. We get the solution of the equation f ( x) = 0 by using Bisection method,
Newton- Raphson method and method of false position. Those methods are established based on Intermediate
Value Theorem.

After reading this chapter, you should be able to:

1. derive the Bisection, Newton-Rapshon & Iteration Method,

2. develop the algorithm of the Bisection, Newton-Rapshon & Iteration Method,
3. use the the Bisection, Newton-Rapshon & Iteration Method to solve a nonlinear equation, and
4. discuss the drawbacks and Advantages of the the Bisection, Newton-Rapshon & Iteration Method.
Statement of Intermediate Value Theorem:

If f(x) is continuous in the interval (a, b) and if f (a) and f(b) are of opposite signs, then the equation f(x) = 0 will have
at least one real root between a and b.

Y Y
f ( x)
f ( x)

a a
X X
b b

Algebraic equation:
An algebraic equation is an equation that includes one or more variables such as x 2 + xy − z = 0 .
Transcendental equation:
An equation together with algebraic, trigonometrical, exponential or logarithmic function etc. is called transcendental equation such as
e x + 2sin x − 5 x = 0 .
Solution/root:
A solution/root of an equation is the value of the variable or variables that satisfies the equation.
Iteration:
Iteration is the repeated process of calculation until the desired result or approximate numerical value has come. Each repetition of the process is also
called iteration and the result of one iteration is used as the starting point for the next iteration.
We are capable to find the root of algebraic or transcendental function by using following methods:
1. Bisection method
2. Newton Rapshon method (Newton’s Iteration method)
3. Iteration method (Method of successive approximation/Fixed-point Iteration Method)
Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 Page |7

4. Regular-Falsi method (The method of False position)

5. The secant method
6. Muller’s method
7. Ramanujan’s method
8. Horner’s method

Bisection Method:
Let us suppose we have an equation of the form f ( x ) = 0 in which solution lies between in the range (a, b) where a  b . Also f ( x ) is
continuous and it can be algebraic or transcendental. If f ( a ) and f (b ) are opposite signs, then there exist at least one real root between a
a+b
and b. Let f ( a ) be positive and f (b ) negative. Which implies at least one root exits between a and b.We assume that root to be xo =
2
. Check the sign of f ( xo ) . If f ( xo ) is negative, the root lies between a and x0 . If f ( xo ) is positive, the root lies between x0 and b.

a + x0 b + x0
Subsequently any one of this case occur. x1 = Or x1 = . When f ( x1 ) is negative, the root lies between x0 and x1 and let the
2 2
x + x0 x + x2
root be x2 = 1 . Again f ( x2 ) negative then the root lies between x0 and x2 , let x3 = 0 and so on. Repeat the process
2 2
x0 , x1 , x2 ,....., xk −1 , xk whose limit of convergence is the exact root. We have to stop the iteration when the value of two successive
iterations are approximately equal. That is xk −1  xk or xk − xk −1  0 .

Advantages of the bisection method:

1. It is always convergent.
2. The error bound decreases by half with each iteration i.e., error can be controlled.
3. It is well suited to electronic Computers.
4. It is very simple method.

Disadvantages/draw-back of the bisection method:

1. The bisection method converges very slowly
2. It requires large number of iterations
3. The bisection method cannot detect multiple roots
4. Choosing a guess close to the root may result in needing many iterations to converge.
5. Cannot find roots of some equations such as y = x 2 = 0 because upper guess and lower guess always produce positive value.
1
6. May seek a singularity point as a root as the equation like y = = 0
x

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 Page |8

Algorithm for Bisection method:

Steps Task
01 Define f ( x )
02 Read a ‘The lower bound of the desired roots’
03 Read b ‘The upper bound of the desired roots’
04 Set k = 1
05 a+b
Calculate xk =
2
06 Calculate f k = f ( xk )
07 Print k , xk , f k
08 If xk − xk −1  0.0001 then
GOTO Step 11
elseif
f ( a ) . f k  0 then b = xk .
Else
f ( b ) . f k  0 then a = xk .
Endif
09 Set k = k + 1
10 GOTO Step 05
11 Print ‘Required root, xk ’
12 STOP

Problem 01:
Find a root of the equation x − 4 x − 10 = 0 using Bisection method.
2

Solution:
Let f ( x) = x 2 − 4 x − 10
Here,
f (−2) = 4 + 8 − 10 = 2  0 and f (−1) = 1 + 4 − 10 = −5  0 .
Since f ( −2) is positive and f ( −1) is negative so at least one real root lies between -2 and -1.
−2 − 1 −3
 x= = = −1.5
2 2
Number of iterations for bisection method is given in the following table in arranged way for determining the approximate value of the desired root
of the given equation.

a+b
Iteration Value of a ( + ) Value of b ( - ) x= Sign of f ( x) = x 2 − 4 x − 10
2
1 -2 -1 -1.5 -1.75 < 0

2 -2 -1.5 -1.75 0.0625 > 0

3 -1.75 -1.5 -1.625 -0.859 < 0

4 -1.75 -1.625 -1.6875 -0.40 < 0

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 Page |9

5 -1.75 -1.6875 -1.7188 -0.1705 < 0

6 -1.75 -1.7188 -1.7344 -0.054 < 0

7 -1.75 -1.7344 -1.7422 0.004 > 0

8 -1.7422 -1.7344 -1.7383 -0.025 < 0

9 -1.7422 -1.7383 -1.7402 -0.0109 < 0

10 -1.7422 -1.7402 -1.7412 -0.003 < 0

The approximate root of the given equation is = −1.7412 because f (−1.7412) = −0.003  0 .
Problem 02:
Find the root of the equation x − x − 1 = 0 by using Bisection method correct up to two decimal places.
3

Solution:Let f ( x) = x 3 − x − 1
Here, f (1) = 1 − 1 − 1 = −1  0 and f (2) = 8 − 2 − 1 = 5  0
Since f (1) and f (2) are of opposite sign so at least one real root lies between 1 and 2.
1+ 2 3
 x= = = 1.5
2 2
Number of iterations for bisection method is given in the following table in arranged way for determining the approximate value of the desired root of
the given equation.

Value of a ( + a+b
Iteration Value of b ( - ) x= Sign of f ( x) = x 3 − x − 1
) 2

1. 2 1 1.5 0.875 > 0

2. 1.5 1 1.25 -0.297 < 0

3. 1.5 1.25 1.375 0.2246 > 0

4. 1.375 1.25 1.3125 -0.0515 < 0

5. 1.375 1.3125 1.34375 0.08626 > 0

6. 1.34375 1.3125 1.3281 0.018447 > 0

7. 1.3281 1.3125 1.3203 -0.019 < 0

8. 1.3281 1.3203 1.3242 -0.002 < 0

9. 1.3281 1.3242 1.3261 0.005970 > 0

10. 1.3261 1.3242 1.3251 0.00162 < 0

It is evident that from the above table, the difference between two successive iterative values of x is 1.3261 − 1.3251 = 0.001 which the
accuracy condition for the solution exact. So, the required root of the given equation up to the two decimal places is 1.32.

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 10

Problem 03:
Find the root of the equation x e x = 1 by using Bisection method correct up to three decimal places on the interval (0, 1).
Solution:
Let f ( x) = x e x − 1
Here, f (0) = 0.e − 1 = −1  0 and f (1) = 1.e − 1 = 1.7182  0
0 1

Since f (0) and f (1) are of opposite sign so at least one real root lies between 0 and 1.
0 +1 1
 x= = = 0.5
2 2
Number of iterations for bisection method is given in the following table in arranged way for determining the approximate value of the desired root
of the given equation.

Iteration Value of a ( + ) Value of b ( - ) a+b Sign of f ( x) = xe x − 1

x=
2

1. 1 0 0.5 -0.1756 < 0

2. 1 0.5 0.75 0.5877 > 0

3. 0.75 0.5 0.625 0.1676 > 0

4. 0.625 0.5 0.5625 -0.0127 < 0

5. 0.625 0.5625 0.59375 0.0751 > 0

6. 0.59375 0.5625 0.578125 0.0306 > 0

7. 0.578125 0.5625 0.5703125 0.00877 > 0

8. 0.5703125 0.5625 0.56640625 -0.0023 < 0

9. 0.5703125 0.56640625 0.5683594 0.00336 > 0

10. 0.5683594 0.56640625 0.5673828 0.000662 > 0

It is evident that from the above table, the difference between two successive iterative values of x is0.5683594 − 0.5673828  0.001 which
the accuracy condition for the solution exact. So, the required root of the given equation up to the three decimal places is  0.567 .
Problem 04:
Find the root of the equation 4sin x − e = 0 by using Bisection method correct up to four decimal places.
x

Solution:
Consider that, f ( x) = 4sin x − e x
Here,
f (0) = 4 sin(0) − e0 = −1  0 and f (1) = 4sin(1) − e1 = 0.64  0 [Change calculator in radian Mode]
Since f (0) and f (1) are of opposite sign so at least one real root lies between 0 and 1.
0 +1 1
 x= = = 0.5
2 2

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 11

Number of iterations for bisection method is given in the following table in arranged way for determining the approximate value of the desired root
of the given equation.

a+b
Iteration Value of a ( + ) Value of b ( - ) x= Sign of f(x)
2
1. 1 0 0.5 0.268 > 0

2. 0.5 0 0.25 -0.294 < 0

3. 0.5 0.25 0.375 0.0101 > 0

4. 0.375 0.25 0.3125 -0.1371 < 0

5. 0.375 0.3125 0.34375 -0.0621 < 0

6. 0.375 0.34375 0.359375 -0.0256 < 0

7. 0.375 0.359375 0.3671875 -0.0077 < 0

8. 0.375 0.3671875 0.3710937 -0.00122 < 0

9. 0.375 0.3710937 0.373046 0.00566 > 0

10. 0.373046 0.3710937 0.372070 -0.00344 < 0

11. 0.373046 0.372070 0.372558 0.00455 > 0

12. 0.372558 0.372070 0.372279 0.0039 > 0

13. 0.372279 0.372070 0.372174 0.0036 > 0

14 0.372174 0.372070 0.372122 0.0036 > 0

It is evident that from the above table, the difference between two successive iterative values of x is 0.372174 − 0.372122  0.0001 which
the accuracy condition for the solution exact. So, the required root of the given equation up to the three decimal places is  0.3721 .

Note: To determine the value of the trigonometrical function f(x), we have to change our calculator in radian mode.

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 12

Try yourself:
TYPE01:
To find the root of the following equations using Bisection method by your own choosing interval
1. 2x − 5x + 2 = 0
2. e2 x − e x − 2 = 0
3. x3 + x 2 − 1 = 0
4. 2x + cos x − 3 = 0
5. cos x − ln x = 0
6. x 2 − 4 x − 10 = 0
7. 2x = 1 + sin x
8. x3 − 2 x 2 − 4 = 0
9. sin x = x − 1
2 2

10. x sin x = 1
11. cos x − xe = 0
x

12. 4x = tan x
13. e tan x = 1
x

TYPE02:

1. Apply bisection method to find real root of x − 3 x + 1 = 0 that lies in (0, 1).
3

2. Find the real root of the equation x + ln x − 2 = 0 belonging to the interval (1, 2) using Bisection Method.
3. Find the real root of the equation x + log10 x − 1.2 = 0 belonging to the interval (2, 3) using Bisection Method.
e− x − cos x = 0 belonging to the interval (1, 3) using Bisection Method.
2
4. Find the real root of the equation
e− x − 4sin x = 0 belonging to the interval (1, 2) using Bisection Method.
2
5. Find the real root of the equation
6. Find the real root of e + 4 x = 0 that lies in (0, 1).
x 2

7. Find the real root of the equation x − 3 x − 5 = 0 belonging to the interval (2, 3) using Bisection Method.
3

8. Find the real root of the equation x − x − 1 = 0 belonging to the interval (2, 3) using Bisection Method.
3

9. Find the positive real root of the equation x − 3 x + 1.06 = 0 by Bisection Method correct to four decimal places.
3

10.Find the positive real root of the equation x + x − 80 = 0 by Bisection Method correct to three decimal places.
4 2

11. Use bisection method to find the real root of the equation xe = 1 between 0 and 1 to four significant figures.
x

−5
12. Compute a root of the equation e = x to an accuracy of 10 using bisection method.
x 2

13. Compute one root of e − 3 x = 0 correct to two decimal places.

x

1
14. Solve the equation x − exp   = 0 by bisection method.
x
TYPE03:
1. Discuss the Bisection Method to find a real root of the equation f ( x ) = 0 in the interval [a,b].

2. Write down an Algorithm for Bisection Method.

3. Mention the Merits and demerits of Bisection Method.
4. What is the draw-backs of the Bisection Method?

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 13

Newton Raphson Method:

2 1
x2 x1 x0

x0  (a, b) be an arbitrary point which is very

Suppose we want to find a real root of the given equation f ( x ) = 0 that lies in (a, b) .Consider
close to the desired root of the given equation f ( x ) = 0 .Draw a tangent to the curve f ( x ) = 0 at x = x0 .Suppose this tangent makes an
angle 1 with x-axis at the point ( x1 ,0) where
x1 is the first approximation of the desired root.
f ( x0 )
tan 1 = (i )
x0 − x1
On the other hand, the slope of the curve f ( x ) = 0 at x = x0 is f ( x0 ) .
tan 1 = f ( x0 ) (ii)
Therefore, from equation (i) and (ii) we have
f ( x0 )
= f ( x0 )
x0 − x1
f ( x0 )
x0 − x1 =
f ( x0 )
f ( x0 )
x1 = x0 −
f ( x0 )
If f ( x1 ) = 0 we say that x1 is the desired root of the given equation f ( x) = 0 .
Suppose that f ( x1 )  0 .Now a draw a tangent to the curve f ( x) = 0 at x = x1 which makes an angle  2 with x-axis at the point ( x2 , 0)
where x2 is the second approximation of the desired root .Consequently we have
f ( x1 )
tan  2 = f ( x1 ) =
x1 − x2
On Simplification we have
f ( x1 )
x2 = x1 −
f ( x1 )
In general the k-th approximation xk can be computed by using the following iterative
f ( xk −1 )
xk = xk −1 − , k = 3, 4,5,......etc.
f ( xk −1 )
We shall continue this iterative process until the value of two successive approximation are approximately equal.i.e xk  xk −1 or f ( xk )  0 .

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 14

Newton Rapson formula from Taylor series:

Letx0 be an approximate value of the desired root of the equation f ( x) = 0 and if x1 is the exact root of f ( x) = 0 then f ( x1 ) = 0 .Let the
small quantity h be the correction of the approximation x0 so that x1 = x0 + h () .For this reason the given equation f ( x1 ) = 0 reduces
to the form as ,
f ( x1 ) = f ( x0 + h) = 0 (1)
From Taylor’s theorem, we have
h ' h 2 '' h3 '''
f ( x0 + h) = f ( x0 ) + f ( x0 ) + f ( x0 ) + f ( x0 ) + (2)
1! 2! 3!
Comparing equation (1) and (2) we find,
h ' h 2 '' h3 '''
f ( x0 ) + f ( x0 ) + f ( x0 ) + f ( x0 ) + =0 (3)
1! 2! 3!
In the above equation the quantity h is relatively so small, so we may neglect the higher power of h more than one and we get from the equation (3)
h '
f ( x0 ) + f ( x0 ) = 0
1!
h
f ( x0 ) + f ' ( x0 ) = 0
1
f ( x0 ) + h f ' ( x0 ) = 0
f (x )
h =− ' 0
f ( x0 )
Now from (*) we get the improved value of the root is of the following
f ( x0 )
x1 = x0 −
f ' ( x0 )
If we use x1 is the approximate value, then the next approximation to the root is as follows,

f ( x1 )
x2 = x1 −
f ' ( x1 )
Proceeding in this way we get,
f ( xn )
xn +1 = xn − where n = 0,1, 2,3,........ etc .
f ' ( xn )
f (x )
Therefore, the formula xn +1 = xn − ' n is known as the Newton Rapson Formula or Tangential Method.
f ( xn )
Advantage of Newton Rapshon method:
1. Converge fast if it converge to the root compare to another method.
2. Requires only one guess.
3. Convergence to the root quadratically.
4. Easy to convert to multiple dimentions.
5. Can be to polish a root found by another methods.

Dis-advantage / drawback of Newton Rapshon method:

1. Must find the derivative.
2. Poor global convergence properties.
3. It takes more computing time
4. It should never be used when the graph of f ( x) = 0 is nearly horizontal where it crosses the x-axis.
5. Dependent on initial guess
Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 15

o May be too far from local root

o May encounter a zero derivative
o May loop indefinitely

Algorithm for Newton Rapson method:

Steps Task
01 Define f ( x )
02 Define f ( x )
03 Read x0
04 Set k =0
05 k = k +1
06 f ( xk −1 )
Calculate xk = xk −1 −
f ( xk −1 )
07 If xk − xk −1  0.0001 then
GOTO Step 8
elseif
GOTO Step 5

08 Print xk ,the desired root

09 STOP

Problem 01:
Find the root of the equation x − 3 x − 5 = 0 by Newton-Rapshon Method correct to four decimal places.
3

Solution:
Let f ( x) = x3 − 3x − 5 then f ' ( x) = 3x 2 − 3 .
Here f (2) = 8 − 6 − 5 = −3  0 and f (3) = 27 − 9 − 5 = 13  0
Since f (2) and f (3) are of opposite sign so at least one real root lies between 2 and 3.
we know that from Newton-Rapshon method ,
f ( xn )
xn +1 = xn −
f ' ( xn )
xn3 − 3xn − 5
xn +1 = xn − [ putting values]
3xn2 − 3
3xn3 − 3xn − xn3 + 3xn + 5
xn +1 =
3xn2 − 3
2 xn3 + 5
xn +1 = (1)
3xn2 − 3
Choosing an initial guess x0 = 2 and putting n = 0 and x0 = 2 in above mentioned equation (1), we are capable to find the
sccessive improved approrimations are as follows:

2 x03 + 5 2  23 + 5
x1 = = = 2.333
3x02 − 3 3  22 − 3

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 16

2 x13 + 5 2  (2.333)3 + 5
x2 = = = 2.2806
3x12 − 3 3  (2.333) 2 − 3

2 x23 + 5 2  (2.2806)3 + 5
x3 = 2 = = 2.2790
3x2 − 3 3  (2.2806) 2 − 3

2 x33 + 5 2  (2.2790)3 + 5
x4 = = = 2.2790
3x32 − 3 3  (2.2790) 2 − 3
Since x4 = x3 so the Newton Rapshon method gives no new values of x and the approximate root is correct to four decimal
places.Hence the require root is 2.2790 .
Problem 02:
Using Newton-Rapshon method ,find the root of the equation x − x − 10 = 0 which is nearer to
4
x = 2 ,correct to three decimal
places.
Solution:
Let f ( x) = x 4 − x − 10 then f ' ( x) = 4 x3 − 1 .
Here f (1) = 1 − 1 − 10 = −10  0 and f (2) = 16 − 2 − 10 = 4  0
Since f (1) and f (2) are of opposite sign so at least one real root lies between 1 and 2.
we know that from Newton-Rapshon method ,
f ( xn )
xn +1 = xn −
f ' ( xn )
xn4 − xn − 10
xn +1 = xn −
4 xn3 − 1
4 xn4 − xn + xn4 + xn + 10
xn +1 =
4 xn3 − 1
3xn4 + 10
xn +1 = (1)
4 xn3 − 1
Choosing an initial guess x0 = 1.9 and putting n = 0 and x0 = 1.9 in above mentioned equation (1), we are capable to find the
sccessive improved approrimations are as follows:
3x04 + 10 3  (1.9) 4 + 10
x1 = = = 1.8
4 x03 − 1 4  (1.9)3 − 1
3x14 + 10 3  (1.8) 4 + 10
x2 = = = 1.85556
4 x13 − 1 4  (1.8)3 − 1
3x24 + 10 3  (1.85556) 4 + 10
x3 = = = 1.85556
4 x23 − 1 4  (1.85556)3 − 1
Since x2 = x3 so the Newton Rapshon method gives no new values of x and the approximate root is correct to five decimal
places.Hence the require root is 1.85556 .
Problem 03:
Find the real root of the equation x − 4sin x = 0 correct to four decimal places using Newton-Rapshon method.
2

Solution:
Let f ( x) = x 2 + 4sin x then f ' ( x) = 2 x + 4cos x .

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 17

Here f (−1) = (−1) + 4sin(−1) = −2.36  0 and f (−2) = (−2) + 4sin(−2) = 0.36  0 .
2 2

Hints: Calculator must be in radian Mode.

Since f ( −1) and f ( −2) are of opposite sign so at least one real root lies between -2 and -1.
we know that from Newton-Rapshon method ,
f ( xn )
xn +1 = xn −
f ' ( xn )
xn2 + 4sin xn
xn +1 = xn −
2 xn + 4 cos xn
2 xn2 + 4 xn cos xn − xn2 − 4sin xn
xn +1 =
2 xn + 4 cos xn
xn2 + 4 xn cos xn − 4sin xn
xn +1 = (1)
2 xn + 4 cos xn
Choosing an initial guess x0 = −1.9 and putting n = 0 and x0 = −1.9 in above mentioned equation (1), we are capable to find
the sccessive improved approrimations are as follows:
x02 + 4 x0 cos x0 − 4sin x0
x1 =
2 x0 + 4 cos x0
(−1.9)2 + 4  (−1.9) cos(−1.9) − 4sin(−1.9)
= = −1.93
2  (−1.9) + 4 cos(−1.9)

x12 + 4 x1 cos x1 − 4sin x1

x2 =
2 x1 + 4 cos x1
(−1.93) 2 + 4  (−1.93) cos(−1.93) − 4sin(−1.93)
= = −1.9338
2  (−1.93) + 4 cos(−1.93)

Since x1  x2 so the Newton Rapshon method gives no new values of x and the approximate root is correct to two decimal
places.Hence the require root is −1.93 .
Problem 04:
Find the root of the equation x sin x + cos x = 0 ,using Newton-Rapshom method.
Solution:
f ' ( x) = 1.sin x + x cos x + (− sin x) = x cos x .
Let f ( x ) = x sin x + cos x then
Here f (2) = 2sin 2 + cos 2 = 1.40  0 and f (3) = 3sin 3 + cos 3 = −0.56  0 .
Hints: Calculator must be in radian Mode.
Since f (2) and f (3) are of opposite sign so at least one real root lies between 2 and 3.
we know that from Newton-Rapshon method ,
f ( xn )
xn +1 = xn −
f ' ( xn )
x sin xn + cos xn
xn +1 = xn − n
xn cos xn

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 18

xn2 cos xn − xn sin xn − cos xn

xn +1 = (1)
xn cos xn
Choosing an initial guess x0 = 2.79 and putting n = 0 and x0 = 2.79 in above mentioned equation (1), we are capable to find
the sccessive improved approrimations are as follows:
x02 cos x0 − x0 sin x0 − cos x0 (2.79)2 cos(2.79) − 2.79sin(2.79) − cos(2.79)
x1 = = = 2.7984
x0 cos x0 2.79 cos(2.79)
x12 cos x1 − x1 sin x1 − cos x1 (2.7984)2 cos(2.7984) − 2.7984sin(2.7984) − cos(2.7984)
x2 = =
x1 cos x1 2.7984 cos(2.7984)
= 2.79834
Since x1  x2 so the Newton Rapshon method gives no new values of x and the approximate root is correct to three decimal
places.Hence the require root is 2.7984 .
Try yourself:
TYPE01:
To find the root of the following equations using Newton-Rapshon method by taking your own guess:
1. x + log x = 2 2. 2 x = log10 x + 7 3. e = 4 x
x
4. x + x − 1 = 0
3 2

5. 3x − cos x −1 = 0 6. sin x = 1 − x
2
7. sin x = 1 − x
2
8. sin x = x − 1
2 2

9. 3 x + sin x = e
x
10. e tan x = 1
x
11. cos x − xe = 0
x
12. x sin x = 1

TYPE02:
1. Find the real root of 2 x − log10 x − 7 = 0 using Newton Raphson in (3, 4).
Using Newton Raphson Method find root of the equation e − 4 x = 0 that lies in (4, 5).
x 2
2.
e x − 4sin x = 0 in the interval (0, 1).
2
3. Using Newton Raphson Method find root of the equation
Find a real root of the equation x + x − 1 = 0 by using Newton Raphson Method correct up to four decimal places.
3 2
4.
5. Use Newton Raphson’s Method to find the root of x − x − 2 = 0 with x0
3
= 3.
Find a real root of the equation x + x − 80 = 0 by using Newton Raphson Method correct up to three decimal places.
4 2
6.
Find a real root of the equation x + ln x − 2 = 0 in [1,2] by using Newton Raphson Method correct up to five decimal places.
2
7.
By using Newton Method find a real root of the equation x − x − 10 = 0 which is near to x=2 correct up to three decimal places.
4
8.
Find a real root of the equation x + x + 3 x + 4 = 0 by using Newton Raphson Method correct up to four decimal places.
3 2
9.
10. Find by using Newton Method the real root of the equation e = 4 x which is approximately 2 correct to three places of decimals.
x

TYPE03:
1 N
1. Using Newton Raphson Method establish the formula xn +1 =  xn +  to calculate the square root of N. Hence find the square
2 xn 
root of 5 correct to four places of decimals.
1
2. Show that the iterative formula for finding the reciprocal of N is xn+1 = xn ( 2 − Nxn ) and hence find the value of .
31
3. Derive the iterative formula for Newton Raphson method to solve the equation f ( x ) = 0 .
4. Write down the merits and demerits of Newton Raphson Method.
5. Write down the algorithm for Newton Raphson Method.
6. When does Newton Raphson Method Fails.

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 19

Fixed Point Iteration Method:

Let us consider an equation f ( x ) = 0 whose roots are to be determined in the interval (a,b). The equation f ( x ) = 0 can be expressed as
x =  ( x) (1)
We assume that  ( x ) must be such that  ( x)  1, x  (a, b) .
Let x0 is an initial solution or approximation for the equation f ( x) = 0 .we substitute the value of x0 in the right-hand side of the equation (1)
and obtain a better approximation x1 given by the equation x1 =  ( x0 ) .
Again, substituting x = x1 in the equation (1), we get next approximation as x2 =  ( x1 ) .
Preceding in this way we can find the following successive approximations,
x3 =  ( x2 )
x4 =  ( x3 )

xn =  ( xn −1 )
Therefore, the iterative formula for successive approximation method is,
xn =  ( xn−1 ), n = 1, 2,3, 4,...etc.
Here xn is the n-th approximation of the desired root of f ( x) = 0 .
We shall continue this iterative cycle until the values of two successive approximations are almost equal. This above-mentioned method is known
as Iteration method. Or Method of successive approximation or Fixed-point Iteration.
Algorithm for Iteration method:

Steps Task
01 Define ( x)
02 Read x0
03 Set k = 1
04 xn =  ( xn−1 )
05 If xn − xn−1  0.0001 then
GOTO Step 6
else
n = n +1
GOTO Step 04
06 Print xn ,the desired root
07 STOP

Problem 01:
−4
Find the real root of the equation x + x − 1 = 0 on the interval [0, 1] with an accuracy of 10 .
3 2

Solution:
Let f ( x) = x 3 + x 2 − 1
 f (0) = 03 + 02 − 1  −1 andf (1) = 13 + 12 − 1 = 1  1
Since f (0) and f (1) are of opposite sign so at least one real root lies between 0 and 1.
The given equation can be expressed as x + x − 1 = 0
3 2

x 2 ( x + 1) = 1

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 20

1
x2 =
( x + 1)
1
x= =  ( x) [say]
( x + 1)
1 1 1
 ( x) =   ( x) = −
( x + 1)
3
2 ( x + 1) 2
1 1 1 1
Also,  ( x) = − 3 = 3 1
for x  (0,1) .
2 ( x + 1) 2 2 ( x + 1) 2
Therefore, the iteration method is applicable for the given function.
Assume x0 = 0.7 is an initial solution or approximation for the equation f ( x ) = 0 .
So successive approximations are,
1 1
x1 =  ( x0 ) = = = 0.76697
x0 + 1 0.7 + 1

1 1
x2 =  ( x1 ) = = = 0.75229
x1 + 1 0.76697 + 1
1 1
x3 =  ( x2 ) = = = 0.75543
x2 + 1 0.75229 + 1
1 1
x4 =  ( x3 ) = = = 0.75476
x3 + 1 0.75543 + 1
1 1
x5 =  ( x4 ) = = = 0.75490
x4 + 1 0..75543 + 1
1 1
x6 =  ( x5 ) = = = 0.75487
x5 + 1 0.75543 + 1
1 1
x7 =  ( x6 ) = = = 0.75488
x6 + 1 0.75487 + 1
1 1
x8 =  ( x7 ) = = = 0.75488
x7 + 1 0.75488 + 1
Since x7  x8 so the Iteration method gives no new values of x and the approximate root is correct to four decimal places.Hence the
require root is 0.7548 .
Problem 02:
Find the real root of the equation x − ln x − 2 = 0 that lies on [3, 4] using fixed point iteration method.
Solution:
Let f ( x) = x − ln x − 2 = 0
Now f (3) = 3 − ln 3 − 2 = −0.0986
f (4) = 4 − ln 4 − 2 = 0.6137
f (3.5) = 3.5 − ln 3.5 − 2 = 0.2472
Hence there exist a root in (3, 3.5).
Now we rewrite the given equation f ( x ) = 0 in the following form:

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 21

x = ln x − 2 =  ( x) [ say ]
1
 ( x) =
x
Now Max (  (3) ,  (3.5) ) = ( 0.333,0.2857 )  1
Therefore  ( x )  1 in (3, 3.5).
Then the iterative technique for fixed point iteration method is
xn =  ( xn−1 ) , where n = 1, 2,3,....., etc.
Now let us start with the initial guess x0 = 3 then successive approximation using fixed point iteration method are tabulated below.

Values of n Values of xn −1 xn = ln ( xk −1 ) + 2
1. 3 3.098612289
2. 3.098612 3.130954362

3. 3.130954 3.141337866

3.141338 3.144648781
4.
3.144649 3.145702209
5.

6. 3.145702 3.146037143

7. 3.146037 3.146143611

8. 3.146144 3.146177452

Since x8 − x7  0.000 = 0 .
Hence the root of the given equation x − ln x − 2 = 0 is equal to 3.1461.
Problem 03:
Find the real root of the equation x + ln x − 2 = 0 that lies on [1, 2] using fixed point iteration method.
Solution:
Let f ( x) = x + ln x − 2 = 0
Now f (1) = 1 + ln1 − 2 = −1
f (2) = 2 + ln 2 − 2 = 0.6931
f (1.5) = 1.5 + ln1.5 − 2 = −0.09453
f (1.7) = 1.7 + ln1.7 − 2 = 0.230628
Hence there exist a root in (1.5, 1.7).
Now we rewrite the given equation f ( x ) = 0 in the following form:
x = 2 − ln x =  ( x) [ say ]
1
 ( x) = −
x
1 1
Now  ( x ) = − = 1
x x
Therefore  ( x )  1 in (1.5, 1.7).).
Then the iterative technique for fixed point iteration method is
xn =  ( xn−1 ) , where n = 1, 2,3,....., etc.

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 22

Now let us start with the initial guess x0 = 1.5 then successive approximation using fixed point iteration method are tabulated below.

Values of n Values of xn −1 xn = 2 − ln ( xk −1 )
1. 1.5 1.594534892
2. 1.594535 1.53341791

3. 1.533418 1.572500828

4. 1.572501 1.547332764

1.547333 1.563467349
5.
1.563467 1.553093986
6.

7. 1.553094 1.559750939

8. 1.559751 1.555473846

9. 1.555474 1.558219777

10. 1.55822 1.556455999

11. 1.556456 1.557588559

12. 1.557589 1.556861171

1.556861 1.557328276
13.
1.557328 1.557028291
14.

Since x14 − x13  0.0001 = 0 .

Hence the root of the given equation x − ln x − 2 = 0 is equal to 1.557328.
Problem 04:
Find the real root of the equation sin x − 5x + 2 = 0 that lies on [0, 1] using fixed point iteration method.
Solution:
Let f ( x ) = sin x − 5 x + 2 = 0
Now f (0) = 2
f (0.5) = sin ( 0.5) − 5  0.5 + 2 = − 0.20
f (1) = sin (1) − 5.1 + 2 = − 2.98
Note: Change the calculator in radian mode before calculation

Hence there exist a root in (0, 0.5).

Now we rewrite the given equation f ( x ) = 0 in the following form:
sin x + 2
x= =  ( x) [ say ]
5
cos x
 ( x) =
5

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh
 P a g e | 23

cos x
Now  ( x) = 1
5
Therefore  ( x )  1 in (0, 0.5).
Then the iterative technique for fixed point iteration method is
xn =  ( xn−1 ) , where n = 1, 2,3,....., etc.
Now let us start with the initial guess x0 = 0.5 then successive approximation using fixed point iteration method are tabulated below.

sin xn −1 + 2
Values of n Values of xn −1 xn =
5
1. 0.5 0.327026799
2. 0.327026799 0.377578359

3. 0.377578359 0.341867524

4. 0.341867524 0.338731938

5. 0.338731938 0.338983858

6. 0.338983858 0.338223295

Since x6 − x5  0.0002 = 0 .
Hence the root of the given equation sin x − 5x + 2 = 0 is equal to 0.338983858.
Try yourself:
TYPE01:
To find the root of the following equations using Iteration method by taking your own guess:
1. x − 5 x + 1 = 0
3
2. x − 9 x + 1 = 0
3 3. 2 x − log x = 7 4. 3x − log10 x − 16 = 0
5. e = 4 x
x
6. 3x = 1 + cos x 7. e tan x = 1
x
8. x + ln x − 2 = 0
9. x − 2 x − 4 = 0 10. 4sin x + x = 0 11. sin x = 1 − x 12. 3 x + sin x = e
3 2 2 2 x

TYPE02:
1. Find the root of x + x − 1 = 0 by iteration method given that root lies near 1.
2

2. Find a real root cos x = 3x −1 correct to three decimal places.

3. Find by iteration method the root near 3.8 of equation 2 x − log10 x = 7 correct to four decimal places.
Solve the equation x − 2 x − 5 = 0 by iteration method.
3 2
4.
Find the real root the equation x + x − 100 = 0 by the method of successive approximations.
3 2
5.
Find the root of x = sin x which lies between 0.5 and 1 correct to four decimal places.
2
6.
7. Show that the equation log e x = x − 1 has exactly two real roots
2
1 = 0.45 and  2 = 1 .
8. Find the positive real root of x + 3 x − 12 x − 11 = 0 correct to three decimal places.
3 2

9. Solve the equation x sin x = 1 for the positive root by iteration method.
10. Determine the real root of the equation tan x = x by iteration method.
11. Find the root of x + ln x − 2 = 0 in [1,2] by fixed point iteration method taking
2
x0 = 1 correct to five decimal places.
12. Use the method of iteration to find a positive root between 0 and 1 of the equation xe = 1 .
x

−5
13. Compute a root of the equation e = x to an accuracy of 10 ,using the iteration method.
x 2

Mohammad Abdul Halim, Senior Lecturer in Mathematics, Department of General Educational Development (GED)
Faculty of Science and Information Technology (FSIT), Daffodil International University (DIU), Dhaka, Bangladesh