ACTIVITY1 BisectionMethod GUNTING
ACTIVITY1 BisectionMethod GUNTING
27, 2024
BSCE-3B
ACTIVITY 1
BISECTION METHOD
I. INTRODUCTION
The Bisection Method is a straightforward numerical technique for
finding the root of a continuous function. It relies on the
Intermediate Value Theorem, which states that if a function
F(x) is continuous over an interval [a,b] and F(a) and F(b) have
opposite signs, there is at least one root between A and b. The
method involves iteratively narrowing down the interval: choose two
points a and b with opposite signs for F(a) and F(b), compute the
midpoint C, and determine which subinterval contains the root
based on the sign of F(c). This process is repeated until the interval
is sufficiently small or F(c) is close to zero. While the Bisection
Method is simple to implement and guarantees convergence if the
initial interval contains a root, it converges more slowly compared to
methods like Newton’s Method and requires a function to change
sign over the interval.
III. METHODOLOGY/ALGORITHM
The methodology of the Bisection Method involves a systematic
approach to finding a root of a continuous function. Here’s a step-
by-step outline:
C=1/2(a+b)
=(C5+D5)/2
VI.RESULT
Using the Microsoft Excel, after enough iterations, you will approximate
the roots of the polynomial where f(x) changes sign. The results might
be close to the actual roots, which could be more precisely determined
with additional iterations. For the polynomial f(x)= x⁴-2x³-5x²+6x+3 ,
approximate roots can be identified by continuing this process until the
interval width is sufficiently small.
For root #1 :
Root = -0.3947
Number of iterations = 15
For root #2 :
Root = -1.8872
Number of iterations = 11
For root #3:
Root = 1.39468
Number of iterations = 15
For root #4 :
Root = 2.88736
Number of iterations = 15