|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use ConvergenceException | |
---|---|
org.apache.commons.math | Common classes used throughout the commons-math library. |
org.apache.commons.math.analysis | Implementations of common numerical analysis procedures, including root finding and function interpolation. |
org.apache.commons.math.fraction | Fraction number type and fraction number formatting. |
org.apache.commons.math.ode | This package provides classes to solve Ordinary Differential Equations problems. |
org.apache.commons.math.optimization | This package provides parametric optimization algorithms. |
Uses of ConvergenceException in org.apache.commons.math |
---|
Subclasses of ConvergenceException in org.apache.commons.math | |
---|---|
class |
MaxIterationsExceededException
Error thrown when a numerical computation exceeds its allowed number of iterations. |
Uses of ConvergenceException in org.apache.commons.math.analysis |
---|
Methods in org.apache.commons.math.analysis that throw ConvergenceException | |
---|---|
static double[] |
UnivariateRealSolverUtils.bracket(UnivariateRealFunction function,
double initial,
double lowerBound,
double upperBound)
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. |
static double[] |
UnivariateRealSolverUtils.bracket(UnivariateRealFunction function,
double initial,
double lowerBound,
double upperBound,
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. |
double |
UnivariateRealIntegrator.integrate(double min,
double max)
Integrate the function in the given interval. |
double |
LaguerreSolver.solve(double min,
double max)
Find a real root in the given interval. |
double |
UnivariateRealSolver.solve(double min,
double max)
Solve for a zero root in the given interval. |
double |
LaguerreSolver.solve(double min,
double max,
double initial)
Find a real root in the given interval with initial value. |
double |
UnivariateRealSolver.solve(double min,
double max,
double startValue)
Solve for a zero in the given interval, start at startValue. |
static double |
UnivariateRealSolverUtils.solve(UnivariateRealFunction f,
double x0,
double x1)
Convenience method to find a zero of a univariate real function. |
static double |
UnivariateRealSolverUtils.solve(UnivariateRealFunction f,
double x0,
double x1,
double absoluteAccuracy)
Convenience method to find a zero of a univariate real function. |
Complex[] |
LaguerreSolver.solveAll(double[] coefficients,
double initial)
Find all complex roots for the polynomial with the given coefficients, starting from the given initial value. |
Uses of ConvergenceException in org.apache.commons.math.fraction |
---|
Subclasses of ConvergenceException in org.apache.commons.math.fraction | |
---|---|
class |
FractionConversionException
Error thrown when a double value cannot be converted to a fraction in the allowed number of iterations. |
Uses of ConvergenceException in org.apache.commons.math.ode |
---|
Methods in org.apache.commons.math.ode that throw ConvergenceException | |
---|---|
boolean |
SwitchState.evaluateStep(StepInterpolator interpolator)
Evaluate the impact of the proposed step on the switching function. |
Uses of ConvergenceException in org.apache.commons.math.optimization |
---|
Methods in org.apache.commons.math.optimization that throw ConvergenceException | |
---|---|
private PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[][] vertices)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[][] vertices,
int starts,
long seed)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[] vertexA,
double[] vertexB)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[] vertexA,
double[] vertexB,
int starts,
long seed)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
RandomVectorGenerator generator)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
RandomVectorGenerator generator,
int starts)
Minimizes a cost function. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |