unmlq#
Functions
-
void cunmlq(const char *side, const char *trans, const INT m, const INT n, const INT k, c64 *restrict A, const INT lda, const c64 *restrict tau, c64 *restrict C, const INT ldc, c64 *restrict work, const INT lwork, INT *info)#
CUNMLQ 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)**H … H(2)**H H(1)**H
as returned by CGELQF. Q is of order M if SIDE = ‘L’ and of order N if SIDE = ‘R’.
Parameters
inside‘L’: apply Q or Q^H from the Left; ‘R’: apply Q or Q^H from the Right.
intrans‘N’: No transpose, apply Q; ‘C’: Conjugate transpose, apply Q^H.
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 CGELQF. 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 CGELQF.
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 cunmlq(
const char* side,
const char* trans,
const INT m,
const INT n,
const INT k,
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 zunmlq(const char *side, const char *trans, const INT m, const INT n, const INT k, c128 *restrict A, const INT lda, const c128 *restrict tau, c128 *restrict C, const INT ldc, c128 *restrict work, const INT lwork, INT *info)#
ZUNMLQ 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)**H … H(2)**H H(1)**H
as returned by ZGELQF. Q is of order M if SIDE = ‘L’ and of order N if SIDE = ‘R’.
Parameters
inside‘L’: apply Q or Q^H from the Left; ‘R’: apply Q or Q^H from the Right.
intrans‘N’: No transpose, apply Q; ‘C’: Conjugate transpose, apply Q^H.
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 ZGELQF. 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 ZGELQF.
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 zunmlq(
const char* side,
const char* trans,
const INT m,
const INT n,
const INT k,
c128* restrict A,
const INT lda,
const c128* restrict tau,
c128* restrict C,
const INT ldc,
c128* restrict work,
const INT lwork,
INT* info
);