public enum AllowedSolution extends Enum<AllowedSolution>
(bracketed univariate real) root-finding algorithmmay accept as solutions. This basically controls whether or not under-approximations and over-approximations are allowed.
If all solutions are accepted (
ANY_SIDE), then the solution
that the root-finding algorithm returns for a given root may be equal to the
actual root, but it may also be an approximation that is slightly smaller
or slightly larger than the actual root. Root-finding algorithms generally
only guarantee that the returned solution is within the requested
tolerances. In certain cases however, in particular for
state events of
ODE solvers, it
may be necessary to guarantee that a solution is returned that lies on a
specific side the solution.
|Enum Constant and Description|
Only solutions for which values are greater than or equal to zero are acceptable as solutions for root-finding.
There are no additional side restriction on the solutions for root-finding.
Only solutions for which values are less than or equal to zero are acceptable as solutions for root-finding.
Only solutions that are less than or equal to the actual root are acceptable as solutions for root-finding.
Only solutions that are greater than or equal to the actual root are acceptable as solutions for root-finding.
|Modifier and Type||Method and Description|
Returns the enum constant of this type with the specified name.
Returns an array containing the constants of this enum type, in the order they are declared.
clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf
public static final AllowedSolution ANY_SIDE
public static final AllowedSolution LEFT_SIDE
public static final AllowedSolution RIGHT_SIDE
public static final AllowedSolution BELOW_SIDE
public static AllowedSolution values()
for (AllowedSolution c : AllowedSolution.values()) System.out.println(c);
public static AllowedSolution valueOf(String name)
Copyright © 2003–2013 The Apache Software Foundation. All rights reserved.