Write a MatLab function for to implement EACH of the following 3 algorithms for solving equation f(x) = 0: (i) bisection method; (ii) Newton's Method: (iii) Secant Method; use your codes to solve the following equation: f(x) = e^cos(x) + x^3 - 1.
(a) The stopping criterion for the iteration is EITHER the number of iterations reaches 50 OR the relative change od approximate solution is <= 10^-10
(b): For each solution method, print out every step of the following information: (i) current number of steps n; (ii) curretn approximate aolution x_n; (iii) currnet function value f(x_n); (iv) current error err(n)=|x_n - x_star|; where x_star is the roots found with fzero.
(c) For each solution method, make a plot of the error history err(n) vs. n in log scale by using matlab command semilogy.
Thank you and I always have a problem with this class as far as the book but have gotten that straight and I do appreciate what you do. Thank you
You guys have provided me the best Technical Writing service. And that is in such a short time. Thank you so much.
Everything was amazing. I loved it because references used Perfect. I will continue working with you. Thanks