|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||
java.lang.Objectorg.ojalgo.matrix.decomposition.CholeskyDecomposition<N>
public abstract class CholeskyDecomposition<N extends Number>
You create instances of (some subclass of) this class by calling one of the static factory methods: makeBig(), makeComplex(), makePrimitive() or makeJama().
| Method Summary | ||
|---|---|---|
boolean |
compute(Access2D<?> aStore)
|
|
boolean |
computeWithCheck(MatrixStore<?> aStore)
|
|
boolean |
equals(MatrixDecomposition<N> aDecomp,
NumberContext aCntxt)
|
|
boolean |
equals(MatrixStore<N> aStore,
NumberContext aCntxt)
|
|
boolean |
equals(Object someObj)
|
|
N |
getDeterminant()
|
|
MatrixStore<N> |
getInverse()
The output must be a "right inverse" and a "generalised inverse". |
|
MatrixStore<N> |
getInverse(DecompositionStore<N> preallocated)
Implementiong this method is optional. |
|
MatrixStore<N> |
getL()
|
|
boolean |
isAspectRatioNormal()
|
|
boolean |
isComputed()
|
|
boolean |
isFullSize()
|
|
boolean |
isSolvable()
|
|
boolean |
isSPD()
To use the Cholesky decomposition rather than the LU decomposition the matrix must be symmetric and positive definite. |
|
static
|
make(Access2D<N> aTypical)
|
|
static Cholesky<BigDecimal> |
makeBig()
|
|
static Cholesky<ComplexNumber> |
makeComplex()
|
|
static Cholesky<Double> |
makeJama()
|
|
static Cholesky<Double> |
makePrimitive()
|
|
MatrixStore<N> |
reconstruct()
|
|
void |
reset()
Delete computed results, and resets attributes to default values |
|
MatrixStore<N> |
solve(MatrixStore<N> aRHS)
Solves [this][X] = [aRHS] by first solving |
|
MatrixStore<N> |
solve(MatrixStore<N> aRHS,
DecompositionStore<N> preallocated)
The solution will be written to "preallocated" and then returned. |
|
| Methods inherited from class java.lang.Object |
|---|
getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Methods inherited from interface org.ojalgo.matrix.decomposition.MatrixDecomposition |
|---|
equals, isComputed |
| Method Detail |
|---|
public static final <N extends Number> Cholesky<N> make(Access2D<N> aTypical)
public static final Cholesky<BigDecimal> makeBig()
public static final Cholesky<ComplexNumber> makeComplex()
public static final Cholesky<Double> makeJama()
public static final Cholesky<Double> makePrimitive()
public boolean compute(Access2D<?> aStore)
compute in interface MatrixDecomposition<N extends Number>aStore - A matrix to decompose
public boolean computeWithCheck(MatrixStore<?> aStore)
computeWithCheck in interface Cholesky<N extends Number>
public final boolean equals(MatrixStore<N> aStore,
NumberContext aCntxt)
equals in interface MatrixDecomposition<N extends Number>public N getDeterminant()
getDeterminant in interface Cholesky<N extends Number>public final MatrixStore<N> getInverse()
MatrixDecomposition
getInverse in interface MatrixDecomposition<N extends Number>BasicMatrix.invert()public final MatrixStore<N> getInverse(DecompositionStore<N> preallocated)
MatrixDecompositionImplementiong this method is optional.
Exactly how a specific implementation makes use of preallocated
is not specified by this interface. It must be documented for each
implementation.
Should produce the same results as calling MatrixDecomposition.getInverse().
getInverse in interface MatrixDecomposition<N extends Number>preallocated - Preallocated memory for the results, possibly some
intermediate results. You must assume this is modified, but you
cannot assume it will contain the full/final/correct solution.
public MatrixStore<N> getL()
getL in interface Cholesky<N extends Number>public final boolean isFullSize()
isFullSize in interface MatrixDecomposition<N extends Number>public boolean isSolvable()
isSolvable in interface MatrixDecomposition<N extends Number>MatrixDecomposition.solve(MatrixStore),
MatrixDecomposition.isComputed()public boolean isSPD()
Cholesky
isSPD in interface Cholesky<N extends Number>public MatrixStore<N> reconstruct()
reconstruct in interface MatrixDecomposition<N extends Number>public void reset()
MatrixDecomposition
reset in interface MatrixDecomposition<N extends Number>public final MatrixStore<N> solve(MatrixStore<N> aRHS)
[L][Y] = [aRHS]and then
[U][X] = [Y].
solve in interface MatrixDecomposition<N extends Number>aRHS - The right hand side
public final MatrixStore<N> solve(MatrixStore<N> aRHS,
DecompositionStore<N> preallocated)
solve in interface MatrixDecomposition<N extends Number>aRHS - The Right Hand Side, wont be modfiedpreallocated - Preallocated memory for the results, possibly some
intermediate results. You must assume this is modified, but you
cannot assume it will contain the full/final/correct solution.
MatrixDecomposition.solve(org.ojalgo.matrix.store.MatrixStore, org.ojalgo.matrix.decomposition.DecompositionStore)
public final boolean equals(MatrixDecomposition<N> aDecomp,
NumberContext aCntxt)
equals in interface MatrixDecomposition<N extends Number>public boolean equals(Object someObj)
equals in class Objectpublic boolean isAspectRatioNormal()
public final boolean isComputed()
isComputed in interface MatrixDecomposition<N extends Number>MatrixDecomposition.compute(Access2D),
MatrixDecomposition.isSolvable()
|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||