QR decomposition for a rectangular matrix.
For an m-by-n matrix A
with m >= n
, the QR decomposition is an m-by-n
orthogonal matrix Q
and an n-by-n upper triangular
matrix R
so that A = Q * R
.
The QR decompostion always exists, even if the matrix does not have
full rank, so the constructor will never fail. The primary use of the
QR decomposition is in the least squares solution of nonsquare systems
of simultaneous linear equations.
This will fail if IQrDecomposition.IsFullRank returns .
Instance member | Description | ||||
Full Usage:
this.IsFullRank
Returns: bool
Modifiers: abstract |
Shows if the matrix
|
||||
|
Returns the orthogonal factor
|
||||
Full Usage:
this.Solve
Parameters:
IMapackMatrix
-
Right-hand-side matrix with as many rows as A and any number of columns.
Returns: IMapackMatrix
A matrix that minimized the two norm of Q * R * X - B .
Modifiers: abstract |
Least squares solution of
|
||||
|
Returns the upper triangular factor
|