Documentation of 'mikera.matrixx.decompose.impl.chol.CholeskyInner' Java class
CholeskyInner
mikera.matrixx.decompose.impl.chol

Class 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 CholeskyDecompositionBlock but 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 ICholeskyResult decompose(AMatrix mat)
      Computes the Cholesky LDU Decomposition (A = LDU) of a matrix.
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • CholeskyInner

        public CholeskyInner()
    • 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

You see the box below because you did not login.