Create programs (remember to hand in a hard copy of your code) for the Bisection
ID: 2968307 • Letter: C
Question
Create programs (remember to hand in a hard copy of your code) for the Bisection, Secant, and Newton's methods to find the root of , where
a. Use the bisection method with and as starting values. Give the first four iterates showing the intervals, , and the function value at the midpoint, .
, ,
, ,
, ,
, ,
Continue the iteration until the solution is accurate to a tolerance of
The number of iterations is
The approximate root is
b. Use the secant method with and as starting values. Give the first four iterates showing the updated value of the root, , and the function value at this point, .
,
,
,
,
Continue the iteration until the solution is accurate to a tolerance of
The number of iterations is
The approximate root is
c. Use Newton's method with as a starting value. Give the first four iterates showing the updated value of the root, , and the function value at this point, .
,
,
,
,
Continue the iteration until the solution is accurate to a tolerance of
The number of iterations is
The approximate root is
Explanation / Answer
1) secant
conitue
45 1.88815405096463281 1.8881540509646 -6.5904E-14 46 1.8881540509646456 1.8881540509646 -1.3074E-14 47 1.88815405096465199 1.88815405096465 1.3338E-14 48 1.88815405096464879 1.88815405096465 1.38E-16 49 1.88815405096464719 1.88815405096465 -6.472E-15
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.