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 fT using the three methods
below. You picked the initial brackets guesses below based only on knowledge that these kits
tend to sell for somewhere around kN
Do two iterations for each method, accurate to at least decimals yes I know thats a fraction of a
penny, but go with itByhand 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 b and calculate the midpoints T and T
clearly justifying based on the signs of fT how the as andor bs are changing
after both iterations.
ii Secant: start with T and T Calculate T and T
iii NR: start with T Calculate T and T
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
