n | Cn | Rel. error |
To interpret geometrically the approximations of a root constructed by means of the algorithm. To analyze the convergence according to the information of entry.
Graphical representation of the f(x) and the different approaches that are being obtained.
Graphical representation of the segments required for the construction of the algorithm.
Results table and final relative error.
Change the maximum error or the maximum number of steps to see how the approximation improves.
Change the interval by moving the points a and b. What if in the range there are no root? What if there are more than one?Is there any difference if the number of roots is even or odd?
Test the function cos (x), change the interval and observe the behavior of the algorithm.