/** * Get the absolute accuracy. * @return absolute accuracy */ @Override public Dfp getAbsoluteAccuracy() { return super.getAbsoluteAccuracy(); }
/** * Get the function accuracy. * @return function accuracy */ @Override public Dfp getFunctionValueAccuracy() { return super.getFunctionValueAccuracy(); }
/** * Get the relative accuracy. * @return relative accuracy */ @Override public Dfp getRelativeAccuracy() { return super.getRelativeAccuracy(); }
/** {@inheritDoc} */ public void addEventHandler(final FieldEventHandler<T> handler, final double maxCheckInterval, final double convergence, final int maxIterationCount) { addEventHandler(handler, maxCheckInterval, convergence, maxIterationCount, new FieldBracketingNthOrderBrentSolver<T>(field.getZero().add(DEFAULT_RELATIVE_ACCURACY), field.getZero().add(convergence), field.getZero().add(DEFAULT_FUNCTION_VALUE_ACCURACY), 5)); }
/** * 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. * * @param maxEval Maximum number of evaluations. * @param f Function to solve. * @param min Lower bound for the interval. * @param max Upper bound for the interval. * @param allowedSolution The kind of solutions that the root-finding algorithm may * accept as solutions. * @return a value where the function is zero. * @exception NullArgumentException if f is null. * @exception NoBracketingException if root cannot be bracketed */ public T solve(final int maxEval, final RealFieldUnivariateFunction<T> f, final T min, final T max, final AllowedSolution allowedSolution) throws NullArgumentException, NoBracketingException { return solve(maxEval, f, min, max, min.add(max).divide(2), allowedSolution); }
nextX = guessX(targetY, tmpX, y, start, end);
/** {@inheritDoc} */ public void addEventHandler(final FieldEventHandler<T> handler, final double maxCheckInterval, final double convergence, final int maxIterationCount) { addEventHandler(handler, maxCheckInterval, convergence, maxIterationCount, new FieldBracketingNthOrderBrentSolver<T>(field.getZero().add(DEFAULT_RELATIVE_ACCURACY), field.getZero().add(convergence), field.getZero().add(DEFAULT_FUNCTION_VALUE_ACCURACY), 5)); }
/** * 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. * * @param maxEval Maximum number of evaluations. * @param f Function to solve. * @param min Lower bound for the interval. * @param max Upper bound for the interval. * @param allowedSolution The kind of solutions that the root-finding algorithm may * accept as solutions. * @return a value where the function is zero. * @exception NullArgumentException if f is null. * @exception NoBracketingException if root cannot be bracketed */ public T solve(final int maxEval, final RealFieldUnivariateFunction<T> f, final T min, final T max, final AllowedSolution allowedSolution) throws NullArgumentException, NoBracketingException { return solve(maxEval, f, min, max, min.add(max).divide(2), allowedSolution); }
nextX = guessX(targetY, tmpX, y, start, end);
/** * Get the function accuracy. * @return function accuracy */ @Override public Dfp getFunctionValueAccuracy() { return super.getFunctionValueAccuracy(); }
/** * Get the absolute accuracy. * @return absolute accuracy */ @Override public Dfp getAbsoluteAccuracy() { return super.getAbsoluteAccuracy(); }
/** * Get the relative accuracy. * @return relative accuracy */ @Override public Dfp getRelativeAccuracy() { return super.getRelativeAccuracy(); }