Serializable
, Comparable<GaussNewtonOptimizer.Decomposition>
MatrixDecomposer
instead.@Deprecated public static enum GaussNewtonOptimizer.Decomposition extends Enum<GaussNewtonOptimizer.Decomposition>
Enum Constant | Description |
---|---|
CHOLESKY |
Deprecated.
Solve by forming the normal equations (JTJx=JTr) and
using the
CholeskyDecomposition . |
LU |
Deprecated.
Solve by forming the normal equations (JTJx=JTr) and
using the
LUDecomposition . |
QR |
Deprecated.
Solve the linear least squares problem (Jx=r) using the
QRDecomposition . |
SVD |
Deprecated.
Solve the linear least squares problem using the
SingularValueDecomposition . |
Modifier and Type | Method | Description |
---|---|---|
protected abstract MatrixDecomposer |
getDecomposer() |
Deprecated.
Get the equivalent matrix decomposer.
|
protected abstract boolean |
isFormNormalEquations() |
Deprecated.
Get if this decomposition forms the normal equations explicitly.
|
protected abstract RealVector |
solve(RealMatrix jacobian,
RealVector residuals) |
Deprecated.
Solve the linear least squares problem Jx=r.
|
static GaussNewtonOptimizer.Decomposition |
valueOf(String name) |
Deprecated.
Returns the enum constant of this type with the specified name.
|
static GaussNewtonOptimizer.Decomposition[] |
values() |
Deprecated.
Returns an array containing the constants of this enum type, in
the order they are declared.
|
public static final GaussNewtonOptimizer.Decomposition LU
LUDecomposition
.
Theoretically this method takes mn2/2 operations to compute the normal matrix and n3/3 operations (m > n) to solve the system using the LU decomposition.
public static final GaussNewtonOptimizer.Decomposition QR
QRDecomposition
.
Theoretically this method takes mn2 - n3/3 operations (m > n) and has better numerical accuracy than any method that forms the normal equations.
public static final GaussNewtonOptimizer.Decomposition CHOLESKY
CholeskyDecomposition
.
Theoretically this method takes mn2/2 operations to compute the normal matrix and n3/6 operations (m > n) to solve the system using the Cholesky decomposition.
public static final GaussNewtonOptimizer.Decomposition SVD
SingularValueDecomposition
.
This method is slower, but can provide a solution for rank deficient and nearly singular systems.
public static GaussNewtonOptimizer.Decomposition[] values()
for (GaussNewtonOptimizer.Decomposition c : GaussNewtonOptimizer.Decomposition.values()) System.out.println(c);
public static GaussNewtonOptimizer.Decomposition valueOf(String name)
name
- the name of the enum constant to be returned.IllegalArgumentException
- if this enum type has no constant with the specified nameNullPointerException
- if the argument is nullprotected abstract RealVector solve(RealMatrix jacobian, RealVector residuals)
jacobian
- the Jacobian matrix, J. the number of rows >= the number or
columns.residuals
- the computed residuals, r.MathIllegalStateException
- if the matrix properties (e.g. singular) do not
permit a solution.protected abstract MatrixDecomposer getDecomposer()
protected abstract boolean isFormNormalEquations()
true
if the normal equations are formed explicitly,
false
otherwise.Copyright © 2016–2018 Hipparchus.org. All rights reserved.