public interface QRPDecomposition<T extends Matrix> extends 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:
A*P=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.
|
getQ, getR
decompose, inputModified
int getRank()
int[] getColPivots()