Cholesky Solver
Solve SX = B for X when S is a square Hermitian positive definite matrix
Libraries:
DSP System Toolbox /
Math Functions /
Matrices and Linear Algebra /
Linear System Solvers
Description
The Cholesky Solver block solves the linear system SX = B by applying the Cholesky factorization to the input matrix, where:
S is an M-by-M square matrix input through the S port. The matrix must be Hermitian positive definite.
B is an M-by-N matrix input through the B port.
X is the M-by-N output matrix and is the unique solution to the equations.
Examples
Ports
Input
Output
Parameters
Block Characteristics
Data Types |
|
Direct Feedthrough |
|
Multidimensional Signals |
|
Variable-Size Signals |
|
Zero-Crossing Detection |
|
Algorithms
Cholesky factorization uniquely factors the Hermitian positive definite input matrix S as
where L is a lower triangular square matrix with positive diagonal elements.
The equation SX = B then becomes
which is solved for X by substituting and solving the following two triangular systems by forward and backward substitution, respectively.
Extended Capabilities
Version History
Introduced before R2006a
See Also
Blocks
- Autocorrelation LPC | Cholesky Factorization | Cholesky Inverse | LDL Solver | LU Solver | QR Solver