DSP Blockset
  Go to block:
    Search    Help Desk 
Cholesky Factorization    See Also

Factor a Hermitian positive definite matrix into triangular components.

Library

Linear Algebra, in Math Functions

Description

The Cholesky Factorization block uniquely factors the Hermitian positive definite input matrix S as

where L is a lower triangular square matrix with positive diagonal elements and LH denotes the Hermitian transpose of L. The block's output is a matrix whose lower triangle is L and whose upper triangle is LH.

Note that L and LH share the same diagonal in the output matrix. Cholesky factorization requires half the computation of Gaussian elimination (LU decomposition), and is always stable.

The algorithm requires that the input be square and Hermitian positive definite. When the input is not positive definite, the block reacts with the behavior specified by the Invalid input matrix parameter. The following options are available:

Dialog Box

Invalid input matrix 
Response to non-positive definite matrix inputs.

References

Golub, G. H., and C. F. Van Loan. Matrix Computations. 3rd ed. Baltimore, MD: Johns Hopkins University Press, 1996.

See Also

Backward Substitution
Cholesky Solver
LDL Factorization
LU Factorization
QR Factorization


[ Previous | Help Desk | Next ]