Bisection

Bisection - 6.3 Finding Roots 1 6.3 Finding Roots Problem...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
6.3. Finding Roots 1 6.3 Finding Roots Problem Compute the all the roots of the function T ( x ) = 512 x 10 1280 x 8 + 1120 x 6 400 x 4 +50 x 2 1 that are in the inteval [0 , 1]. The roots should be accurate through six decimals. Program Development Let’s see what T looks like across the interval on interest: 0 0.2 0.4 0.6 0.8 1 -1 -0.8 -0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8 1 512x 10 - 1280x 8 + 1120x 6 - 400x 4 + 50x 2 -1 We observe that there are f ve zeros in [0,1]. Our plan is to systematically use the method of bisection to f nd these roots. Bisection exploits the following fact: If a continuous function f changes sign on the interval [ a, b ] ,then f must have a root somewhere in [ a, b ] . If f ( a ) f ( b ) 0, then we say that [ a, b ]i sa bracketing interval . I ti sea sytoseewhya bracketing interval contains a root: you cannot graph the function from ( a, f ( a )) to ( b, f ( b ))
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/15/2008 for the course CS 100 taught by Professor Fan/vanloan during the Fall '07 term at Cornell.

Page1 / 3

Bisection - 6.3 Finding Roots 1 6.3 Finding Roots Problem...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online