This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 COMPUTER SCIENCE 349A Handout Number 8 THE BISECTION METHOD (Section 5.2: pp. 116123 5 th ed; pp. 124131 6 th ed)  can be used to compute a zero of any function ) ( x f that is continuous on an interval ] , [ u x x l for which ) ( ) ( < × u x f x f l . Consider u x x and l as two initial approximations to a zero, say t x , of ) ( x f . The new approximation is the midpoint of the interval ] , [ u x x l , which is 2 u r x x x + = l . If ) ( = r x f , then r x is the desired zero of ) ( x f . Otherwise, a new interval ] , [ u x x l that is half the length of the previous interval is determined as follows. If ) ( ) ( < × r x f x f l then ] , [ r x x l contains a zero, so set r u x x ← . Otherwise, ) ( ) ( < × r u x f x f (necessarily) and ] , [ u r x x contains a zero, so set r x x ← l . The above procedure is repeated, continually halving the interval ] , [ u x x l , until ] , [ u x x l is sufficiently small, at which time the midpoint 2 u r x x x + = l will be arbitrarily close to a zero of...
View
Full
Document
This note was uploaded on 12/10/2011 for the course CSC 349 taught by Professor Oadje during the Spring '11 term at University of Victoria.
 Spring '11
 Oadje
 Computer Science

Click to edit the document details