(univariate real) root-finding
algorithms that maintain a bracketed solution. There are several advantages
to having such root-finding algorithms:
allowed solutions. Other root-finding
algorithms can usually only guarantee that the solution (the root that
was found) is around the actual root.For backwards compatibility, all root-finding algorithms must have
ANY_SIDE as default for the allowed
solutions.
AllowedSolution
| Modifier and Type | Method and Description |
|---|---|
| public double | Returns: A value where the function is zero.Maximum number of evaluations. maxEval, FUNC Function to solve. f, double Lower bound for the interval. min, double Upper bound for the interval. max, AllowedSolution The kind of solutions that the root-finding algorithm may
accept as solutions. allowedSolution)Solve for a zero in the given interval. |
| public double | Returns: A value where the function is zero.Maximum number of evaluations. maxEval, FUNC Function to solve. f, double Lower bound for the interval. min, double Upper bound for the interval. max, double Start value to use. startValue, AllowedSolution The kind of solutions that the root-finding algorithm may
accept as solutions. allowedSolution)Solve for a zero in the given interval, start at |
| solve | back to summary |
|---|---|
| public double solve(int maxEval, FUNC f, double min, double max, AllowedSolution allowedSolution) Solve for a zero in the given interval. A solver may require that the interval brackets a single zero root. Solvers that do require bracketing should be able to handle the case where one of the endpoints is itself a root.
| |
| solve | back to summary |
|---|---|
| public double solve(int maxEval, FUNC f, double min, double max, double startValue, AllowedSolution allowedSolution) Solve for a zero in the given interval, start at
| |