Mathematics - Numerical Methods - Root finding algorithms - Apply Root Finding

8 problems: (1-2) Bisection: find root of x³-x-1=0 in [1,2] to 2 iterations. Find root of cos(x)-x=0 in [0,1] to 3 iterations. (3-4) Newton's method: f(x)=x²-3, x₀=2. Compute x₁, x₂, x₃. Compare to √3. f(x)=eˣ-3, x₀=1. (5) 'How many bisection steps to get error < 0.001 starting from [0,4]?' (6) 'New