static double[] |
UnivariateSolverUtils.bracket(UnivariateFunction function,
double initial,
double lowerBound,
double upperBound) |
|
static double[] |
UnivariateSolverUtils.bracket(UnivariateFunction function,
double initial,
double lowerBound,
double upperBound,
double q,
double r,
int maximumIterations) |
This method attempts to find two values a and b satisfying
lowerBound <= a < initial < b <= upperBound
f(a) * f(b) <= 0
If f is continuous on [a,b], this means that a
and b bracket a root of f.
|
static double[] |
UnivariateSolverUtils.bracket(UnivariateFunction function,
double initial,
double lowerBound,
double upperBound,
int maximumIterations) |
|
protected abstract double |
BaseAbstractUnivariateSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
BracketingNthOrderBrentSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
BrentSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
double |
LaguerreSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
MullerSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
MullerSolver2.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
RiddersSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
SecantSolver.doSolve() |
Method for implementing actual optimization algorithms in derived
classes.
|
static double |
UnivariateSolverUtils.forceSide(int maxEval,
UnivariateFunction f,
BracketedUnivariateSolver<UnivariateFunction> bracketing,
double baseRoot,
double min,
double max,
AllowedSolution allowedSolution) |
Force a root found by a non-bracketing solver to lie on a specified side,
as if the solver were a bracketing one.
|
double |
BaseAbstractUnivariateSolver.solve(int maxEval,
FUNC f,
double startValue) |
Solve for a zero in the vicinity of startValue.
|
double |
BaseAbstractUnivariateSolver.solve(int maxEval,
FUNC f,
double min,
double max,
double startValue) |
Solve for a zero in the given interval, start at startValue.
|
double |
BracketingNthOrderBrentSolver.solve(int maxEval,
UnivariateFunction f,
double min,
double max,
double startValue,
AllowedSolution allowedSolution) |
Solve for a zero in the given interval, start at startValue.
|
double |
BracketingNthOrderBrentSolver.solve(int maxEval,
UnivariateFunction f,
double min,
double max,
AllowedSolution allowedSolution) |
Solve for a zero in the given interval.
|
T |
FieldBracketingNthOrderBrentSolver.solve(int maxEval,
RealFieldUnivariateFunction<T> f,
T min,
T max,
AllowedSolution allowedSolution) |
Solve for a zero in the given interval.
|
T |
FieldBracketingNthOrderBrentSolver.solve(int maxEval,
RealFieldUnivariateFunction<T> f,
T min,
T max,
T startValue,
AllowedSolution allowedSolution) |
Solve for a zero in the given interval, start at startValue.
|
static double |
UnivariateSolverUtils.solve(UnivariateFunction function,
double x0,
double x1) |
Convenience method to find a zero of a univariate real function.
|
static double |
UnivariateSolverUtils.solve(UnivariateFunction function,
double x0,
double x1,
double absoluteAccuracy) |
Convenience method to find a zero of a univariate real function.
|
protected void |
BaseAbstractUnivariateSolver.verifyBracketing(double lower,
double upper) |
Check that the endpoints specify an interval and the function takes
opposite signs at the endpoints.
|
static void |
UnivariateSolverUtils.verifyBracketing(UnivariateFunction function,
double lower,
double upper) |
Check that the endpoints specify an interval and the end points
bracket a root.
|