/**
* <p>
* To decompose the matrix 'A' it must have full rank. 'A' is a 'm' by 'n' matrix.
* It requires about 2n*m<sup>2</sup>-2m<sup>2</sup>/3 flops.
* </p>
*
* <p>
* The matrix provided here can be of different
* dimension than the one specified in the constructor. It just has to be smaller than or equal
* to it.
* </p>
*/
//@Override
public bool decompose(ZMatrixRMaj A)
{
setExpectedMaxSize(A.numRows, A.numCols);
CommonOps_ZDRM.transpose(A, QR);
error = false;
for (int j = 0; j < minLength; j++)
{
householder(j);
updateA(j);
}
return(!error);
}
//@Override
public void transpose(ZMatrixRMaj input, ZMatrixRMaj output)
{
CommonOps_ZDRM.transpose(input, output);
}