Unformatted text preview: -10 ? (start with p = 1) (d) How many iterations are needed with the modiﬁed version of Newton’s method that we have seen in problem 1.? 3. Textbook: Problem 15 page 27 (a), (b) and (c) 4. Complete the following sentences: The distance between the number from 15.a) and the next largest machine number is 2-m where m = The distance between the number from 15.c) and the next largest machine number is 2-m where m = Show your reasoning (no hand-waving argument, be clear). 1...
View Full Document
- Spring '10
- Object-Oriented Programming, Newton’s method, Modified Version, largest machine number