Scribd
Upload
83 views

Bisection Method Interval Halving

The Bisection Method is an algorithm for finding zeros of a nonlinear function that works by repeatedly bisecting an interval known to contain a zero and narrowing in on the solution. It requires an initial interval where the function values at the endpoints have opposite signs, allowing it to systematically reduce the interval size until the desired accuracy is reached.

Uploaded by

Luis Pasicolan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
83 views

Bisection Method Interval Halving

The Bisection Method is an algorithm for finding zeros of a nonlinear function that works by repeatedly bisecting an interval known to contain a zero and narrowing in on the solution. It requires an initial interval where the function values at the endpoints have opposite signs, allowing it to systematically reduce the interval size until the desired accuracy is reached.

Uploaded by

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

Bisection Method

 The Bisection method is one of the simplest


methods to find a zero of a nonlinear function.
 It is also called interval halving method.
 To use the Bisection method, one needs an initial
interval that is known to contain a zero of the
function.
 The method systematically reduces the interval.
It does this by dividing the interval into two equal
parts, performs a simple test and based on the
result of the test, half of the interval is thrown
away.
 The procedure is repeated until the desired
interval size is obtained.
1
Intermediate Value Theorem

Let f (x) be a continuous function f(a)


in the interval [a,b].
If f (a) and f (b) have different
signs, that is, f (a)∙f (b) < 0,
a b
then the function has at least
one zero in [a,b]. f(b)

2
Notes
 If f (a) and f (b) have the same
sign, the function may have an
even number of real zeros or
no real zeros in [a, b]. a b

 Bisection method can not be


used in these cases. The function has four real zeros

a b
The function has no real zeros

3
Notes
 If f (a) and f (b) have
different signs, then the
function has at least one
a b
real zero.
The function has one real zero
 Bisection method can be
used to find one of the
zeros. a b

The function has three real zeros

4
Bisection Method
 If the function is continuous on [a,b] and f (a) and
f (b) have different signs, then bisection method
obtains a new interval that is half of the current
interval and the sign of the function at the end points
of the interval are different.

 This allows us to repeat the bisection procedure to


further reduce the size of the interval.

5
Bisection Algorithm
1. Let a and b be such that f(a)∙f(b) < 0.
ab
2. Compute the midpoint c 
2 f (a)
3. Evaluate f (c)

4. If f (a)∙ f (c) < 0, then b = c, new interval is [a, c]


c b
a
If f (a)∙ f (c) > 0, then a = c, new interval is [c, b]
f (b)
5. If more accuracy is required, go back to step 2
ab
6. Take the approximate solution
2

6
Stopping Criteria
Two common stopping criteria

1. Stop after a fixed number of iterations


2. Stop when the desired accuracy is less
than a specified value

7
Example
Can you use Bisection method to find a zero of
f ( x)  x 2  3 in the interval [0,1]?

Answer:
f ( x) is continuous on [0,1]
and f (0)  f (2)  (-3)(-2)  6  0
 Assumptions are not satisfied
 Bisection method can not be used

8
Example
Can you use Bisection method to find a zero of
f ( x)  x 2  3 in the interval [1,2]?

Answer:
f ( x) is continuous on [1,2]
and f (1)  f (2)  (-2)(1)  2  0
 Assumptions are satisfied
 Bisection method can be used

9
Find the root of f ( x)  x  3 in the interval [1,2]
2

Stop until the desired accuracy is less than 0.01.

10
Find the root of f ( x)  x  3 in the interval [1,2]
2

Stop until the desired accuracy is less than 0.01.

11
Find the root of f ( x)  x  3 in the interval [1,2]
2

Stop until the desired accuracy is less than 0.01.

12
Find the root of f ( x)  x  3 in the interval [1,2]
2

Stop until the desired accuracy is less than 0.01.

13
Find the root of f ( x)  x  3 in the interval [1,2]
2

Stop until the desired accuracy is less than 0.01.

14
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

15
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

16
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

17
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

18
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

19
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

20
Solve e x  3.2sin x  0.5cos x   0 in the interval [3,4]
Stop until the desired accuracy is less than 0.001.

21

You might also like