orm2r#

Functions

void sorm2r(
    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,
          INT*           info
);
void sorm2r(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, INT *info)#

SORM2R overwrites the general real m by n matrix C with.

Q * C if SIDE = ‘L’ and TRANS = “N”, or Q^T * C if SIDE = ‘L’ and TRANS = “T”, or C * Q if SIDE = ‘R’ and TRANS = “N”, or C * Q^T if SIDE = ‘R’ and TRANS = “T”,

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

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

as returned by SGEQRF. Q is of order m if SIDE = ‘L’ and of order n if SIDE = ‘R’.

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 column must contain the vector which defines the elementary reflector H(i), as returned by SGEQRF in the first k columns. Dimension (lda, k).

in
lda

Leading dimension of A. If SIDE = “L”, lda >= max(1, m); if SIDE = “R”, lda >= max(1, n).

in
tau

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

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 (n) if SIDE = “L”, dimension (m) if SIDE = ‘R’.

out
info

  • = 0: successful exit

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

Functions

void dorm2r(
    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,
          INT*           info
);
void dorm2r(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, INT *info)#

DORM2R overwrites the general real m by n matrix C with.

Q * C if SIDE = ‘L’ and TRANS = “N”, or Q^T * C if SIDE = ‘L’ and TRANS = “T”, or C * Q if SIDE = ‘R’ and TRANS = “N”, or C * Q^T if SIDE = ‘R’ and TRANS = “T”,

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

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

as returned by DGEQRF. Q is of order m if SIDE = ‘L’ and of order n if SIDE = ‘R’.

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 column must contain the vector which defines the elementary reflector H(i), as returned by DGEQRF in the first k columns. Dimension (lda, k).

in
lda

Leading dimension of A. If SIDE = “L”, lda >= max(1, m); if SIDE = “R”, lda >= max(1, n).

in
tau

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

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 (n) if SIDE = “L”, dimension (m) if SIDE = ‘R’.

out
info

  • = 0: successful exit

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

On this page

This Page