GenericDecompositionOperations<T>.CholeskyDecompose Method

public override void CholeskyDecompose(
	MatrixTriangle storedTriangle,
	int n,
	Array2D<T> a,
	out int info
)

Public Overrides Sub CholeskyDecompose ( 
	storedTriangle As MatrixTriangle,
	n As Integer,
	a As Array2D(Of T),
	<OutAttribute> ByRef info As Integer
)

public:
virtual void CholeskyDecompose(
	MatrixTriangle storedTriangle, 
	int n, 
	Array2D<T> a, 
	[OutAttribute] int% info
) override

abstract CholeskyDecompose : 
        storedTriangle : MatrixTriangle * 
        n : int * 
        a : Array2D<'T> * 
        info : int byref -> unit 
override CholeskyDecompose : 
        storedTriangle : MatrixTriangle * 
        n : int * 
        a : Array2D<'T> * 
        info : int byref -> unit 

Parameters

storedTriangle  MatrixTriangle

            = 'U':  Upper triangle of A is stored;
            = 'L':  Lower triangle of A is stored.
            

n  Int32

            The order of the matrix A.  N >= 0.
            

a  Array2D<T>

            Dimension (LDA,N)
            On entry, the symmetric matrix A.  If UPLO = 'U', the leading
            N-by-N upper triangular part of A contains the upper
            triangular part of the matrix A, and the strictly lower
            triangular part of A is not referenced.  If UPLO = 'L', the
            leading N-by-N lower triangular part of A contains the lower
            triangular part of the matrix A, and the strictly upper
            triangular part of A is not referenced.
            On exit, if info = 0, the factor U or L from the Cholesky
            factorization A = UT*U or A = L*LT.
            

            The leading dimension of the array A.  LDA >= max(1,N).
            

info  Int32

info is INTEGER
            = 0:  successful exit
            < 0:  if info = -i, the i-th argument had an illegal value
            > 0:  if info = i, the leading minor of order i is not
                  positive definite, and the factorization could not be
                  completed.
            

            The factorization has the form
               A = UT * U,  if UPLO = 'U', or
               A = L  * LT,  if UPLO = 'L',
            where U is an upper triangular matrix and L is lower triangular.
            This is the block version of the algorithm, calling Level 3 BLAS.
            

This method corresponds to the LAPACK routine DPOTRF.

public override void CholeskyDecompose(
	MatrixTriangle storedTriangle,
	int n,
	Array2D<Complex<T>> a,
	out int info
)

Public Overrides Sub CholeskyDecompose ( 
	storedTriangle As MatrixTriangle,
	n As Integer,
	a As Array2D(Of Complex(Of T)),
	<OutAttribute> ByRef info As Integer
)

public:
virtual void CholeskyDecompose(
	MatrixTriangle storedTriangle, 
	int n, 
	Array2D<Complex<T>> a, 
	[OutAttribute] int% info
) override

abstract CholeskyDecompose : 
        storedTriangle : MatrixTriangle * 
        n : int * 
        a : Array2D<Complex<'T>> * 
        info : int byref -> unit 
override CholeskyDecompose : 
        storedTriangle : MatrixTriangle * 
        n : int * 
        a : Array2D<Complex<'T>> * 
        info : int byref -> unit 

Parameters

storedTriangle  MatrixTriangle

A MatrixTriangle value that indicates whether the matrix components are stored in the upper or lower triangular part.

n  Int32

The number of rows and columns of the matrix.

a  Array2D<Complex<T>>

A complex array that contains the elements of the matrix.

info  Int32

On return, indicates error conditions.

Reference