LUDecompositionD Class |
Namespace: DigitalRune.Mathematics.Algebra
The LUDecompositionD type exposes the following members.
Name | Description | |
---|---|---|
LUDecompositionD |
Creates the LU 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 |
Solves the equation A * X = B.
| |
ToString | Returns a string that represents the current object. (Inherited from Object.) |
Name | Description | |
---|---|---|
Determinant |
Gets the determinant of matrix A.
| |
IsNumericallySingular |
Gets a value indicating whether the matrix U is numerically singular.
| |
L |
Gets the lower triangular matrix L. (This property returns the internal matrix,
not a copy.)
| |
PivotPermutationVector |
Gets the pivot permutation vector. (This property returns the internal array,
not a copy.)
| |
U |
Gets the upper triangular matrix U. (This property returns the internal matrix,
not a copy.)
|
The LU Decomposition computes a unit lower triangular matrix L and an upper triangular matrix U for a matrix A so that A' = L * U where A' is a row-permutation of A.
The LU Decomposition with pivoting always exists, even if the matrix is singular.
Application: LU Decomposition is the preferred way to solve a linear set of equations. This will fail if the matrix A is singular.
Use QR Decomposition for rectangular matrices A with m ≥ n.