

   OOnnee DDiimmeennssiioonnaall RRoooott FFiinnddiinngg

        uniroot(f, interval, lower = min(interval), upper = max(interval),
                tol = .Machine$double.eps^0.25, ...)

   AArrgguummeennttss::

          f: the function for which the root is sought.

   interval: a vector containing the end-points of the interval
             to be searched for the root.

      lower: the lower end point of the interval to be
             searched.

      upper: the upper end point of the interval to be
             searched.

        tol: the desired accuracy.

        ...: additional arguments to `f'.

   DDeessccrriippttiioonn::

        The function `optimize' searches the interval from
        `lower' to `upper' for a zero of the function `f' with
        respect to its first argument.

        The function uses Fortran code (from Netlib) based on
        algorithms given in the reference below.

   VVaalluuee::

        A list with components `root' and `f.root' which give
        the location of the root and the value of the function
        evaluated at that point.

   RReeffeerreenncceess::

        Brent, R. (1973).  Algorithms for Minimization without
        Derivatives.  Englewood Cliffs, NJ: Prentice-Hall.

   SSeeee AAllssoo::

        `polyroot' for all complex roots of a polynomial;
        `optimize', `nlm'.

   EExxaammpplleess::

        f <- function (x,a) x - a
        xmin <- uniroot(f, c(0, 1), tol = 0.0001, a = 1/3)
        xmin

