Package | Description |
---|---|
gov.sandia.cognition.learning.algorithm.root |
Provides algorithms for finding the roots, or zero crossings, of scalar functions.
|
gov.sandia.cognition.statistics.method |
Provides algorithms for evaluating statistical data and conducting statistical inference, particularly frequentist methods.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractBracketedRootFinder
Partial implementation of RootFinder that maintains a bracket on the root.
|
class |
AbstractRootFinder
Partial implementation of RootFinder.
|
class |
MinimizerBasedRootFinder
A root finder that uses minimization techniques to find the roots
(zero-crossings).
|
class |
RootFinderBisectionMethod
Bisection algorithm for root finding.
|
class |
RootFinderFalsePositionMethod
The false-position algorithm for root finding.
|
class |
RootFinderNewtonsMethod
Newton's method, sometimes called Newton-Raphson method, uses first-order
derivative information to iteratively locate a root.
|
class |
RootFinderRiddersMethod
The root-finding algorithm due to Ridders.
|
class |
RootFinderSecantMethod
The secant algorithm for root finding.
|
Modifier and Type | Field and Description |
---|---|
static RootFinder |
InverseTransformSampling.DEFAULT_ROOT_FINDER
Default root finding method for the algorithm, RootFinderRiddersMethod.
|
Modifier and Type | Method and Description |
---|---|
static InputOutputPair<java.lang.Double,java.lang.Double> |
InverseTransformSampling.inverseRootFinder(RootFinder rootFinder,
CumulativeDistributionFunction<java.lang.Double> cdf,
double p)
Inverts the given CDF, finding the value of "x" so that CDF(x)=p using
a root-finding algorithm.
|