Walter F Mora , Jos Luis Espinoza B

Software: Bisection Bisection This is one of the most simple and easy intuition to solve equations in one variable. It is based on the intermediate value theorem (TVI), which states that every continuous

function

on a closed interval

takes all the values that lie between and

and

. That is, any value between the range . Where and

is the image of at least one value in ), , So there is

have opposite signs ( and

The value zero would be an intermediate value between certainly in meets .

. In this way, ensures the existence of at least one

solution of the equation

The method is as follows: In advance we must ensure the continuity of the function in the interval midpoint interval . Then we verify that . Then calculate . Where . We calculate the is zero, we have or

found the desired root. Where it is not, check whether

has opposite sign

. It redefines the interval as or as determined in which of these intervals there is a change of sign. With this new interval enclosing the solution continues on a shrinking interval to reach the desired accuracy. The following figure illustrates the procedure.

In the first iteration of the bisection algorithm, it is clear that the root less than or equal to

is at a distance

, Then surely the root is in either of the two size ranges . In the second iteration, the is ,

, Adjacent to the midpoint of the interval new interval measured less than or equal to and approximate with

and again the distance between the midpoint and again . And form three sequences of values

And can easily be shown by induction that the n-th iteration, the must be

Thus, if we estimate the number of iterations to ensure that, when approximating the solution of the equation by the midpoint, the approximation error is less than a parameter , The above inequality must be concluded that at least iterations. .1

For example, the bisection algorithm applied to a function If we want the approximation error is less The number of iterations must meet than

in the interval or equal to

so they must be at least 16 iterations.

Bisection Algorithm:

Input: A continuous function

defined on an interval

With

and opposite signs. Parameters: = Maximum number of iterations. = Level of clarification as to the exact solution. . Initiation . Define . While . Define . If .
Output: m

. Stop . If . redefine . Otherwise, redefine .

Increase .

.
iterations. "

Output: "The method failed after

. Stop. Table of Contents