Uses of Class
org.hipparchus.exception.MathIllegalStateException
Packages that use MathIllegalStateException
Package
Description
Numerical integration (quadrature) algorithms for univariate real functions.
Root finding algorithms, for univariate real functions.
Complex number type and implementations of complex transcendental
functions.
Fraction number type and fraction number formatting.
Linear algebra support.
Random number and random data generators.
Implementations of special functions such as Beta and Gamma.
Convenience routines and common data structures used throughout the Hipparchus library.
-
Uses of MathIllegalStateException in org.hipparchus.analysis.integration
Methods in org.hipparchus.analysis.integration that throw MathIllegalStateExceptionModifier and TypeMethodDescriptionprotected TBaseAbstractFieldUnivariateIntegrator.computeObjectiveValue(T point) Compute the objective function value.protected doubleBaseAbstractUnivariateIntegrator.computeObjectiveValue(double point) Compute the objective function value.protected abstract TBaseAbstractFieldUnivariateIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected abstract doubleBaseAbstractUnivariateIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected TFieldMidPointIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected TFieldRombergIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected TFieldSimpsonIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected TFieldTrapezoidIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected TIterativeLegendreFieldGaussIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected doubleIterativeLegendreGaussIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected doubleMidPointIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected doubleRombergIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected doubleSimpsonIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.protected doubleTrapezoidIntegrator.doIntegrate()Method for implementing actual integration algorithms in derived classes.BaseAbstractFieldUnivariateIntegrator.integrate(int maxEval, CalculusFieldUnivariateFunction<T> f, T lower, T upper) Integrate the function in the given interval.doubleBaseAbstractUnivariateIntegrator.integrate(int maxEval, UnivariateFunction f, double lower, double upper) Integrate the function in the given interval.FieldUnivariateIntegrator.integrate(int maxEval, CalculusFieldUnivariateFunction<T> f, T min, T max) Integrate the function in the given interval.doubleUnivariateIntegrator.integrate(int maxEval, UnivariateFunction f, double min, double max) Integrate the function in the given interval. -
Uses of MathIllegalStateException in org.hipparchus.analysis.solvers
Methods in org.hipparchus.analysis.solvers that throw MathIllegalStateExceptionModifier and TypeMethodDescriptionprotected doubleBaseAbstractUnivariateSolver.computeObjectiveValue(double point) Compute the objective function value.protected DerivativeStructureAbstractUnivariateDifferentiableSolver.computeObjectiveValueAndDerivative(double point) Deprecated.protected UnivariateDerivative1AbstractUnivariateDifferentiableSolver.computeObjectiveValueAndDerivative1(double point) Compute the objective function value.protected abstract doubleBaseAbstractUnivariateSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected final doubleBaseSecantSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected doubleBisectionSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected doubleBrentSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.doubleLaguerreSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected doubleMullerSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected doubleMullerSolver2.doSolve()Method for implementing actual optimization algorithms in derived classes.protected doubleNewtonRaphsonSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected doubleRiddersSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected final doubleSecantSolver.doSolve()Method for implementing actual optimization algorithms in derived classes.protected final BracketedUnivariateSolver.IntervalBaseSecantSolver.doSolveInterval()Find a root and return the containing interval.protected voidBaseAbstractUnivariateSolver.incrementEvaluationCount()Increment the evaluation count by one.doubleSolve for a zero in the vicinity ofstartValue.doubleSolve for a zero in the given interval, start atstartValue.doubleSolve for a zero root in the given interval.doubleSolve for a zero in the given interval, start atstartValue.doubleBracketingNthOrderBrentSolver.solve(int maxEval, UnivariateFunction f, double min, double max, double startValue, AllowedSolution allowedSolution) Solve for a zero in the given interval, start atstartValue.doubleBracketingNthOrderBrentSolver.solve(int maxEval, UnivariateFunction f, double min, double max, AllowedSolution allowedSolution) Solve for a zero in the given interval.doubleNewtonRaphsonSolver.solve(int maxEval, UnivariateDifferentiableFunction f, double min, double max) Find a zero near the midpoint ofminandmax.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.solveAllComplex(double[] coefficients, int maxEval, double initial) Find all complex roots for the polynomial with the given coefficients, starting from the given initial value.LaguerreSolver.solveComplex(double[] coefficients, double initial) Find a complex root for the polynomial with the given coefficients, starting from the given initial value.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.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.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.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.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.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.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. -
Uses of MathIllegalStateException in org.hipparchus.complex
Methods in org.hipparchus.complex that throw MathIllegalStateExceptionModifier and TypeMethodDescriptiondoubleRootsOfUnity.getImaginary(int k) Get the imaginary part of thek-thn-th root of unity.doubleRootsOfUnity.getReal(int k) Get the real part of thek-thn-th root of unity.booleanRootsOfUnity.isCounterClockWise()Parses a string to produce aComplexobject. -
Uses of MathIllegalStateException in org.hipparchus.fraction
Methods in org.hipparchus.fraction that throw MathIllegalStateExceptionModifier and TypeMethodDescriptionFractionFormat.format(Object obj, StringBuffer toAppendTo, FieldPosition pos) Formats an object and appends the result to a StringBuffer.Parses a string to produce aBigFractionobject.Parses a string to produce aFractionobject.Constructors in org.hipparchus.fraction that throw MathIllegalStateExceptionModifierConstructorDescriptionBigFraction(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. -
Uses of MathIllegalStateException in org.hipparchus.linear
Methods in org.hipparchus.linear that throw MathIllegalStateExceptionModifier and TypeMethodDescriptionIterativeLinearSolver.solve(RealLinearOperator a, RealVector b) Returns an estimate of the solution to the linear system A · x = b.IterativeLinearSolver.solve(RealLinearOperator a, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.PreconditionedIterativeLinearSolver.solve(RealLinearOperator a, RealLinearOperator m, RealVector b) Returns an estimate of the solution to the linear system A · x = b.PreconditionedIterativeLinearSolver.solve(RealLinearOperator a, RealLinearOperator m, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.PreconditionedIterativeLinearSolver.solve(RealLinearOperator a, RealVector b) Returns an estimate of the solution to the linear system A · x = b.PreconditionedIterativeLinearSolver.solve(RealLinearOperator a, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.SymmLQ.solve(RealLinearOperator a, RealLinearOperator m, RealVector b) Returns an estimate of the solution to the linear system A · x = b.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.SymmLQ.solve(RealLinearOperator a, RealLinearOperator m, RealVector b, RealVector x) Returns an estimate of the solution to the linear system A · x = b.SymmLQ.solve(RealLinearOperator a, RealVector b) Returns an estimate of the solution to the linear system A · x = b.SymmLQ.solve(RealLinearOperator a, RealVector b, boolean goodb, double shift) Returns the solution to the system (A - shift · I) · x = b.SymmLQ.solve(RealLinearOperator a, RealVector b, RealVector x) Returns an estimate of the solution to the linear system A · x = b.ConjugateGradient.solveInPlace(RealLinearOperator a, RealLinearOperator m, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.abstract RealVectorIterativeLinearSolver.solveInPlace(RealLinearOperator a, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.abstract RealVectorPreconditionedIterativeLinearSolver.solveInPlace(RealLinearOperator a, RealLinearOperator m, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.PreconditionedIterativeLinearSolver.solveInPlace(RealLinearOperator a, RealVector b, RealVector x0) Returns an estimate of the solution to the linear system A · x = b.SymmLQ.solveInPlace(RealLinearOperator a, RealLinearOperator m, RealVector b, RealVector x) Returns an estimate of the solution to the linear system A · x = b.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.SymmLQ.solveInPlace(RealLinearOperator a, RealVector b, RealVector x) Returns an estimate of the solution to the linear system A · x = b. -
Uses of MathIllegalStateException in org.hipparchus.random
Constructors in org.hipparchus.random that throw MathIllegalStateExceptionModifierConstructorDescriptionSobolSequenceGenerator(int dimension, InputStream is) Construct a new Sobol sequence generator for the given space dimension with direction vectors loaded from the given stream. -
Uses of MathIllegalStateException in org.hipparchus.special
Methods in org.hipparchus.special that throw MathIllegalStateException -
Uses of MathIllegalStateException in org.hipparchus.util
Methods in org.hipparchus.util that throw MathIllegalStateExceptionModifier and TypeMethodDescriptiondoubleContinuedFraction.evaluate(double x) Evaluates the continued fraction at the value x.doubleContinuedFraction.evaluate(double x, double epsilon) Evaluates the continued fraction at the value x.doubleContinuedFraction.evaluate(double x, double epsilon, int maxIterations) Evaluates the continued fraction at the value x.doubleContinuedFraction.evaluate(double x, int maxIterations) Evaluates the continued fraction at the value x.<T extends CalculusFieldElement<T>>
TFieldContinuedFraction.evaluate(T x) Evaluates the continued fraction at the value x.<T extends CalculusFieldElement<T>>
TFieldContinuedFraction.evaluate(T x, double epsilon) Evaluates the continued fraction at the value x.<T extends CalculusFieldElement<T>>
TFieldContinuedFraction.evaluate(T x, double epsilon, int maxIterations) Evaluates the continued fraction at the value x.<T extends CalculusFieldElement<T>>
TFieldContinuedFraction.evaluate(T x, int maxIterations) Evaluates the continued fraction at the value x.voidIterationManager.incrementIterationCount()Increments the iteration count by one, and throws an exception if the maximum number of iterations is reached.doubleResizableDoubleArray.substituteMostRecentElement(double value) Substitutesvaluefor the most recently added value.voidIncrementor.MaxCountExceededCallback.trigger(int maximalCount) Function called when the maximal count has been reached.
AbstractUnivariateDifferentiableSolver.computeObjectiveValueAndDerivative1(double)