
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An overview of the bisection method, an iterative numerical technique used to find the roots of a function. The method requires two initial guesses, one to the left and one to the right of the root, and will fail if these guesses do not bracket the root. The algorithm is presented step by step, along with conditions for determining the location of the root and convergence criteria.
Typology: Study notes
1 / 1
This page cannot be seen from the preview
Don't miss anything!

D. Haugli, Lecturer Aer E 161 Aerospace Engineering 2/11/2005 The Bisection Method, Page 1 Iowa State University
The Bisection Method
The bisection method is an iterative numerical method for finding the root(s) of a function. The method is called a “bracketing method” because it requires two initial guesses, one to the left and one to the right of the desired root. The method will fail if these guesses do not bracket the root. A quick plot of the function should reveal the location of the root and guarantee appropriate guesses.
The algorithm is:
Make initial guesses for xl and xr (where the subscripts l and r indicate to the left and right of the root, respectively).
Average these guesses to approximate the root, x 0 :
(^02) x = xl^ + x^ r (1)
For the next iteration, set x (^) r = x 0 and return to Step (2).
For the next iteration, set x (^) l = x 0 and return to Step (2).
Repeat Steps (2) and (3) until Condition (3c) is satisfied.
In practice, round-off errors make Condition (3c) difficult to evaluate because a real number is unlikely to exactly equal zero on the computer. Instead, a convergence criterion can be applied.
When the bisection method is converging, the estimate of the root for the next iteration, x (^) 0 n^ +^1 ,
should be closer to the true value of the root than the estimate from the current iteration, x 0 n. (The
superscripts represent iterations, not powers.) This observance leads to the idea of an approximate error, as discussed in the document, “Error Definitions” on the Aer E 161 website.
To control the number of digits after the decimal, use an absolute convergence criterion,
a
n n a =^ x^ − x < C
0
1 0
where Ca is smaller than the desired number of digits. To control the relative or percent error,
document).