| Line 43... |
Line 43... |
| 43 |
than \eqn{\epsilon}{eps *}\eqn{ |x_0| + (tol/3)}, where
|
43 |
than \eqn{\epsilon}{eps *}\eqn{ |x_0| + (tol/3)}, where
|
| 44 |
\eqn{\epsilon}{eps} is approximately \code{sqrt(\link{.Machine}$double.eps)}
|
44 |
\eqn{\epsilon}{eps} is approximately \code{sqrt(\link{.Machine}$double.eps)}
|
| 45 |
and \eqn{x_0} is the final abscissa \code{optimize()$minimum}.\cr
|
45 |
and \eqn{x_0} is the final abscissa \code{optimize()$minimum}.\cr
|
| 46 |
If \code{f} is a unimodal function and the computed values of \code{f}
|
46 |
If \code{f} is a unimodal function and the computed values of \code{f}
|
| 47 |
are always unimodal when separated by at least \eqn{\epsilon}{eps *}
|
47 |
are always unimodal when separated by at least \eqn{\epsilon}{eps *}
|
| 48 |
\eqn{ |x| + (tol/3)}, then \eqn{x_0} approximates the abcissa of the
|
48 |
\eqn{ |x| + (tol/3)}, then \eqn{x_0} approximates the abscissa of the
|
| 49 |
global minimum of \code{f} on the interval \code{lower,upper} with an
|
49 |
global minimum of \code{f} on the interval \code{lower,upper} with an
|
| 50 |
error less than \eqn{\epsilon}{eps *}\eqn{ |x_0|+ tol}.\cr
|
50 |
error less than \eqn{\epsilon}{eps *}\eqn{ |x_0|+ tol}.\cr
|
| 51 |
If \code{f} is not unimodal, then \code{optimize()} may approximate a
|
51 |
If \code{f} is not unimodal, then \code{optimize()} may approximate a
|
| 52 |
local, but perhaps non-global, minimum to the same accuracy.
|
52 |
local, but perhaps non-global, minimum to the same accuracy.
|
| 53 |
|
53 |
|