Package gov.nasa.jpl.aerie.scheduler
Interface EquationSolvingAlgorithms.SecantAlgorithm<T,Metadata>
- All Known Implementing Classes:
EquationSolvingAlgorithms.SecantDurationAlgorithm
- Enclosing class:
EquationSolvingAlgorithms
public static interface EquationSolvingAlgorithms.SecantAlgorithm<T,Metadata>
Solves f(x) = y for x in [xLow, xHigh] with confidence interval [yLow, yHigh] around y such that we stop when
value y is in [y-yLow, y+yHigh].
x0 and x1 are initial guesses for x, they must be close to the solution to avoid diverging
It is considered that algorithm is diverging when the iterated value of x goes out of [xLow, xHigh].
-
Method Summary
-
Method Details
-
findRoot
EquationSolvingAlgorithms.RootFindingResult<T,Metadata> findRoot(EquationSolvingAlgorithms.Function<T, Metadata> f, EquationSolvingAlgorithms.History<T, throws EquationSolvingAlgorithms.ZeroDerivativeException, EquationSolvingAlgorithms.InfiniteDerivativeException, EquationSolvingAlgorithms.DivergenceException, EquationSolvingAlgorithms.ExceededMaxIterationException, EquationSolvingAlgorithms.NoSolutionException, SchedulingInterruptedExceptionMetadata> history, T x0, T y, T toleranceYLow, T toleranceYHigh, T xLow, T xHigh, int maxNbIterations)
-