Cholesky Solver - Solve SX=B for X when S is square Hermitian positive definite matrix

Library

Math Functions / Matrices and Linear Algebra / Linear System Solvers

dspsolvers

Description

The Cholesky Solver block solves the linear system SX=B by applying Cholesky factorization to input matrix at the S port, which must be square (M-by-M) and Hermitian positive definite. Only the diagonal and upper triangle of the matrix are used, and any imaginary component of the diagonal entries is disregarded. The input to the B port is the right side M-by-N matrix, B. The output is the unique solution of the equations, M-by-N matrix X, and is always sample based.

When the input is not positive definite, the block reacts with the behavior specified by the Non-positive definite input parameter. The following options are available:

A length-M vector input for right side B is treated as an M-by-1 matrix.

Algorithm

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 making the substitution , and solving the following two triangular systems by forward and backward substitution, respectively.

Dialog Box

Non-positive definite input

Response to nonpositive definite matrix inputs.

Supported Data Types

See Also

Autocorrelation LPCSignal Processing Blockset
Cholesky FactorizationSignal Processing Blockset
Cholesky InverseSignal Processing Blockset
LDL SolverSignal Processing Blockset
LU SolverSignal Processing Blockset
QR SolverSignal Processing Blockset
cholMATLAB

See Linear System Solvers for related information.

  


 © 1984-2008- The MathWorks, Inc.    -   Site Help   -   Patents   -   Trademarks   -   Privacy Policy   -   Preventing Piracy   -   RSS