mikera.matrixx.decompose.impl.chol
Class CholeskyInner
- java.lang.Object
-
- mikera.matrixx.decompose.impl.chol.CholeskyCommon
-
- mikera.matrixx.decompose.impl.chol.CholeskyInner
-
public class CholeskyInner extends CholeskyCommon
This implementation of a Cholesky decomposition using the inner-product form. For large matrices a block implementation is better. On larger matrices the lower triangular decomposition is significantly faster. This is faster on smaller matrices than
CholeskyDecompositionBlockbut much slower on larger matrices.
-
-
Constructor Summary
Constructors Constructor and Description CholeskyInner()
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method and Description static ICholeskyResultdecompose(AMatrix mat)Computes the Cholesky LDU Decomposition (A = LDU) of a matrix.
-
-
-
Method Detail
-
decompose
public static ICholeskyResult decompose(AMatrix mat)
Computes the Cholesky LDU Decomposition (A = LDU) of a matrix.
If the matrix is not positive definite then this function will return null since it can't complete its computations. Not all errors will be found. This is an efficient way to check for positive definiteness.
- Parameters:
mat- A symmetric positive definite matrix- Returns:
- ICholeskyResult if decomposition is successful, null otherwise.
-
-
DMelt 3.0 © DataMelt by jWork.ORG