hw7_cmf00

# hw7_cmf00 - CGN 3421 Computer Methods H.W#7 due-10/20 Goal...

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

CGN 3421 hw7_cms00.fm page 1 of 2 10/14/00 CGN 3421 Computer Methods H.W. #7 due-10/20 Goal: Write three root finding functions: Method #1 Modified version of Incremental Search which identifies the number of zero crossings in a range. This algorithm will make a single pass with a user specified number of sub-ranges. If a sub-range has a root within, the function will increment the number of roots by one, and save the limits of each sub-range found. input = (function, initial range, number of bins) output = (number of roots found, a vector of lower limits, a vector of upper limits) For example, if the initial range is from 0 to 10, and 10 sub-ranges are used, the algorithm will look from 0-1, 1-2, 2-3, . .., 9-10. If a root exists in 3 sub-ranges, say # 2, 4, and 8, then the algorithm will return the number 3, and the array of sub-range limits . Method #2 False position method to identify a single root in a given range. input = (function, initial range) output = (2-D array of sub-range limits, estimation error, and number of iterations required to find estimate).

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/10/2011 for the course CGN 3421 taught by Professor Long during the Spring '08 term at University of Florida.

### Page1 / 2

hw7_cmf00 - CGN 3421 Computer Methods H.W#7 due-10/20 Goal...

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

View Full Document
Ask a homework question - tutors are online