The bracketed solution guarantees that the root is kept within the
interval. As such, these algorithms generally also guarantee
convergence.

The bracketed solution means that we have the opportunity to only
return roots that are greater than or equal to the actual root, or
are less than or equal to the actual root. That is, we can control
whether under-approximations and over-approximations are
allowed solutions. Other root-finding
algorithms can usually only guarantee that the solution (the root that
was found) is around the actual root.

For backwards compatibility, all root-finding algorithms must have
ANY_SIDE as default for the allowed
solutions.

solve

Solve for a zero in the given interval.
A solver may require that the interval brackets a single zero root.
Solvers that do require bracketing should be able to handle the case
where one of the endpoints is itself a root.

Parameters:

maxEval - Maximum number of evaluations.

f - Function to solve.

min - Lower bound for the interval.

max - Upper bound for the interval.

allowedSolution - The kind of solutions that the root-finding algorithm may
accept as solutions.

solve

Solve for a zero in the given interval, start at startValue.
A solver may require that the interval brackets a single zero root.
Solvers that do require bracketing should be able to handle the case
where one of the endpoints is itself a root.

Parameters:

maxEval - Maximum number of evaluations.

f - Function to solve.

min - Lower bound for the interval.

max - Upper bound for the interval.

startValue - Start value to use.

allowedSolution - The kind of solutions that the root-finding algorithm may
accept as solutions.