unmql#
Functions
-
void cunmql(const char *side, const char *trans, const INT m, const INT n, const INT k, const c64 *restrict A, const INT lda, const c64 *restrict tau, c64 *restrict C, const INT ldc, c64 *restrict work, const INT lwork, INT *info)#
CUNMQL overwrites the general complex M-by-N matrix C with.
TRANS = ‘N’: Q * C C * Q TRANS = ‘C’: Q^H * C C * Q^HSIDE = 'L' SIDE = 'R'
where Q is a complex unitary matrix defined as the product of k elementary reflectors
Q = H(k-1) … H(1) H(0)
as returned by CGEQLF. 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
inside‘L’: apply Q or Q^H from the Left; ‘R’: apply Q or Q^H from the Right.
intrans‘N’: apply Q (No transpose); ‘C’: apply Q^H (Conjugate 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 column must contain the vector which defines the elementary reflector H(i), as returned by CGEQLF in the last k columns. Dimension (lda, k).
inldaLeading dimension of A. If SIDE = “L”, lda >= max(1, m); if SIDE = “R”, lda >= max(1, n).
intauArray of dimension (k). TAU(i) is the scalar factor of H(i), as returned by CGEQLF.
inoutCOn entry, the m-by-n matrix C. On exit, C is overwritten by Q*C or Q^H*C or C*Q^H or C*Q.
inldcLeading dimension of C. ldc >= max(1, m).
outworkWorkspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.
inlworkDimension of work. If SIDE = “L”, lwork >= max(1, n); if SIDE = “R”, lwork >= max(1, m). If lwork == -1, workspace query only.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void cunmql(
const char* side,
const char* trans,
const INT m,
const INT n,
const INT k,
const c64* restrict A,
const INT lda,
const c64* restrict tau,
c64* restrict C,
const INT ldc,
c64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void zunmql(const char *side, const char *trans, const INT m, const INT n, const INT k, const c128 *restrict A, const INT lda, const c128 *restrict tau, c128 *restrict C, const INT ldc, c128 *restrict work, const INT lwork, INT *info)#
ZUNMQL overwrites the general complex M-by-N matrix C with.
TRANS = ‘N’: Q * C C * Q TRANS = ‘C’: Q^H * C C * Q^HSIDE = 'L' SIDE = 'R'
where Q is a complex unitary matrix defined as the product of k elementary reflectors
Q = H(k-1) … H(1) H(0)
as returned by ZGEQLF. 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
inside‘L’: apply Q or Q^H from the Left; ‘R’: apply Q or Q^H from the Right.
intrans‘N’: apply Q (No transpose); ‘C’: apply Q^H (Conjugate 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 column must contain the vector which defines the elementary reflector H(i), as returned by ZGEQLF in the last k columns. Dimension (lda, k).
inldaLeading dimension of A. If SIDE = “L”, lda >= max(1, m); if SIDE = “R”, lda >= max(1, n).
intauArray of dimension (k). TAU(i) is the scalar factor of H(i), as returned by ZGEQLF.
inoutCOn entry, the m-by-n matrix C. On exit, C is overwritten by Q*C or Q^H*C or C*Q^H or C*Q.
inldcLeading dimension of C. ldc >= max(1, m).
outworkWorkspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.
inlworkDimension of work. If SIDE = “L”, lwork >= max(1, n); if SIDE = “R”, lwork >= max(1, m). If lwork == -1, workspace query only.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void zunmql(
const char* side,
const char* trans,
const INT m,
const INT n,
const INT k,
const c128* restrict A,
const INT lda,
const c128* restrict tau,
c128* restrict C,
const INT ldc,
c128* restrict work,
const INT lwork,
INT* info
);