orgrq#

Functions

void sorgrq(
    const INT           m,
    const INT           n,
    const INT           k,
          f32* restrict A,
    const INT           lda,
    const f32* restrict tau,
          f32* restrict work,
    const INT           lwork,
          INT*          info
);
void sorgrq(const INT m, const INT n, const INT k, f32 *restrict A, const INT lda, const f32 *restrict tau, f32 *restrict work, const INT lwork, INT *info)#

SORGRQ generates an M-by-N real matrix Q with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N.

Q = H(0) H(1) … H(k-1)

as returned by SGERQF.

This is the blocked Level 3 BLAS version of the algorithm.

Parameters

in
m

The number of rows of Q. m >= 0.

in
n

The number of columns of Q. n >= m.

in
k

The number of elementary reflectors whose product defines Q. m >= k >= 0.

inout
A

On entry, the (m-k+i)-th row must contain the vector which defines the elementary reflector H(i), for i = 0,…,k-1, as returned by SGERQF. On exit, the m-by-n matrix Q.

in
lda

The leading dimension of A. lda >= max(1, m).

in
tau

Array of dimension (k). TAU(i) is the scalar factor of H(i), as returned by SGERQF.

out
work

Workspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.

in
lwork

Dimension of work. lwork >= max(1, m). For optimal performance, lwork >= m*nb. If lwork == -1, workspace query only.

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value.

Functions

void dorgrq(
    const INT           m,
    const INT           n,
    const INT           k,
          f64* restrict A,
    const INT           lda,
    const f64* restrict tau,
          f64* restrict work,
    const INT           lwork,
          INT*          info
);
void dorgrq(const INT m, const INT n, const INT k, f64 *restrict A, const INT lda, const f64 *restrict tau, f64 *restrict work, const INT lwork, INT *info)#

DORGRQ generates an M-by-N real matrix Q with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N.

Q = H(0) H(1) … H(k-1)

as returned by DGERQF.

This is the blocked Level 3 BLAS version of the algorithm.

Parameters

in
m

The number of rows of Q. m >= 0.

in
n

The number of columns of Q. n >= m.

in
k

The number of elementary reflectors whose product defines Q. m >= k >= 0.

inout
A

On entry, the (m-k+i)-th row must contain the vector which defines the elementary reflector H(i), for i = 0,…,k-1, as returned by DGERQF. On exit, the m-by-n matrix Q.

in
lda

The leading dimension of A. lda >= max(1, m).

in
tau

Array of dimension (k). TAU(i) is the scalar factor of H(i), as returned by DGERQF.

out
work

Workspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.

in
lwork

Dimension of work. lwork >= max(1, m). For optimal performance, lwork >= m*nb. If lwork == -1, workspace query only.

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value.

On this page

This Page