A

Term Paper Report

On
Role of bisection method in finding the roots of
any given transcendental equation.
Bachelor of Computer Science
Session-(2015-2018)

SHRI RAMSWAROOP MEMORIAL GROUP OF

PROFESSIONAL COLLEGE

LUCKNOW

Affiliated to

LUCKNOW UNIVERSITY

Submitted To: Submitted By:

Dr. Mayank Trivedi Akash Jaiswal

ROLLNO: 16065106008

ACKNOWLEDGEMENT

I would like to express my special thanks of gratitude to my teacher Dr. Mayank Trivedi sir

as well as our HOD Dr.Vinay Kumar Mishra sir who gave me the golden opportunity to do

this wonderful project on the topic Role of bisection method in finding the roots of any
given transcendental equation, which also helped me in doing a lot of Research and i came

to know about so many new things I am really thankful to them.

Secondly i would also like to thank my parents and friends who helped me a lot in finalizing

this project within the limited time frame.

INTRODUCTION

The bisection method is simple, robust, and straight-forward: take an interval [a, b] such that
f(a) and f(b) have opposite signs, find the midpoint of [a, b], and then decide whether the root
lies on [a, (a + b)/2] or [(a + b)/2, b]. Repeat until the interval is sufficiently small.

Bisection method is a method provides practical method to find roots of equation. This
method also helps to prove the intermediate theorem. Among all the numeral methods
bisection method is the simplest one to solve the transcendental equations.
This method helps to find the zero of a function by repeatedly halving the selected interval.
The bisection method is a straightforward technique for finding numerical solutions to
equations in one unknown.

It works by narrowing the gap between pos and neg until it closes in on the correct answer. It
narrow the gap by taking average of pos and neg. The average may be positive or negative. It
is slow compared with other numerical techniques. In this section we will be dealing with
bisection method with some solved problems.

ABSTRACT

The Characteristic Bisection Method for finding the roots of non-linear algebraic and/or
transcendental equations is applied to LiNC/LiCN molecular system to locate periodic orbits
and to construct the continuation/bifurcation diagram of the bend mode family. The algorithm
is based on the Characteristic Polyhedra which define a domain in phase space where the
topological degree is not zero. The results are compared with previous calculations obtained
by the Newton Multiple Shooting algorithm. The Characteristic Bisection Method not only
reproduces the old results, but also, locates new symmetric and asymmetric families of
periodic orbits of high multiplicity.

Where as bisection method find an approximation to a zero of a continuous function. In case

of IVT function could jump over some values in the interior of the interval, which possibility
arises if the function is discontinuous at both endpoints.

DEFINITION

The bisection method in mathematics is a root finding method which repeatedly bisects an
interval and then selects a subinterval in which a root must lie for further processing.

It is a very simple and robust method , but it is also relatively slow. Because of this, it is often
used to obtain a rough approximation to a solution which is then used as a starting point for
more rapidly converging methods. The method is also called the binary search method or the
dichotomy method

In mathematics, bisection method used to find the roots of an equation. It separate intervals
and select a sub-interval in which root of the equation lies. It is simple and also relatively
slow method. It is based on the intermediate theorem for continuous functions. This is also
called as root finding method or binary search method, dichotomy method or the interval
halving method.

Consider a continuous function g which is defined on closed interval [c, d] is given with g(c)
and g(d) of different sign. Then by intermediate theorem, there exists a point m belongs to (c,
d) for which g(m) = 0.

When we find more than one root in the selected interval, for simplicity we assume that the
root in the selected interval is unique. In this case m is a unique root of function. Let us see
how this method is different from intermediate value theorem:

Bisection method is the one of the applications of the intermediate theorem. Intermediate
value theorem states that: if a function defined and continuous on a closed interval, say [m,
n], then there exist a number between [m, n], say t. The function has at least one solution t in
the open interval (m, n).

ALGORITHM

Step 1: Choose two approximations A and B (B>A) such that f(A)*f(B)<0

Step 2: Evaluate the midpoint C of [A,B] given by C=(A+B)/2

Step 3: If f(C)*f(B)<0 then rename B & C as A & B. If not rename of C as B . Then apply the
formula of Step 2.
Step 4: Stop evolution when the different of two successive values of C obtained from Step 2
is numerically less than E, the prescribed accuracy

How To Solve

The Bisection method is a approximation method to find the roots of an equation by

continuously dividing an interval. It will divide the interval in halves until the resulting
interval found, which is extremely small.

There is no any specific formula to find the root of a function using bisection method:
Bisection Method:

For the ith iteration, the interval width is:

xi = 12 = 0.5 and xi1 = (0.5)i(n-m); where n > m

So the new midpoint is xi = mi1 + xi

for i = 1, 2, 3, ..., n

Below are certain steps to get the solution for the function.

For a continuous function g(x)

Step 1: Find two points, say m and n st m < n and g(m) * g(n) < 0
Step 2: Find the midpoint of m and n, say t
Step 3: t is root of function if g(t) = 0, else follow the next step.
Step 4: Divide the interval [m, n]. If g(t) * g(n) < 0, let m = t, else if g(t) * g(m) < 0 then let n
= t.
Step 5: Repeat above two steps until g(t) = 0
 Example

Consider finding the root of f(x) = x2 - 3. Let step = 0.01, abs = 0.01 and start with the
interval [1, 2].

Table 1. Bisection method applied to f(x) = x2 - 3.

Thus, with the seventh iteration, we note that the final interval, [1.7266, 1.7344], has a width
less than 0.01 and |f(1.7344)| < 0.01, and therefore we chose b = 1.7344 to be our
approximation of the root.

Advantages of Bisection Method

The bisection method is always convergent. Since the method brackets the root, so the
method is guaranteed to converge. The convergence is guaranteed if a & b taken are such that
f(a) * f(b) < 0

Error can be controlled. As iterations are conducted, the interval gets halved, so one can
guarantee the error in the solution of the equation.

It is also considered to be the safest method and simplest method.

 Disadvantages of Bisection Method

Convergence is slow. Although convergence is guaranteed it is generally slow. The reason

is every time the interval is getting half the max amount of error is getting half as we go from
one iteration to another.

choosing a guess close to the root may result in need of many iterations to converge.

cannot find roots of some equations.

May seek a singularity point as root f(x)=1/x=0

Applications of bisection method

It is used in computer science research to analyze safeguard zero finding methods.

It is simplest of all other methods.

We can safeguard bisection to detect cases where we dont have any roots.

Error Analysis

Given that an initial bound on the problem [a, b], then the maximum error of using either a
or b as our approximation is h = b a.

Since we divide the width into half of the interval with each iteration, the error is reduced
by a factor of 2, thus, the error after n iterations will be h/2n.
 REFRENCE

1. https://www.slideshare.net/BhagawatAdhikari1/root-finding-

method?qid=a3e3c177-d5ec-48f9-a883-e59c08a49980&v=&b=&from_search=2

2. http://math.tutorvista.com/calculus/bisection-method.html

3. https://en.wikiversity.org/wiki/The_bisection_method

4. https://ece.uwaterloo.ca/~dwharder/NumericalAnalysis/10RootFinding/bisection/