Cholesky Inverse
Compute inverse of Hermitian positive definite matrix using Cholesky factorization
Libraries:
DSP System Toolbox /
Math Functions /
Matrices and Linear Algebra /
Matrix Inverses
Description
The Cholesky Inverse block computes the inverse of the Hermitian positive definite input matrix S by performing Cholesky factorization.
L is a lower triangular square matrix with positive diagonal elements and L* is the Hermitian (complex conjugate) transpose of L. The block uses only the diagonal and upper triangle of the input matrix and disregards any imaginary component of the diagonal entries. Cholesky factorization requires half the computation of Gaussian elimination (LU decomposition) and is always stable.
Ports
Input
Output
Parameters
Block Characteristics
Data Types |
|
Direct Feedthrough |
|
Multidimensional Signals |
|
Variable-Size Signals |
|
Zero-Crossing Detection |
|
References
[1] Golub, G. H., and C. F. Van Loan. Matrix Computations. 3rd ed. Baltimore, MD: Johns Hopkins University Press, 1996.
Extended Capabilities
Version History
Introduced before R2006a