Question: For Questions show the code solution for just the bisection method for question 1.a) and for the bisection method please include comments explaining the code

For Questions show the code solution for just the bisection method for question 1.a) and for the bisection method please include comments explaining the code and providing detail to it that explains what is do what and what does this variable represents, etc. Please show the steps clearly for the Bisection method.

For Questions show the code solution for just the bisection method for

question 1.a) and for the bisection method please include comments explaining the

Question 1. Bracketing Methods For this problem you are required to build MATLAB functions for the bisection method and false position method to approximate a root r satisfying f(r)=0 for a given function f. Design these MATLAB functions to take as input a real-valued function " f ", initial lower and upper bounds for the root " a " and " b ", and a desired upper bound "err" on the absolute error of the final root approximation. Your algorithms should iterate until the absolute error cnr of the final root approximation cn is less than the input error bound err. 1 (a) Suppose that a skydiver jumps from a plane, and prior to deploying a parachute their velocity after t seconds is modeled by the function v=cdgm(1e(cd/m)t), where g9.81m/s2 is the constant acceleration due to gravity near the surface of the earth, m is the mass of the skydiver (in kg ), and cd is a drag coefficient (in kg/s) 2. If the skydiver has a mass of m=80kg and reaches a velocity of v=50m/s in approximately t=10 seconds [, what is the drag coefficient cd ? Solve this problem using your bisection method code AND your false position code, and ensure that your approximation of cd has an absolute error less than 104 (for this error bound assume that all parameter values mentioned above are exactly correct). 1 Although your bisection code does not need to solve for the number of iterations n required to achieve an absolute error less than err in advance of the main loop, perhaps the "slickest" approach does solve the problem this way, and it does this without ustng a loop to solve for n. You are encouraged to implement this strategy, but it is not strictly required. Furthermore, if you choose not to solve for n in advance of the main loop for the bisection method, you should still be cognizant of additional information available when bounding the absolute error in the bisection method compared to the false position method. 2 For those interested: cd is a proportionality constant relating the velocity in freefall to the upward force due to air resistance. 3 These are reasonable values! 4 To be clear, we don't typically know r when root flnding, but this modifled code will be used for algorithm analysis

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!