FactorizationRQ

Computes the RQ factorization of a general m-by-n matrix: A = R * Q. Lapack function GERQF.

Computing for type matrix<double>

bool  matrix::FactorizationRQ(
  bool         reduced,     // calculation mode reduced or complete
  matrix&         R,         // upper triangular matrix R
  matrix&       Q             // orthogonal matrix Q
  );

Computing for type matrix<float>

bool  matrix::FactorizationRQ(
  bool         reduced,     // calculation mode reduced or complete
  matrixf&       R,         // upper triangular matrix R
  matrixf&     Q             // orthogonal matrix Q
  );

Computing for type matrix<complex>

bool  matrix::FactorizationRQ(
  bool         reduced,     // calculation mode reduced or complete
  matrixc&       R,         // upper triangular matrix R
  matrixc&     Q           // unitary matrix Q
  );

Computing for type matrix<complexf>

bool  matrix::FactorizationRQ(
  bool         reduced,     // calculation mode reduced or complete
  matrixcf&       R,         // upper triangular matrix R
  matrixcf&     Q           // unitary matrix Q
  );

Parameters

reduced

[in]  Calculation mode. If reduced is true then matrices R, Q calculated with reduced dimensions (M, K), (K, N). If reduced is false it means complete calculation of matrices L, Q with dimensions (M,N), (N,N).

R

[out]  Upper triangular matrix R.

Q

[out]  Orthogonal or unitary matrix Q.

 

Return Value

Return true if successful, otherwise false in case of an error.

Note

If reduced is true

  If m <= n, matrix R is of m-by-m sizes, matrix Q is of m-by-n sizes.

  If m > n, matrix R is of m-by-n sizes, matrix Q is of n-by-n sizes.

If reduced is false, matrix R is of m-by-n sizes, matrix Q is of n-by-n sizes.