public interface QRDecomposition<T extends Matrix> extends DecompositionInterface<T>
QR decompositions decompose a rectangular matrix 'A' such that 'A=QR'. Where A ∈ ℜ n × m , n ≥ m, Q ∈ ℜ n × n is an orthogonal matrix, and R ∈ ℜ n × m is an upper triangular matrix. Some implementations of QR decomposition require that A has full rank.
Some features of QR decompositions:org.ejml.dense.row.linsol.qr.AdjLinearSolverQr_DDRM
Modifier and Type | Method and Description |
---|---|
T |
getQ(T Q,
boolean compact)
Returns the Q matrix from the decomposition.
|
T |
getR(T R,
boolean compact)
Returns the R matrix from the decomposition.
|
decompose, inputModified
T getQ(T Q, boolean compact)
Returns the Q matrix from the decomposition. Should only
be called after DecompositionInterface.decompose(org.ejml.data.Matrix)
has
been called.
If parameter Q is not null, then that matrix is used to store the Q matrix. Otherwise a new matrix is created.
Q
- If not null then the Q matrix is written to it. Modified.compact
- If true an m by n matrix is created, otherwise n by n.T getR(T R, boolean compact)
Returns the R matrix from the decomposition. Should only be
called after DecompositionInterface.decompose(org.ejml.data.Matrix)
has been.
If setZeros is true then an n × m matrix is required and all the elements are set. If setZeros is false then the matrix must be at least m × m and only the upper triangular elements are set.
If parameter R is not null, then that matrix is used to store the R matrix. Otherwise a new matrix is created.
R
- If not null then the R matrix is written to it. Modified.compact
- If true only the upper triangular elements are set