Scribd
Upload
8 views2 pages

Bisection Method for Root Finding

The Bisection Method is a simple iterative technique for finding roots of continuous functions by narrowing down an interval where a root exists. The method involves choosing two initial values, evaluating their midpoint, and iteratively refining the interval based on the sign of the function at the midpoint. The convergence order of the Bisection Method is linear, with the error halving at each iteration.

Translated by

ScribdTranslations
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
8 views2 pages

Bisection Method for Root Finding

The Bisection Method is a simple iterative technique for finding roots of continuous functions by narrowing down an interval where a root exists. The method involves choosing two initial values, evaluating their midpoint, and iteratively refining the interval based on the sign of the function at the midpoint. The convergence order of the Bisection Method is linear, with the error halving at each iteration.

Translated by

ScribdTranslations
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

2.4.

Bisection Method (or Bolzano, or Dichotomy):


It is one of the simplest iterative methods and is strongly based on the property of intervals.
To find a root using this method, let ( ) between
a continuous function and . By
definition, namely( ) negative and( ) positive, so there is a root (= )0, between and . and let it be

the first approximation: = (i.e. the average of the extremes). If ) zeroso


( equals is a

root of ( =)0Otherwise, the root is located between and or between and depending on whether
( ) is
positive or negative.

2.4.1 Bisection method algorithm for finding zeros of = (: )


Step 1: Choose two initial values (approximation) a and b (or < such as:
( )( ∙ ) < 0;

Step 2: midpoint evaluation of and : = and also evaluate ( ) ;

Step 3: if ( ∙ )( ) < 0so ask = , otherwise = and apply the formula from step 2;
Step 4: stop the evaluation of the difference between two successive values of obtained from step 2
is numerically less than the prescribed precision.

2.4.2 Convergence order of the Bisection method:


Here, the initial interval is divided into half-intervals at each iteration. If we take the points from the
the midpoint of successive intervals as being the approximations of the root, half of
The current interval is the upper limit of the error.
In the Bisection method: = 0.5 or = 0.5

By comparing with the convergence formula.

lim ≤ On a = 1 and = 0,5 the Bisection method is convergent of order1


→

(linearly convergent).
Example:
Find the root of the equation: − x − 1 = 0located between 1 and 2 by the Bisection method.

Solution:
1=( 1) - 1 - 1 = -1 < 0
⇒ABCDEFGHIJK1L2
2=( 2) -2 - 1 = 5 > 0
Initial interval Interpolated root Evaluation of Final interval
[["1","2"]
] 1+2 ( )
1.50.875 [1; 1.5 ]
= = 1.5
2
[1; 1.5 ] = 1.25 (
1.25= )
-0.297 [1,25; 1,5 ]
[1,25; 1,5 ] 1.375 ( )
1,3750.2246 [1,313; 1,375 ]
[1,313; 1,375 ] = 1,313 (
1,313= )
−0,0494 [1,313; 1,344 ]
[1,313; 1,344 ] = 1,344 0.0837 [1,313; 1,329 ]
[1,313; 1,329 ] 1,329 0.0183 [1,313; 1,329 ]
[1,313; 1,329 ] = 1,321 -0.0158 [1,321; 1,329 ]
[1,321; 1,329 ] = 1,325 0.0012 -

| − | 1,329-
| | ≤
1,321 = 0.008 = 10

You might also like