orml2#
Functions
-
void sorml2(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)#
SORML2 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(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’.
Parameters
inside‘L’: apply Q or Q^T from the Left; ‘R’: apply Q or Q^T from the Right.
intrans‘N’: apply Q (No transpose); ‘T’: apply Q^T (Transpose).
inmThe number of rows of C. m >= 0.
innThe number of columns of C. n >= 0.
inkThe number of elementary reflectors. If SIDE = “L”, m >= k >= 0; if SIDE = “R”, n >= k >= 0.
inAThe 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’.
inldaLeading dimension of A. lda >= max(1, k).
intauArray of dimension (k). TAU(i) is the scalar factor of H(i), as returned by SGELQF.
inoutCOn 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.
inldcLeading dimension of C. ldc >= max(1, m).
outworkWorkspace, dimension (n) if SIDE = “L”, dimension (m) if SIDE = ‘R’.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void sorml2(
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
);
Functions
-
void dorml2(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)#
DORML2 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(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’.
Parameters
inside‘L’: apply Q or Q^T from the Left; ‘R’: apply Q or Q^T from the Right.
intrans‘N’: apply Q (No transpose); ‘T’: apply Q^T (Transpose).
inmThe number of rows of C. m >= 0.
innThe number of columns of C. n >= 0.
inkThe number of elementary reflectors. If SIDE = “L”, m >= k >= 0; if SIDE = “R”, n >= k >= 0.
inAThe 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’.
inldaLeading dimension of A. lda >= max(1, k).
intauArray of dimension (k). TAU(i) is the scalar factor of H(i), as returned by DGELQF.
inoutCOn 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.
inldcLeading dimension of C. ldc >= max(1, m).
outworkWorkspace, dimension (n) if SIDE = “L”, dimension (m) if SIDE = ‘R’.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void dorml2(
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
);