Scribd
Upload
15 views

Bisection Method

The bi section method is an algorithm for finding the root of a continuous function between two points where the function values have opposite signs. It works by repeatedly bisecting the interval and determining if the midpoint value is positive or negative, narrowing in on the root by half the interval length each iteration until a small enough interval is found.

Uploaded by

o
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views

Bisection Method

The bi section method is an algorithm for finding the root of a continuous function between two points where the function values have opposite signs. It works by repeatedly bisecting the interval and determining if the midpoint value is positive or negative, narrowing in on the root by half the interval length each iteration until a small enough interval is found.

Uploaded by

o
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Bi Section Method

Let f(x) is continuous between a and b.


Let f(a) < 0
f(b) > 0
a<x<b
last iteration
let, x1 =(a+b)/2
if f(a+b)/2 < 0
(a+b)/2 < x < f(b)
Then x2 = ½ (x1 +b)

If f(a+b)/2) < 0
Then a < x < (a+b)/2 then x2 = ½ (a+x1)
In this way continuous the iteration.

You might also like