The bisection algorithm is a minimax procedure for locating a fixed point of a continuous function taking an interval into itself. The algorithm can also be viewed as dissecting a 1-simplex (interval) ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback