public interface Cholesky<N extends Number> extends LDU<N>, MatrixDecomposition.Hermitian<N>
Cholesky: [A] = [L][L]H (or [R]H[R])
[A]H = [A] = [L][L]H
If [A] is symmetric and positive definite then the general LU decomposition - [P][L][D][U] - becomes [I][L][D][L]T (or [I][U]T[D][U]). [I] can be left out and [D] is normally split in halves and merged with [L] (and/or [U]). We'll express it as [A] = [L][L]T.
A cholesky decomposition is still/also an LU decomposition where [P][L][D][U] => [L][L]T.
Modifier and Type | Interface and Description |
---|---|
static interface |
Cholesky.Factory<N extends Number> |
MatrixDecomposition.Determinant<N extends Number>, MatrixDecomposition.EconomySize<N extends Number>, MatrixDecomposition.Hermitian<N extends Number>, MatrixDecomposition.Ordered<N extends Number>, MatrixDecomposition.RankRevealing<N extends Number>, MatrixDecomposition.Solver<N extends Number>, MatrixDecomposition.Values<N extends Number>
Modifier and Type | Field and Description |
---|---|
static Cholesky.Factory<BigDecimal> |
BIG
Deprecated.
v45 Use
RATIONAL instead. |
static Cholesky.Factory<ComplexNumber> |
COMPLEX |
static Cholesky.Factory<Double> |
PRIMITIVE |
static Cholesky.Factory<Quaternion> |
QUATERNION |
static Cholesky.Factory<RationalNumber> |
RATIONAL |
TYPICAL
Modifier and Type | Method and Description |
---|---|
static <N extends Number> |
equals(MatrixStore<N> matrix,
Cholesky<N> decomposition,
NumberContext context) |
default MatrixStore<N> |
getL()
|
default MatrixStore<N> |
getR()
|
boolean |
isSPD()
To use the Cholesky decomposition rather than the LU decomposition the matrix must be symmetric and
positive definite.
|
static <N extends Number> |
make(Access2D<N> typical) |
default MatrixStore<N> |
reconstruct() |
static <N extends Number> |
reconstruct(Cholesky<N> decomposition) |
compute, getInverse, getInverse, getSolution, getSolution, isSolvable
preallocate, preallocate, solve, solve
invert, invert, preallocate, preallocate
getDeterminant
calculateDeterminant
getRank, isFullRank
decompose, isComputed, reset
checkAndCompute
@Deprecated static final Cholesky.Factory<BigDecimal> BIG
RATIONAL
instead.static final Cholesky.Factory<ComplexNumber> COMPLEX
static final Cholesky.Factory<Double> PRIMITIVE
static final Cholesky.Factory<Quaternion> QUATERNION
static final Cholesky.Factory<RationalNumber> RATIONAL
static <N extends Number> boolean equals(MatrixStore<N> matrix, Cholesky<N> decomposition, NumberContext context)
static <N extends Number> MatrixStore<N> reconstruct(Cholesky<N> decomposition)
boolean isSPD()
default MatrixStore<N> getL()
default MatrixStore<N> getR()
default MatrixStore<N> reconstruct()
reconstruct
in interface MatrixDecomposition<N extends Number>
Copyright © 2018 Optimatika. All rights reserved.