gemlq#
Functions
-
void sgemlq(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 T, const INT tsize, f32 *restrict C, const INT ldc, f32 *restrict work, const INT lwork, INT *info)#
SGEMLQ overwrites the general real M-by-N matrix C with.
TRANS = ‘N’: Q * C C * Q TRANS = ‘T’: Q^T * C C * Q^TSIDE = 'L' SIDE = 'R'
where Q is a real orthogonal matrix defined as the product of blocked elementary reflectors computed by short wide LQ factorization (SGELQ)
Parameters
inside‘L’: apply Q or Q^T from the Left; ‘R’: apply Q or Q^T from the Right.
intrans‘N’: No transpose, apply Q; ‘T’: Transpose, apply Q^T.
inmThe number of rows of the matrix A. m >= 0.
innThe number of columns of the matrix C. n >= 0.
inkThe number of elementary reflectors whose product defines the matrix Q. If SIDE = ‘L’, m >= k >= 0; if SIDE = ‘R’, n >= k >= 0.
inADouble precision array, dimension (lda, m) if SIDE=’L’, (lda, n) if SIDE=’R’. Part of the data structure to represent Q as returned by SGELQ.
inldaThe leading dimension of the array A. lda >= max(1, k).
inTDouble precision array, dimension (max(5, tsize)). Part of the data structure to represent Q as returned by SGELQ.
intsizeThe dimension of the array T. tsize >= 5.
inoutCDouble precision array, dimension (ldc, n). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C, Q^T*C, C*Q^T, or C*Q.
inldcThe leading dimension of the array C. ldc >= max(1, m).
outworkDouble precision workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.
inlworkThe dimension of the array work. lwork >= 1. If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void sgemlq(
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 T,
const INT tsize,
f32* restrict C,
const INT ldc,
f32* restrict work,
const INT lwork,
INT* info
);
Functions
-
void dgemlq(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 T, const INT tsize, f64 *restrict C, const INT ldc, f64 *restrict work, const INT lwork, INT *info)#
DGEMLQ overwrites the general real M-by-N matrix C with.
TRANS = ‘N’: Q * C C * Q TRANS = ‘T’: Q^T * C C * Q^TSIDE = 'L' SIDE = 'R'
where Q is a real orthogonal matrix defined as the product of blocked elementary reflectors computed by short wide LQ factorization (DGELQ)
Parameters
inside‘L’: apply Q or Q^T from the Left; ‘R’: apply Q or Q^T from the Right.
intrans‘N’: No transpose, apply Q; ‘T’: Transpose, apply Q^T.
inmThe number of rows of the matrix A. m >= 0.
innThe number of columns of the matrix C. n >= 0.
inkThe number of elementary reflectors whose product defines the matrix Q. If SIDE = ‘L’, m >= k >= 0; if SIDE = ‘R’, n >= k >= 0.
inADouble precision array, dimension (lda, m) if SIDE=’L’, (lda, n) if SIDE=’R’. Part of the data structure to represent Q as returned by DGELQ.
inldaThe leading dimension of the array A. lda >= max(1, k).
inTDouble precision array, dimension (max(5, tsize)). Part of the data structure to represent Q as returned by DGELQ.
intsizeThe dimension of the array T. tsize >= 5.
inoutCDouble precision array, dimension (ldc, n). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C, Q^T*C, C*Q^T, or C*Q.
inldcThe leading dimension of the array C. ldc >= max(1, m).
outworkDouble precision workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.
inlworkThe dimension of the array work. lwork >= 1. If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void dgemlq(
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 T,
const INT tsize,
f64* restrict C,
const INT ldc,
f64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void cgemlq(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 T, const INT tsize, c64 *restrict C, const INT ldc, c64 *restrict work, const INT lwork, INT *info)#
CGEMLQ 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 blocked elementary reflectors computed by short wide LQ factorization (CGELQ)
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 the matrix A. m >= 0.
innThe number of columns of the matrix C. n >= 0.
inkThe number of elementary reflectors whose product defines the matrix Q. If SIDE = ‘L’, m >= k >= 0; if SIDE = ‘R’, n >= k >= 0.
inAComplex*16 array, dimension (lda, m) if SIDE=’L’, (lda, n) if SIDE=’R’. Part of the data structure to represent Q as returned by CGELQ.
inldaThe leading dimension of the array A. lda >= max(1, k).
inTComplex*16 array, dimension (max(5, tsize)). Part of the data structure to represent Q as returned by CGELQ.
intsizeThe dimension of the array T. tsize >= 5.
inoutCComplex*16 array, dimension (ldc, n). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C, Q^H*C, C*Q^H, or C*Q.
inldcThe leading dimension of the array C. ldc >= max(1, m).
outworkComplex*16 workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.
inlworkThe dimension of the array work. lwork >= 1. If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void cgemlq(
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 T,
const INT tsize,
c64* restrict C,
const INT ldc,
c64* restrict work,
const INT lwork,
INT* info
);
Functions
-
void zgemlq(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 T, const INT tsize, c128 *restrict C, const INT ldc, c128 *restrict work, const INT lwork, INT *info)#
ZGEMLQ 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 blocked elementary reflectors computed by short wide LQ factorization (ZGELQ)
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 the matrix A. m >= 0.
innThe number of columns of the matrix C. n >= 0.
inkThe number of elementary reflectors whose product defines the matrix Q. If SIDE = ‘L’, m >= k >= 0; if SIDE = ‘R’, n >= k >= 0.
inAComplex*16 array, dimension (lda, m) if SIDE=’L’, (lda, n) if SIDE=’R’. Part of the data structure to represent Q as returned by ZGELQ.
inldaThe leading dimension of the array A. lda >= max(1, k).
inTComplex*16 array, dimension (max(5, tsize)). Part of the data structure to represent Q as returned by ZGELQ.
intsizeThe dimension of the array T. tsize >= 5.
inoutCComplex*16 array, dimension (ldc, n). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C, Q^H*C, C*Q^H, or C*Q.
inldcThe leading dimension of the array C. ldc >= max(1, m).
outworkComplex*16 workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.
inlworkThe dimension of the array work. lwork >= 1. If lwork = -1, then a workspace query is assumed.
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value.
void zgemlq(
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 T,
const INT tsize,
c128* restrict C,
const INT ldc,
c128* restrict work,
const INT lwork,
INT* info
);