The bisection method will converge to the solution after three iterations.
It should be noted that after one iteration, x1 will be:
= (1 + 9)/2
= 10/2
= 5
Since f(x¹) > 0, x² will then replace x1. Now x0 = 1 and x1 = 5.
After the second iteration, x2 will be:
= (1 + 5)/2
= 3
Also, this is greater than 0. The third iteration will be:
m= (1 + 3)/2
= 2.
Now, f(2) = 2⁴ -2³ - 2² - 4
= 0
Therefore, the method converges exactly to the root in 3 iterations.
Complete question:
The bisection method is applied to compute the zero to a function f(x) = x⁴ - x³ - x² - 4 in the interval (1, 9). The method converges y a solution after .............. iterations.
Learn more about bisection method on:
brainly.com/question/13424227
#SPJ1
