This preview shows page 1. Sign up to view the full content.
Unformatted text preview: p = 4. For the Secant Method, use p = 6 and p 1 = 4. (c) What is your best estimate for p , the location of the maximum? (d) Compare the three algorithms using the following two tables. Table 1: Approximation p n versus iteration number n Iteration n Bisection Secant Newton Table 2: Absolute error  p np  versus iteration number n Iteration n Bisection Secant Newton (e) What happens if you attempt to approximate the maximum by starting Newtons Method with p = 6 ? (2) (Newton versus Secant) Bradie, p. 113, #12. 1...
View
Full
Document
This note was uploaded on 12/16/2011 for the course MATH 371 taught by Professor Krasny during the Fall '08 term at University of Michigan.
 Fall '08
 KRASNY
 Math

Click to edit the document details