Skip to main content
BRACKETING or CLOSED METHODSBISECTION METHOD & FALSE POSITION METHOD!!!!!
BISECTION METHOD!The Bisection Method is a numerical method for estimating the roots of a polynomialf(x).   It is one of the simplest and most reliable but it is not the fastest method.   Assume that f(x) is continuous.
LET’S DO IT STEP BY STEP!Given a continuous function f(x)1-  Find points a and b such that a < b and f(a) * f(b) < 0.2- Take the interval [a, b] and find its midpoint x1.3-   If f(x1) = 0 then x1 is an exact root, else if f(x1) * f(b) < 0 then let a = x1, else if f(a) * f(x1) < 0 then let b = x1. 4-   Repeat steps 2 & 3 until f(xi) = 0 or |f(xi)| <= DOA, where DOA stands for degree of accuracy.
LET’S DO IT STEP BY STEP!
LET’S DO IT STEP BY STEP!For the ith iteration, where i = 1, 2, . . . , n, the interval width isxi = 0.5 xi–1 = ( 0.5 )i ( b – a ) and the new midpoint isxi = ai–1 + xi
EXAMPLE!Considerf(x) = x3 + 3x – 5, where [a = 1, b = 2]and DOA = 0.001.
THANKS!!!CHECK THE NEXT VIDEO AND PROVE YOUR KNOWLEDGE……………SOURCE: http://www2.lv.psu.edu/ojj/courses/cmpsc-201/numerical/bisection.html