Scribd
Upload
18 views

Description of The Bisection Method

The bisection method is used to find the root of a function within a given interval. It works by repeatedly bisecting the interval and narrowing in on the root. At each step, the function is evaluated at the midpoint of the current interval. Based on whether the function values at the endpoints have the same or opposite signs, one of the halves is selected for the next interval. The method is guaranteed to converge to the root as the size of the interval decreases by half in each step.

Uploaded by

Dl Al-aziz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

Description of The Bisection Method

The bisection method is used to find the root of a function within a given interval. It works by repeatedly bisecting the interval and narrowing in on the root. At each step, the function is evaluated at the midpoint of the current interval. Based on whether the function values at the endpoints have the same or opposite signs, one of the halves is selected for the next interval. The method is guaranteed to converge to the root as the size of the interval decreases by half in each step.

Uploaded by

Dl Al-aziz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Description of the bisection method

The bisection method generates a sequence of intervals where

. and

To guarantee the convergence of the method, you choose whose contains a

unique zero of and such that is continuous on . In fact, the iteration


.procedure is carried out in bisection method

The function is evaluated at the mid-point of the interval

.which means is calculated

:Three cases may arise

. i) then is the required zero of

ii) f(b) * f(c) > 0 : if the product of f(b) and f(c) is positive, the root lies in the interval
a k 1
[a, c]
iii) f(b) * f(c) < 0: if the product of f(b) and f(c) is negative, the root lies in the
interval[c,b]

:The next subinterval is determined as follow

:This condition can be written as follow

The fundamental information in each step or iteration is the sign of at the ends and
the mid-point of the present subinterval. The “half” interval chosen contain the zero of

because has different signs at its ends then the root of lies in this subinterval.
For every iteration, we verify that otherwise will be the

. required root of the equation

Convergence of the bisection method

The sequence of subintervals involve two sequences and .

Depending of the signs of , and , we have or

. Then which means

You might also like