Chapter 02

Solution of Algebraic and

Transcendental Equations
 Solution of Algebraic and Transcendental equations

Chapter Outcomes :

After reading this chapter, you should be able to:

1. Know about the Error, exact, relative, and percentage error.

2. Relate the absolute, relative, and approximate error to the number of significant digits.
3. Know that there are two inherent sources of error in numerical methods – round-off and truncation error.
4. Know the difference between round-off and truncation error.
5. Know the concept of significant digits.
 Solution of Algebraic and Transcendental equations

In this Lesson, we have discussed about the solution of equations ,

Where , f ( X ) is linear, nonlinear, algebraic or transcendental function.

We get the solution of the equation f (x) = 0 by using

(1) Bisection method,
(2) Newton- Raphson method and
(3) Method of false position.

Those methods are established based on Intermediate Value Theorem.

 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.
 ❖Algebraic Equation :
An algebraic equation is an equation that includes one or more variables
such as

❖Transcendental equation:
An equation together with algebraic, trigonometrical, exponential or logarithmic
function etc. is called transcendental equation such as

❖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:

5.The
4.Regular-Fa secant
lsi method method
(The method
3 . Iteration
of False
method (Method of
position)
2.Newton successive
Rapshon approximation/Fix
method ed-point Iteration
(Newton’s Method)
1.Bisection Iteration
method method)
*** You have to know , how to use calculator for solving the
mathematical problem

*** No. 01 : To determine the value of the trigonometrical function

f(x), we have to change our calculator in radian mode.
 Use of Calculator
*** You have to know , how to use calculator for solving the mathematical problem.
Bisection Method
Procedure of Bisection Method :

Step 1 : Given function, f (x)

Fin
ste d f (x
p1 ) in
the
Step 2 : Choose , two real numbers a and b
Such that ,

Fin
bet d the
in t ween Inter
Since , f (a) = f( 0) is negative and f ( b ) = f (1) is positive he
ste
(a v
, b al
p2 )
So at least one real root lies between 0 and 1.
 Find out the mid
point of a & b and
give it name c.
Step 3:

C is the root of the given function if f (c) = 0;

else follow the next step.

Find out f (c) by

using the mid
Step 4 : point c .
 Step 4 : Case I : If f (c) is negative , Then b = c
Case II : If f (c) is positive , Then a = c f (c) is
negative

Case I : If f (c) is negative , Then b = c

Case II : If f (c) is positive , Then a = c
Step 5:
No of Value of a [ (+) ve] Value of b [ (-) ve] f (c) Sign of f (c)
Iterations

01 1 0 0.5
0.5 - 0.625 <0 b=c
Repeat steps 2,3 , 4 until the last two iterations are equal.
02 1 0.5 0.75 -0.015
-0.015 <0 b=c

1 0.75 0.875
0.875 >0 a=c
03 0.43555
0.43555

04 0.875 0.75 0.8125

0.8125 0.19653 >0 a=c

05 0.8125 0.75 0.78125 0.0871 >0 a=c

0.0871

f (c) is positive
 Repeat steps 2, 3 , 4 until the last two iterations are equal or the
Step 5 : difference between the last two iterations are near to zero.
 Steps 3, 4 , 5
No of Value of a [ (+) Value of b [ (-) ve] f (c) Sign of f (c) Change
Iterations ve]

05 0.8125 0.75 0.78125 0.0871

0.0871 >0 a=c

06 0.78125 0.75 0.765625 0.03497 >0 a=c

07 0.765625 0.75 0.7578125

0.7578125 0.00947 >0 a=c

08 0.7578125 0.75 0.75390625

0.75390625 -0.0031 <0 b=c

0.75390625 0.755859375 0.0035 >0 a=c

09 0.7578125

10 0.755859375 0.75390625 0.75488281255

0.75488281255 1.65... >0 a=c

11 0.75488281255 0.75390625 0.754394531275

The difference between the last two iterations are near to zero.
 It is evident that from the above table, the difference between last two successive
iterative values of x is

which the accuracy condition for the solution exact. So, the required root of the given
equation up to the three decimal places is 0.754
 Problem 1 :

Solution: Step : 1
Here, let , a = 0 , b = 1 then ,

Since f (0) and f(1) are of opposite sign so at least one real root lies between 0 and 1.
 Step : 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.
No. of iterations Value of a [ (+) Value of a [ (-) Sign of f (c)
ve] ve]

01 1 0 0.5
0.5 -0.1756 <0

02 1 0.5 0.75 0.5877 >0

03 0.75 0.5 0.625

0.625 0.1676 >0

0.625 - 0.0127 <0

04 0.5 0.5625

05 0.625 0.5625 0.59375

0.59375 0.0751
0.0751 >0

06 0.59375 0.5625 0.578125 0.0306 >0

07 0.578125 0.5625 0.57031255

0.5703125 0.00877 >0

08 0.5703125 0.5625 0.56640625

0.56640625 - 0.0023 <0

09 0.5703125 0.56640625 0.5683594

0.5683594 0.00336
0.00336 >0

10 0.5683594 0.56640625 0.5673828 0.000662

 It is evident that from the above table, the difference between last two successive
iterative values of x is

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 2: Find the root of the equation
by using Bisection method correct up to four decimal places.

Solution: Consider that,

Her, let , a = 0 , b = 1 then ,

Since f (0) and f (1) are of opposite sign so at least one real root lies between 0 and 1.
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.
 No of Value of a [ (+) ve] Value of b [ (-) ve] f (c) Sign of f (c)
Iterations

01 1 0 0.268
0.268 >0
0.5
0.5
02 0.5 0 0.25 -0.294 <0

03 0.5 0.25 0.375 0.0101

0.0101 >0

04 0.375 0.25 0.3125 -- 0.1371

0.1371 <0
05 0.375 0.3125 0.34375
0.34375 -0.0621
-0.0621 <0
06 0.375 0.34375 0.359375
0.359375 -0.0256 <0

07 0.375 0.359375 0.3671875 -0.0077 <0

08 0.375 0.3671875 0.3710937

0.3710937 - 0.00122 <0

09 0.375 0.3710937 0.373046 0.00566 >0

10 0.373046 0.3710937 0.372070

0.372070 -0.00344 <0
 No of Value of a [ (+) ve] Value of b [ (-) ve] f (c) Sign of f (c)
Iterations

10 0.373046 0.3710937 0.372070 -0.00344

-0.00344 <0

11 0.373046 0.372070 0.372558

0.372558 0.00455 >0

12 0.372558 0.372070 0.372279

0.372279 0.0039 >0

0.372279 0.372070 0.372174

0.372174 0.0036
-0.0036
13 >0

14 0.372174 0.372070 0.372122

0.372122 0.0036
It is evident that from the above table, the difference between last two successive
iterative values of x is

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
Algorithm of Bisection Method:
 Practice Work

Find the root of the following equation by using Bisection method correct up to four decimal places :

1. 2 x - 5 x + 2 = 0

2. 2 x + Cos x - 3 = 0
2
3. x - 4 x - 10 = 0
4. 2 x = 1 + sin x
5. Cos x – x ex = 0

6. e x tan x =1
7 . Cos(x )– log(x) = 0