ormlq#

Functions

void sormlq(
    const char*          side,
    const char*          trans,
    const INT            m,
    const INT            n,
    const INT            k,
    const f32*  restrict A,
    const INT            lda,
    const f32*  restrict tau,
          f32*  restrict C,
    const INT            ldc,
          f32*  restrict work,
    const INT            lwork,
          INT*           info
);
void sormlq(const char *side, const char *trans, const INT m, const INT n, const INT k, const f32 *restrict A, const INT lda, const f32 *restrict tau, f32 *restrict C, const INT ldc, f32 *restrict work, const INT lwork, INT *info)#

SORMLQ overwrites the general real M-by-N matrix C with. 

         SIDE = 'L'     SIDE = 'R'
TRANS = ‘N’: Q * C C * Q TRANS = ‘T’: Q^T * C C * Q^T

where Q is a real orthogonal matrix defined as the product of k elementary reflectors

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

as returned by SGELQF. Q is of order M if SIDE = ‘L’ and of order N if SIDE = ‘R’.

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

Parameters

in
side

‘L’: apply Q or Q^T from the Left; ‘R’: apply Q or Q^T from the Right.

in
trans

‘N’: apply Q (No transpose); ‘T’: apply Q^T (Transpose).

in
m

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

in
n

The number of columns of C. n >= 0.

in
k

The number of elementary reflectors. If SIDE = “L”, m >= k >= 0; if SIDE = “R”, n >= k >= 0.

in
A

The i-th row must contain the vector which defines the elementary reflector H(i), as returned by SGELQF. Dimension (lda, m) if SIDE = “L”, (lda, n) if SIDE = ‘R’.

in
lda

Leading dimension of A. lda >= max(1, k).

in
tau

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

inout
C

On entry, the m-by-n matrix C. On exit, C is overwritten by Q*C or Q^T*C or C*Q^T or C*Q.

in
ldc

Leading dimension of C. ldc >= max(1, m).

out
work

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

in
lwork

Dimension of work. If SIDE = “L”, lwork >= max(1, n); if SIDE = “R”, lwork >= max(1, m). 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 dormlq(
    const char*          side,
    const char*          trans,
    const INT            m,
    const INT            n,
    const INT            k,
    const f64*  restrict A,
    const INT            lda,
    const f64*  restrict tau,
          f64*  restrict C,
    const INT            ldc,
          f64*  restrict work,
    const INT            lwork,
          INT*           info
);
void dormlq(const char *side, const char *trans, const INT m, const INT n, const INT k, const f64 *restrict A, const INT lda, const f64 *restrict tau, f64 *restrict C, const INT ldc, f64 *restrict work, const INT lwork, INT *info)#

DORMLQ overwrites the general real M-by-N matrix C with. 

         SIDE = 'L'     SIDE = 'R'
TRANS = ‘N’: Q * C C * Q TRANS = ‘T’: Q^T * C C * Q^T

where Q is a real orthogonal matrix defined as the product of k elementary reflectors

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

as returned by DGELQF. Q is of order M if SIDE = ‘L’ and of order N if SIDE = ‘R’.

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

Parameters

in
side

‘L’: apply Q or Q^T from the Left; ‘R’: apply Q or Q^T from the Right.

in
trans

‘N’: apply Q (No transpose); ‘T’: apply Q^T (Transpose).

in
m

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

in
n

The number of columns of C. n >= 0.

in
k

The number of elementary reflectors. If SIDE = “L”, m >= k >= 0; if SIDE = “R”, n >= k >= 0.

in
A

The i-th row must contain the vector which defines the elementary reflector H(i), as returned by DGELQF. Dimension (lda, m) if SIDE = “L”, (lda, n) if SIDE = ‘R’.

in
lda

Leading dimension of A. lda >= max(1, k).

in
tau

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

inout
C

On entry, the m-by-n matrix C. On exit, C is overwritten by Q*C or Q^T*C or C*Q^T or C*Q.

in
ldc

Leading dimension of C. ldc >= max(1, m).

out
work

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

in
lwork

Dimension of work. If SIDE = “L”, lwork >= max(1, n); if SIDE = “R”, lwork >= max(1, m). 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