Required input values are:
- An expression in one
variable
- An interval in which a root is known
to exist (enter the left and right endpoints
below).
- A given accuracy eps (an iterative
solver is used; if the value at stage n+1 differs from the
value at stage n by less than eps, the algorithm
stops)
- A positive integer n that gives an
upper bound for the number of iterations
|
 |
If you do not know upper and lower values
bracketing a root,
- enter the expression and a left
endpoint.
- Do not enter a right endpoint,
but enter an increment incr (in the indicated field)
and a positive integer steps in the indicated
field.
- Then submit the form (a table of
values giving f(x0+i * incr) for i =
0,...,steps will be returned).
By experimenting this way, you may find a
pair of values where the sign of f changes. You may then use
these values for the left and right endpoints.
|