public interface QrpSparseDecomposition<T extends org.ejml.data.Matrix>
extends org.ejml.interfaces.decomposition.QRDecomposition<T>
Similar to QRDecomposition
but it can handle the rank deficient case by
performing column pivots during the decomposition. The final decomposition has the
following structure:
P_r*A*P_c=Q*R
where A is the original matrix, P is a pivot matrix, Q is an orthogonal matrix, and R is
upper triangular.
Modifier and Type | Method and Description |
---|---|
T |
getColPivotMatrix(T P)
Creates the column pivot matrix.
|
int[] |
getColPivots()
Ordering of each column after pivoting.
|
int |
getRank()
Returns the rank as determined by the algorithm.
|
T |
getRowPivotMatrix(T P)
Creates the row pivot matrix.
|
int[] |
getRowPivots()
Ordering of each row after pivoting.
|
boolean |
isColumnPivot() |
boolean |
isRowPivot() |
int getRank()
int[] getColPivots()
T getColPivotMatrix(T P)
P
- Optional storage for pivot matrix. If null a new matrix will be created.int[] getRowPivots()
T getRowPivotMatrix(T P)
P
- Optional storage for pivot matrix. If null a new matrix will be created.boolean isColumnPivot()
boolean isRowPivot()