BISECTION METHOD Er.

Sudip rana
BISECTION METHOD.
The bisection method is an approximation method to find the roots
of the given equation by repeatedly dividing the interval. This
method will divide the interval until the resulting interval is found,
which is extremely small.
It separates the interval and subdivides the interval in which the
root of the equation lies.
It is a simple method and it is relatively slow.
The bisection method is also known as interval halving method,
root-finding method, binary search method or dichotomy method or
Bolzano method.
WORKING RULE OF BISECTION METHOD
1. In this method we initially guess two root x1 and x2 for which f(x1)*f(x2)<0.
2. We find midpoint of this two point by x=(x1+x2)/2 and calculate f(x)
3. If f(x)<0 then our new root lies between x
And x2. otherwise it lies between x and x1.
4. If f(x)<0, Again we calculate midpoint by
xm =(x+x2)/2 and find f(xm).
5. We repeat above steps until we get very
Close To desired root.
ALGORITHM OF BISECTION METHOD.
iteration b a c F(c)

1 1 0 0.5000 0.1065

2 1 0.5000 0.7500 -0.2776

3 0.7500 0.5000 0.625 -0.0897

4 0.625 0.5000 0.5625 0.00728

5 0.625 0.5625 0.59375 -0.0415

6 0.59375 0.5625 0.57813 -0.01718

7 0.57813 0.5625 0.57032 -0.00497

8 0.57032 0.5625 0.56641 0.00115

9 0.57032 0.56641 0.5684 -0.00191

10 0.5684 0.56641 0.5674 -0.00041

11 0.5674 0.56641 0.5670 0.00037

QUESTIONS
1. F(x)=x^3-4x-9 (2.7064)
2. F(x)=2x^3+4x^2-4x-6
3. F(x)=sinx-(1/x) (1.11328)
4. F(x)=logx-cosx