org.ejml.alg.block.decomposition.chol
Class BlockInnerCholesky

java.lang.Object
  extended by org.ejml.alg.block.decomposition.chol.BlockInnerCholesky

public class BlockInnerCholesky
extends Object

Performs a cholesky decomposition on an individual inner block.

Author:
Peter Abeles

Constructor Summary
BlockInnerCholesky()
           
 
Method Summary
static boolean lower(D1Submatrix64F T)
           
static boolean lower(double[] T, int indexT, int n)
          Performs an inline lower Cholesky decomposition on an inner row-major matrix.
static boolean upper(D1Submatrix64F T)
           
static boolean upper(double[] T, int indexT, int n)
          Performs an inline upper Cholesky decomposition on an inner row-major matrix.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

BlockInnerCholesky

public BlockInnerCholesky()
Method Detail

upper

public static boolean upper(D1Submatrix64F T)

lower

public static boolean lower(D1Submatrix64F T)

upper

public static boolean upper(double[] T,
                            int indexT,
                            int n)
Performs an inline upper Cholesky decomposition on an inner row-major matrix. Only the upper triangular portion of the matrix is read or written to.

Parameters:
T - Array containing an inner row-major matrix. Modified.
indexT - First index of the inner row-major matrix.
n - Number of rows and columns of the matrix.
Returns:
If the decomposition succeeded.

lower

public static boolean lower(double[] T,
                            int indexT,
                            int n)
Performs an inline lower Cholesky decomposition on an inner row-major matrix. Only the lower triangular portion of the matrix is read or written to.

Parameters:
T - Array containing an inner row-major matrix. Modified.
indexT - First index of the inner row-major matrix.
n - Number of rows and columns of the matrix.
Returns:
If the decomposition succeeded.


Copyright © 2012. All Rights Reserved.