QR Solver
Find minimum-norm-residual solution to AX=B
Libraries:
DSP System Toolbox /
Math Functions /
Matrices and Linear Algebra /
Linear System Solvers
Description
The QR Solver block solves the linear system AX=B, which can be overdetermined, underdetermined, or exactly determined. The block applies QR factorization to the matrix A to find the minimum-norm-residual solution to AX=B. For more details, see Algorithms.
Ports
Input
Output
Parameters
Block Characteristics
Data Types |
|
Direct Feedthrough |
|
Multidimensional Signals |
|
Variable-Size Signals |
|
Zero-Crossing Detection |
|
Algorithms
QR factorization factors a column-permuted variant (Ae) of the M-by-N input matrix A as
Ae = QR
where Q is a
M-by-min
(M,N)
unitary matrix, and R is a
min
(M,N)-by-N
upper-triangular matrix.
The factored matrix is substituted for Ae in
AeX = Be
and
QRX = Be
is solved for X by noting that Q−1 = Q* and substituting Y = Q*Be. This requires computing a matrix multiplication for Y and solving a triangular system for X.
RX = Y
Extended Capabilities
Version History
Introduced before R2006a