QRDecompositionD Class |
Namespace: DigitalRune.Mathematics.Algebra
The QRDecompositionD type exposes the following members.
Name | Description | |
---|---|---|
QRDecompositionD |
Creates the QR decomposition of the given matrix.
|
Name | Description | |
---|---|---|
Equals | (Inherited from Object.) | |
Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) | |
GetType | Gets the Type of the current instance. (Inherited from Object.) | |
MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
SolveLinearEquations |
Returns the least squares solution for the equation A * X = B.
| |
ToString | Returns a string that represents the current object. (Inherited from Object.) |
Name | Description | |
---|---|---|
H |
Gets the matrix H with the Householder vectors. (This property returns the internal matrix,
not a copy.)
| |
HasNumericallyFullRank |
Gets a value indicating whether the matrix R has full rank (numerically).
| |
Q |
Gets the orthogonal matrix Q. (This property returns the internal matrix, not a copy.)
| |
R |
Gets the upper triangular matrix R. (This property returns the internal matrix, not a copy.)
|
For an m x n matrix A with m ≥ n the QR Decomposition computes an orthogonal matrix Q and a upper triangular matrix R so that A = Q * R.
The QR Decomposition always exists, even if the matrix does not have full rank.
Application: The primary use of QR Decomposition is in computing the least squares solution for non-square sets of linear equations. This will fail if the matrix does not have full rank.