Package | Description |
---|---|
org.hipparchus.analysis |
Parent package for common numerical analysis procedures, including root finding,
function interpolation and integration.
|
org.hipparchus.analysis.interpolation |
Univariate real functions interpolation algorithms.
|
org.hipparchus.analysis.polynomials |
Univariate real polynomials implementations, seen as differentiable
univariate real functions.
|
org.hipparchus.analysis.solvers |
Root finding algorithms, for univariate real functions.
|
Modifier and Type | Method and Description |
---|---|
default <T extends RealFieldElement<T>> |
FieldUnivariateFunction.toRealFieldUnivariateFunction(Field<T> field)
Convert to a
RealFieldUnivariateFunction with a specific type. |
Modifier and Type | Method and Description |
---|---|
<T extends RealFieldElement<T>> |
FieldUnivariateInterpolator.interpolate(T[] xval,
T[] yval)
Compute an interpolating function for the dataset.
|
Modifier and Type | Class and Description |
---|---|
class |
FieldPolynomialFunction<T extends RealFieldElement<T>>
Immutable representation of a real polynomial function with real coefficients.
|
class |
FieldPolynomialSplineFunction<T extends RealFieldElement<T>>
Represents a polynomial spline function.
|
Modifier and Type | Method and Description |
---|---|
static <T extends RealFieldElement<T>> |
UnivariateSolverUtils.bracket(RealFieldUnivariateFunction<T> function,
T initial,
T lowerBound,
T upperBound)
This method simply calls
bracket(function, initial, lowerBound, upperBound, q, r, maximumIterations)
with q and r set to 1.0 and maximumIterations set to Integer.MAX_VALUE . |
static <T extends RealFieldElement<T>> |
UnivariateSolverUtils.bracket(RealFieldUnivariateFunction<T> function,
T initial,
T lowerBound,
T upperBound,
int maximumIterations)
This method simply calls
bracket(function, initial, lowerBound, upperBound, q, r, maximumIterations)
with q and r set to 1.0. |
static <T extends RealFieldElement<T>> |
UnivariateSolverUtils.bracket(RealFieldUnivariateFunction<T> function,
T initial,
T lowerBound,
T upperBound,
T q,
T 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 . |
T |
BracketedRealFieldUnivariateSolver.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,
AllowedSolution allowedSolution)
Solve for a zero in the given interval.
|
T |
BracketedRealFieldUnivariateSolver.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 . |
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 . |
default BracketedRealFieldUnivariateSolver.Interval<T> |
BracketedRealFieldUnivariateSolver.solveInterval(int maxEval,
RealFieldUnivariateFunction<T> f,
T min,
T max)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
BracketedRealFieldUnivariateSolver.Interval<T> |
BracketedRealFieldUnivariateSolver.solveInterval(int maxEval,
RealFieldUnivariateFunction<T> f,
T min,
T max,
T startValue)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
BracketedRealFieldUnivariateSolver.Interval<T> |
FieldBracketingNthOrderBrentSolver.solveInterval(int maxEval,
RealFieldUnivariateFunction<T> f,
T min,
T max,
T startValue)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
Copyright © 2016–2020 Hipparchus.org. All rights reserved.