Class Bisection

source code

            object --+        
                     |        
   bases.BaseAlgorithm --+    
                         |    
   bases.ExplicitAlgorithm --+
                             |
                object --+   |
                         |   |
  bases.IterativeAlgorithm --+
                             |
                object --+   |
                         |   |
bases.InformationAlgorithm --+
                             |
                            Bisection

Finds a root of the function assumed to be on the line between two
points.

Assumes a function f(x) such that |f(x)|_2 < -eps if x is too small,
|f(x)|_2 > eps if x is too large and |f(x)|_2 <= eps if x is just right.

Parameters
----------
force_negative : Boolean. Default is False. Will try, by running more
        iterations, to make the result negative. It may fail, but that is
        unlikely.

eps : Positive float. A value such that |f(x)|_2 <= eps. Only guaranteed
        if |f(x)|_2 <= eps in less than max_iter iterations.

info : List or tuple of utils.Info. What, if any, extra run
        information should be stored. Default is an empty list, which means
        that no run information is computed nor returned.

max_iter : Non-negative integer. Maximum allowed number of iterations.

min_iter : Non-negative integer less than or equal to max_iter. Minimum
        number of iterations that must be performed. Default is 1.

Parameters
----------
function : Function. The function for which a root is found.

x : A vector or tuple with two elements. The first element is the lower
        end of the interval for which |f(x[0])|_2 < -eps. The second
        element is the upper end of the interfal for which
        |f(x[1])|_2 > eps. If x is None, these values are found
        automatically. Finding them may be slow, though, if the
        function is expensive to evaluate.