uniroot(f, interval, lower = min(interval), upper = max(interval),
tol = .Machine$double.eps^0.25, ...)
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.
|
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.
root and f.root which give the
location of the root and the value of the function evaluated at that
point.polyroot for all complex roots of a polynomial;
optimize, nlm.f <- function (x,a) x - a xmin <- uniroot(f, c(0, 1), tol = 0.0001, a = 1/3) xmin