Package | Description |
---|---|
org.hipparchus.analysis.integration |
Numerical integration (quadrature) algorithms for univariate real functions.
|
org.hipparchus.analysis.solvers |
Root finding algorithms, for univariate real functions.
|
org.hipparchus.complex |
Complex number type and implementations of complex transcendental
functions.
|
org.hipparchus.fraction |
Fraction number type and fraction number formatting.
|
org.hipparchus.linear |
Linear algebra support.
|
org.hipparchus.random |
Random number and random data generators.
|
org.hipparchus.special |
Implementations of special functions such as Beta and Gamma.
|
org.hipparchus.util |
Convenience routines and common data structures used throughout the Hipparchus library.
|
Modifier and Type | Method and Description |
---|---|
protected double |
BaseAbstractUnivariateIntegrator.computeObjectiveValue(double point)
Compute the objective function value.
|
protected T |
BaseAbstractFieldUnivariateIntegrator.computeObjectiveValue(T point)
Compute the objective function value.
|
protected double |
IterativeLegendreGaussIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected double |
SimpsonIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected T |
FieldSimpsonIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected abstract T |
BaseAbstractFieldUnivariateIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected double |
MidPointIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected T |
IterativeLegendreFieldGaussIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected T |
FieldRombergIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected T |
FieldTrapezoidIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected double |
RombergIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected double |
TrapezoidIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected T |
FieldMidPointIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
protected abstract double |
BaseAbstractUnivariateIntegrator.doIntegrate()
Method for implementing actual integration algorithms in derived
classes.
|
T |
BaseAbstractFieldUnivariateIntegrator.integrate(int maxEval,
CalculusFieldUnivariateFunction<T> f,
T lower,
T upper)
Integrate the function in the given interval.
|
T |
FieldUnivariateIntegrator.integrate(int maxEval,
CalculusFieldUnivariateFunction<T> f,
T min,
T max)
Integrate the function in the given interval.
|
double |
UnivariateIntegrator.integrate(int maxEval,
UnivariateFunction f,
double min,
double max)
Integrate the function in the given interval.
|
double |
BaseAbstractUnivariateIntegrator.integrate(int maxEval,
UnivariateFunction f,
double lower,
double upper)
Integrate the function in the given interval.
|
Modifier and Type | Method and Description |
---|---|
protected double |
BaseAbstractUnivariateSolver.computeObjectiveValue(double point)
Compute the objective function value.
|
protected DerivativeStructure |
AbstractUnivariateDifferentiableSolver.computeObjectiveValueAndDerivative(double point)
Compute the objective function value.
|
protected abstract double |
BaseAbstractUnivariateSolver.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 |
BaseSecantSolver.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 |
NewtonRaphsonSolver.doSolve()
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
BisectionSolver.doSolve()
Method for implementing actual optimization algorithms in derived
classes.
|
protected double |
SecantSolver.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 BracketedUnivariateSolver.Interval |
BaseSecantSolver.doSolveInterval()
Find a root and return the containing interval.
|
protected void |
BaseAbstractUnivariateSolver.incrementEvaluationCount()
Increment the evaluation count by one.
|
double |
BaseAbstractUnivariateSolver.solve(int maxEval,
F f,
double startValue)
Solve for a zero in the vicinity of
startValue . |
double |
BaseUnivariateSolver.solve(int maxEval,
F f,
double min,
double max)
Solve for a zero root in the given interval.
|
double |
BaseAbstractUnivariateSolver.solve(int maxEval,
F f,
double min,
double max,
double startValue)
Solve for a zero in the given interval, start at
startValue . |
double |
BaseUnivariateSolver.solve(int maxEval,
F f,
double min,
double max,
double startValue)
Solve for a zero in the given interval, start at
startValue . |
double |
NewtonRaphsonSolver.solve(int maxEval,
UnivariateDifferentiableFunction f,
double min,
double max)
Find a zero near the midpoint of
min and max . |
double |
BracketingNthOrderBrentSolver.solve(int maxEval,
UnivariateFunction f,
double min,
double max,
AllowedSolution allowedSolution)
Solve for a zero in the given interval.
|
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 . |
Complex[] |
LaguerreSolver.solveAllComplex(double[] coefficients,
double initial)
Find all complex roots for the polynomial with the given
coefficients, starting from the given initial value.
|
Complex |
LaguerreSolver.solveComplex(double[] coefficients,
double initial)
Find a complex root for the polynomial with the given coefficients,
starting from the given initial value.
|
default BracketedRealFieldUnivariateSolver.Interval<T> |
BracketedRealFieldUnivariateSolver.solveInterval(int maxEval,
CalculusFieldUnivariateFunction<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,
CalculusFieldUnivariateFunction<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,
CalculusFieldUnivariateFunction<T> f,
T min,
T max,
T startValue)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
default BracketedUnivariateSolver.Interval |
BracketedUnivariateSolver.solveInterval(int maxEval,
F f,
double min,
double max)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
BracketedUnivariateSolver.Interval |
BracketedUnivariateSolver.solveInterval(int maxEval,
F f,
double min,
double max,
double startValue)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
BracketedUnivariateSolver.Interval |
BaseSecantSolver.solveInterval(int maxEval,
UnivariateFunction f,
double min,
double max,
double startValue)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
BracketedUnivariateSolver.Interval |
BracketingNthOrderBrentSolver.solveInterval(int maxEval,
UnivariateFunction f,
double min,
double max,
double startValue)
Solve for a zero in the given interval and return a tolerance interval surrounding
the root.
|
Modifier and Type | Method and Description |
---|---|
double |
RootsOfUnity.getImaginary(int k)
Get the imaginary part of the
k -th n -th root of unity. |
double |
RootsOfUnity.getReal(int k)
Get the real part of the
k -th n -th root of unity. |
boolean |
RootsOfUnity.isCounterClockWise()
|
Complex |
ComplexFormat.parse(String source)
Parses a string to produce a
Complex object. |
Modifier and Type | Method and Description |
---|---|
StringBuffer |
FractionFormat.format(Object obj,
StringBuffer toAppendTo,
FieldPosition pos)
Formats an object and appends the result to a StringBuffer.
|
BigFraction |
BigFractionFormat.parse(String source)
Parses a string to produce a
BigFraction object. |
Fraction |
FractionFormat.parse(String source)
Parses a string to produce a
Fraction object. |
Constructor and Description |
---|
BigFraction(double value,
double epsilon,
int maxIterations)
Create a fraction given the double value and maximum error allowed.
|
BigFraction(double value,
long maxDenominator)
Create a fraction given the double value and maximum denominator.
|
Fraction(double value)
Create a fraction given the double value.
|
Fraction(double value,
double epsilon,
int maxIterations)
Create a fraction given the double value and maximum error allowed.
|
Fraction(double value,
int maxDenominator)
Create a fraction given the double value and maximum denominator.
|
Modifier and Type | Method and Description |
---|---|
RealVector |
PreconditionedIterativeLinearSolver.solve(RealLinearOperator a,
RealLinearOperator m,
RealVector b)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solve(RealLinearOperator a,
RealLinearOperator m,
RealVector b)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solve(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
boolean goodb,
double shift)
Returns an estimate of the solution to the linear system (A - shift
· I) · x = b.
|
RealVector |
PreconditionedIterativeLinearSolver.solve(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solve(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
RealVector x)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
PreconditionedIterativeLinearSolver.solve(RealLinearOperator a,
RealVector b)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
IterativeLinearSolver.solve(RealLinearOperator a,
RealVector b)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solve(RealLinearOperator a,
RealVector b)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solve(RealLinearOperator a,
RealVector b,
boolean goodb,
double shift)
Returns the solution to the system (A - shift · I) · x = b.
|
RealVector |
PreconditionedIterativeLinearSolver.solve(RealLinearOperator a,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
IterativeLinearSolver.solve(RealLinearOperator a,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solve(RealLinearOperator a,
RealVector b,
RealVector x)
Returns an estimate of the solution to the linear system A · x =
b.
|
abstract RealVector |
PreconditionedIterativeLinearSolver.solveInPlace(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
ConjugateGradient.solveInPlace(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solveInPlace(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
RealVector x)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solveInPlace(RealLinearOperator a,
RealLinearOperator m,
RealVector b,
RealVector x,
boolean goodb,
double shift)
Returns an estimate of the solution to the linear system (A - shift
· I) · x = b.
|
RealVector |
PreconditionedIterativeLinearSolver.solveInPlace(RealLinearOperator a,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
abstract RealVector |
IterativeLinearSolver.solveInPlace(RealLinearOperator a,
RealVector b,
RealVector x0)
Returns an estimate of the solution to the linear system A · x =
b.
|
RealVector |
SymmLQ.solveInPlace(RealLinearOperator a,
RealVector b,
RealVector x)
Returns an estimate of the solution to the linear system A · x =
b.
|
Constructor and Description |
---|
SobolSequenceGenerator(int dimension,
InputStream is)
Construct a new Sobol sequence generator for the given space dimension with
direction vectors loaded from the given stream.
|
Modifier and Type | Method and Description |
---|---|
double |
BesselJ.value(double x)
Returns the value of the constructed Bessel function of the first kind,
for the passed argument.
|
static double |
BesselJ.value(double order,
double x)
Returns the first Bessel function, \(J_{order}(x)\).
|
Modifier and Type | Method and Description |
---|---|
double |
ContinuedFraction.evaluate(double x)
Evaluates the continued fraction at the value x.
|
double |
ContinuedFraction.evaluate(double x,
double epsilon)
Evaluates the continued fraction at the value x.
|
double |
ContinuedFraction.evaluate(double x,
double epsilon,
int maxIterations)
Evaluates the continued fraction at the value x.
|
double |
ContinuedFraction.evaluate(double x,
int maxIterations)
Evaluates the continued fraction at the value x.
|
void |
IterationManager.incrementIterationCount()
Increments the iteration count by one, and throws an exception if the
maximum number of iterations is reached.
|
double |
ResizableDoubleArray.substituteMostRecentElement(double value)
Substitutes
value for the most recently added value. |
void |
Incrementor.MaxCountExceededCallback.trigger(int maximalCount)
Function called when the maximal count has been reached.
|
Copyright © 2016-2022 CS GROUP. All rights reserved.