Question: Approximate the Optimal Trust T ( in kN ) by iterating on the root of f ( T ) using the three methods below. You

Approximate the Optimal Trust T (in kN) by iterating on the root of f(T) using the three methods
below. You picked the initial brackets / guess(es) below based only on knowledge that these kits
tend to sell for somewhere around 20 kN.
Do two iterations for each method, accurate to at least 4 decimals (yes, I know thats a fraction of a
penny, but go with it).By-hand still means you should use your calculator for all the hard
arithmetic (multiplying and dividing), but I want to see all your steps: write out the formulae you
are using and key values as you iterate so I can confirm youre doing the process correctly.
(i) Bisection: start with the bracket a =0.50, b =40 and calculate the midpoints T1 and T2,
clearly justifying (based on the signs of f(T)) how the as and/or bs are changing
after both iterations.
(ii) Secant: start with T1=0.5 and T2=40. Calculate T3 and T4.
(iii) N-R: start with T1=20. Calculate T2 and T3.

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 Programming Questions!