/**
* A = Q<sup>T</sup>*A
*
* @param A Matrix that is being multiplied by Q<sup>T</sup>. Is modified.
*/
public void applyTranQ(DMatrixRMaj A)
{
for (int j = 0; j < minLength; j++)
{
int diagIndex = j * numRows + j;
double before = QR.data[diagIndex];
QR.data[diagIndex] = 1;
QrHelperFunctions_DDRM.rank1UpdateMultR(A, QR.data, j * numRows, gammas[j], 0, j, numRows, v);
QR.data[diagIndex] = before;
}
}
/**
* A = Q*A
*
* @param A Matrix that is being multiplied by Q. Is modified.
*/
public void applyQ(DMatrixRMaj A)
{
if (A.numRows != numRows)
{
throw new ArgumentException("A must have at least " + numRows + " rows.");
}
for (int j = minLength - 1; j >= 0; j--)
{
int diagIndex = j * numRows + j;
double before = QR.data[diagIndex];
QR.data[diagIndex] = 1;
QrHelperFunctions_DDRM.rank1UpdateMultR(A, QR.data, j * numRows, gammas[j], 0, j, numRows, v);
QR.data[diagIndex] = before;
}
}
override public DMatrixRMaj getQ(DMatrixRMaj Q, bool compact)
{
if (compact)
{
Q = UtilDecompositons_DDRM.ensureIdentity(Q, numRows, minLength);
}
else
{
Q = UtilDecompositons_DDRM.ensureIdentity(Q, numRows, numRows);
}
for (int j = rank - 1; j >= 0; j--)
{
double[] u = dataQR[j];
double vv = u[j];
u[j] = 1;
QrHelperFunctions_DDRM.rank1UpdateMultR(Q, u, gammas[j], j, j, numRows, v);
u[j] = vv;
}
return(Q);
}
public DMatrixRMaj getQ(DMatrixRMaj Q, bool compact)
{
if (compact)
{
Q = UtilDecompositons_DDRM.ensureIdentity(Q, numRows, minLength);
}
else
{
Q = UtilDecompositons_DDRM.ensureIdentity(Q, numRows, numRows);
}
// Unlike applyQ() this takes advantage of zeros in the identity matrix
// by not multiplying across all rows.
for (int j = minLength - 1; j >= 0; j--)
{
int diagIndex = j * numRows + j;
double before = QR.data[diagIndex];
QR.data[diagIndex] = 1;
QrHelperFunctions_DDRM.rank1UpdateMultR(Q, QR.data, j * numRows, gammas[j], j, j, numRows, v);
QR.data[diagIndex] = before;
}
return(Q);
}