derivatives, and fall back to __bisect in this case. However, it is helpful
if functor F is defined to return an arbitrarily small value ['of the correct sign] rather
than zero.
+* The functions will raise an __evaluation_error if arguments `min` and `max` are the wrong way around
+or if they converge to a local minima.
* If the derivative at the current best guess for the result is infinite (or
very close to being infinite) then these functions may terminate prematurely.
A large first derivative leads to a very small next step, triggering the termination
[equation roots1]
-Out of bounds steps revert to __bisection of the current bounds.
+Out-of-bounds steps revert to __bisection of the current bounds.
Under ideal conditions, the number of correct digits doubles with each iteration.