4.1 Solution of Algebraic and Transcendental Equations: Bisection Method

4.
1
Solution of Algebraic and Transcendental
Equations: Bisection Method
Introduction
In scientific and engineering studies, a frequently occurring
problem is to find the roots of equations of the form.
(1)
If is a quadratic, cubic or a biquadratic expression
then algebraic formulae are available for expressing the
roots in terms of the coefficients. For example, the roots of
the quadratic equations are .
On the other hand, when is a polynomial of higher

degree or an expression involving transcendental functions,
algebraic methods are not available, and recourse must be
taken to find the roots by approximate methods.
In the first four modules, we concerned with the
description of several numerical methods for the solution of
equations of the form (1), where is algebraic or
transcendental or a combination of both. Now, algebraic
functions of the form
, (2)
are called polynomials and we discuss some special
methods for determining their roots. A non-algebraic
function is called a transcendental function, for example,
,
etc… The roots of (1) may be either real or complex. We
discuss methods of finding a real root of algebraic or
transcendental equations and also methods of determining
all real and complex roots of polynomials.
THE BISECTION METHOD

This method is based on mean value theorem which states
that if a function is continuous between and , and
are of opposite signs, then there exists at least
one root between and . For definiteness, let be
negative and be positive. Then the root lies between
and let its approximate value be given by .
If , we conclude that is a root of the equation
. Otherwise, the root lies either between and , or
between and depending on whether is negative or
positive. We designate this new interval as whose
length is . As before, this is bisected at and the
new interval will be exactly half the length of the previous
one. We repeat this process until the latest interval (which
contains the root) is as small as desired, say . It is clear
that the interval width is reduced by a factor of one-half at
each step and at the end of the step, the new interval
will be of length . We then have
which give on simplification

(3)
Inequality (3) gives the number of iterations required to

achieve an accuracy . For example, if and
, then it can be seen that
(4)
The method is shown graphically in the figure below.
Figure: Graphical representation of the bisection method
It should be noted that this method always succeeds. If

there are more roots than one in the interval, bisection
method finds one of the roots. It can be easily programmed
using the following computational steps:
1. Choose two real number and such that .
2. Set .
3.
a. If , the root lies in the interval .
Then, set and go to step 2 above.
b. If , the root lies in the interval .
Then, set and got to step 2.
c. If , it means that is a root of the
equation and the computation may be
terminated.
In practical problems, the roots may not be exact so that
condition (c) above is never satisfied. In such a case, we
need to adopt a criterion for deciding when to terminate the
computations.
A convenient criterion is to compute the percentage error
defined by
(5)
where is the new value of . The computations can be

terminated when becomes less than a prescribed
tolerance, say . In addition, the maximum number of
iterations may also be specified in advance.
Definitions
Given some value and its approximation , the

absolute error is
Where the vertical bars denote the absolute value. If: .

the relative error is
and the percent error is
One commonly distinguishes between the relative error and

the absolute error. The absolute error is the magnitude of
the difference between the exact value and the
approximation. The relative error is the absolute error
divided by the magnitude of the exact value. The percent
error is the relative error expressed in terms of per .
As an example, if the exact value is and the

approximation is , then the absolute error is 0.1 and
the relative error is . The relative error is
often used to compare approximations of numbers of widely
differing size; for example, approximating the number
with an absolute error of is, in most applications, much
worse than approximating the number with an
absolute error of ; in the first case the relative error is
and in the second it is only .
Example 1
Find a real root of the equation .

Solution:
Since is negative and positive, a root lies between
and and therefore we take . Then
, which is positive.
Hence the root lies between 1 and 1.5 and we obtain
We find , which is negative. We therefore

conclude that the root lies between 1.25 and 1.5. If follows
that
The procedure is repeated and the successive

approximations are
, ,
Example 2
Find the number of iterations required to find a root of
which lies in between and with
accuracy by using bisection method.
Solution: Given
Formula for finding number of iterations is

Here and .
number of iterations required to achieve the desired

accuracy is .
Example 3
Find a real root of the equation .

Solution:
Let .
Then .
Hence a root lies between 2 and 3 we take
Since , we choose as the new interval.

Then
Proceeding in this way, the following table is obtained.

At , it is seen that the difference between two
successive iterates is , which is less than . Thus
this result agrees with condition given in (4).
Example 4
Find a positive root of the equation , which lies
between and with desired percentage error .
Solution:
Let . Since and , it
follows that a root lies between and 1. Thus .
Since is negative, it follows that the root lies between
and . Hence the new root is i.e., . Using
the values and , we calculate :
Again, we find that is positive and hence the root
lies between and , . Now, the error is
Proceeding in this way, the following table is constructed

where only the sign of the function value is indicated. The
prescribed tolerance is .
Thus after 12 iteration, the error, , finally satisfies the

prescribed tolerance, viz, . Hence the required root is
and it is easily seen that this value is correct to three
decimal places.

4.1 Solution of Algebraic and Transcendental Equations: Bisection Method

Uploaded by

Copyright:

Available Formats

4.1 Solution of Algebraic and Transcendental Equations: Bisection Method

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

4.1 Solution of Algebraic and Transcendental Equations: Bisection Method

Uploaded by

Copyright:

Available Formats

4.

On the other hand, when is a polynomial of higher

THE BISECTION METHOD

which give on simplification

Inequality (3) gives the number of iterations required to

Figure: Graphical representation of the bisection method

It should be noted that this method always succeeds. If

where is the new value of . The computations can be

Given some value and its approximation , the

Where the vertical bars denote the absolute value. If: .

and the percent error is

One commonly distinguishes between the relative error and

As an example, if the exact value is and the

Find a real root of the equation .

Hence the root lies between 1 and 1.5 and we obtain

We find , which is negative. We therefore

The procedure is repeated and the successive

Formula for finding number of iterations is

number of iterations required to achieve the desired

Find a real root of the equation .

Since , we choose as the new interval.

Proceeding in this way, the following table is obtained.

Proceeding in this way, the following table is constructed

Thus after 12 iteration, the error, , finally satisfies the

You might also like