Package gov.sandia.cognition.learning.algorithm.root

Provides algorithms for finding the roots, or zero crossings, of scalar functions.

See:
          Description

Interface Summary
RootBracketer Defines the functionality of a algorithm that finds a bracket of a root from an initial guess.
RootFinder Defines the functionality of a root-finding algorithm.
 

Class Summary
AbstractBracketedRootFinder Partial implementation of RootFinder that maintains a bracket on the root.
AbstractRootFinder Partial implementation of RootFinder.
MinimizerBasedRootFinder A root finder that uses minimization techniques to find the roots (zero-crossings).
RootBracketExpander The root-bracketing expansion algorithm.
RootFinderBisectionMethod Bisection algorithm for root finding.
RootFinderFalsePositionMethod The false-position algorithm for root finding.
RootFinderNewtonsMethod Newton's method, sometimes called Newton-Raphson method, uses first-order derivative information to iteratively locate a root.
RootFinderRiddersMethod The root-finding algorithm due to Ridders.
RootFinderSecantMethod The secant algorithm for root finding.
SolverFunction Evaluator that allows RootFinders to solve for nonzero values by setting a "target" parameter.
 

Package gov.sandia.cognition.learning.algorithm.root Description

Provides algorithms for finding the roots, or zero crossings, of scalar functions.

Since:
3.0
Author:
Kevin R. Dixon