Improve the accuracy in Exer. 7.36. know is that the true extreme point is in the interval (x i−1 , x i+1 ). A more accurate algorithm may take this interval as a starting point and run a Bisection...

Improve the accuracy in Exer. 7.36.

know is that the true extreme point is in the interval (x_i−1, x_i+1). A more accurate algorithm may take this interval as a starting point and run a Bisection method (see Chapter 4.6.2) to find the extreme point x¯ such that f ′ (¯x) = 0. In class MinMax, add a method _refine_extrema, which goes through all the interior local minima and maxima and solves f ′ (¯x) = 0. Compute f ′ (x) using the Derivative class (Chapter 7.3.2 with h ≪ x_i+1
− x_i−1. Name of program file: minmaxf2.py.