public interface NewtonVectorRootFinder
This uses the Jacobian matrix as a basis for some parts of the iterative process.
| Modifier and Type | Method and Description |
|---|---|
static NewtonVectorRootFinder |
broyden()
Obtains an instance of the Broyden root finder.
|
static NewtonVectorRootFinder |
broyden(double absoluteTol,
double relativeTol,
int maxSteps)
Obtains an instance of the Broyden root finder specifying the tolerances.
|
static NewtonVectorRootFinder |
broyden(double absoluteTol,
double relativeTol,
int maxSteps,
Decomposition<?> decomposition)
Obtains an instance of the Broyden root finder specifying the tolerances.
|
DoubleArray |
findRoot(Function<DoubleArray,DoubleArray> function,
DoubleArray startPosition)
Finds the root from the specified start position.
|
DoubleArray |
findRoot(Function<DoubleArray,DoubleArray> function,
Function<DoubleArray,DoubleMatrix> jacobianFunction,
DoubleArray startPosition)
Finds the root from the specified start position.
|
static NewtonVectorRootFinder broyden()
This uses SV decomposition and standard tolerances.
static NewtonVectorRootFinder broyden(double absoluteTol, double relativeTol, int maxSteps)
This uses SV decomposition.
absoluteTol - the absolute tolerancerelativeTol - the relative tolerancemaxSteps - the maximum stepsstatic NewtonVectorRootFinder broyden(double absoluteTol, double relativeTol, int maxSteps, Decomposition<?> decomposition)
absoluteTol - the absolute tolerancerelativeTol - the relative tolerancemaxSteps - the maximum stepsdecomposition - the decomposition functionDoubleArray findRoot(Function<DoubleArray,DoubleArray> function, DoubleArray startPosition)
This applies the specified function to find the root. Note if multiple roots exist which one is found will depend on the start position.
function - the vector functionstartPosition - the start position of the root finder forMathException - if unable to find the root, such as if unable to convergeDoubleArray findRoot(Function<DoubleArray,DoubleArray> function, Function<DoubleArray,DoubleMatrix> jacobianFunction, DoubleArray startPosition)
This applies the specified function and Jacobian function to find the root. Note if multiple roots exist which one is found will depend on the start position.
function - the vector functionjacobianFunction - the function to calculate the JacobianstartPosition - the start position of the root finder forMathException - if unable to find the root, such as if unable to convergeCopyright 2009-Present by OpenGamma Inc. and individual contributors
Apache v2 licensed
Additional documentation can be found at strata.opengamma.io.