Functions
magma_int_t	magma_cgeqlf (magma_int_t m, magma_int_t n, magmaFloatComplex A, magma_int_t lda, magmaFloatComplex tau, magmaFloatComplex work, magma_int_t lwork, magma_int_t info)
	CGEQLF computes a QL factorization of a COMPLEX M-by-N matrix A: A = Q * L. More...

magma_int_t	magma_dgeqlf (magma_int_t m, magma_int_t n, double A, magma_int_t lda, double tau, double work, magma_int_t lwork, magma_int_t info)
	DGEQLF computes a QL factorization of a DOUBLE PRECISION M-by-N matrix A: A = Q * L. More...

magma_int_t	magma_sgeqlf (magma_int_t m, magma_int_t n, float A, magma_int_t lda, float tau, float work, magma_int_t lwork, magma_int_t info)
	SGEQLF computes a QL factorization of a REAL M-by-N matrix A: A = Q * L. More...

magma_int_t	magma_zgeqlf (magma_int_t m, magma_int_t n, magmaDoubleComplex A, magma_int_t lda, magmaDoubleComplex tau, magmaDoubleComplex work, magma_int_t lwork, magma_int_t info)
	ZGEQLF computes a QL factorization of a COMPLEX_16 M-by-N matrix A: A = Q * L. More...

Detailed Description

Function Documentation

magma_int_t magma_cgeqlf	(	magma_int_t	m,
		magma_int_t	n,
		magmaFloatComplex *	A,
		magma_int_t	lda,
		magmaFloatComplex *	tau,
		magmaFloatComplex *	work,
		magma_int_t	lwork,
		magma_int_t *	info
	)

CGEQLF computes a QL factorization of a COMPLEX M-by-N matrix A: A = Q * L.

Parameters

[in]	m	INTEGER The number of rows of the matrix A. M >= 0.
[in]	n	INTEGER The number of columns of the matrix A. N >= 0.
[in,out]	A	COMPLEX array, dimension (LDA,N) On entry, the M-by-N matrix A. On exit, if m >= n, the lower triangle of the subarray A(m-n+1:m,1:n) contains the N-by-N lower triangular matrix L; if m <= n, the elements on and below the (n-m)-th superdiagonal contain the M-by-N lower trapezoidal matrix L; the remaining elements, with the array TAU, represent the orthogonal matrix Q as a product of elementary reflectors (see Further Details). Higher performance is achieved if A is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lda	INTEGER The leading dimension of the array A. LDA >= max(1,M).
[out]	tau	COMPLEX array, dimension (min(M,N)) The scalar factors of the elementary reflectors (see Further Details).
[out]	work	(workspace) COMPLEX array, dimension (MAX(1,LWORK)) On exit, if INFO = 0, WORK[0] returns the optimal LWORK. Higher performance is achieved if WORK is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lwork	INTEGER The dimension of the array WORK. LWORK >= max(1,N,2NB^2). For optimum performance LWORK >= max(NNB, 2*NB^2) where NB can be obtained through magma_get_cgeqlf_nb( M, N ). If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
[out]	info	INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value or another error occured, such as memory allocation failed.

Further Details

The matrix Q is represented as a product of elementary reflectors

Q = H(k) . . . H(2) H(1), where k = min(m,n).

Each H(i) has the form

H(i) = I - tau * v * v'

where tau is a complex scalar, and v is a complex vector with v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in A(1:m-k+i-1,n-k+i), and tau in TAU(i).

magma_int_t magma_dgeqlf	(	magma_int_t	m,
		magma_int_t	n,
		double *	A,
		magma_int_t	lda,
		double *	tau,
		double *	work,
		magma_int_t	lwork,
		magma_int_t *	info
	)

DGEQLF computes a QL factorization of a DOUBLE PRECISION M-by-N matrix A: A = Q * L.

Parameters

[in]	m	INTEGER The number of rows of the matrix A. M >= 0.
[in]	n	INTEGER The number of columns of the matrix A. N >= 0.
[in,out]	A	DOUBLE PRECISION array, dimension (LDA,N) On entry, the M-by-N matrix A. On exit, if m >= n, the lower triangle of the subarray A(m-n+1:m,1:n) contains the N-by-N lower triangular matrix L; if m <= n, the elements on and below the (n-m)-th superdiagonal contain the M-by-N lower trapezoidal matrix L; the remaining elements, with the array TAU, represent the orthogonal matrix Q as a product of elementary reflectors (see Further Details). Higher performance is achieved if A is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lda	INTEGER The leading dimension of the array A. LDA >= max(1,M).
[out]	tau	DOUBLE PRECISION array, dimension (min(M,N)) The scalar factors of the elementary reflectors (see Further Details).
[out]	work	(workspace) DOUBLE PRECISION array, dimension (MAX(1,LWORK)) On exit, if INFO = 0, WORK[0] returns the optimal LWORK. Higher performance is achieved if WORK is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lwork	INTEGER The dimension of the array WORK. LWORK >= max(1,N,2NB^2). For optimum performance LWORK >= max(NNB, 2*NB^2) where NB can be obtained through magma_get_dgeqlf_nb( M, N ). If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
[out]	info	INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value or another error occured, such as memory allocation failed.

Further Details

The matrix Q is represented as a product of elementary reflectors

Q = H(k) . . . H(2) H(1), where k = min(m,n).

Each H(i) has the form

H(i) = I - tau * v * v'

where tau is a real scalar, and v is a real vector with v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in A(1:m-k+i-1,n-k+i), and tau in TAU(i).

magma_int_t magma_sgeqlf	(	magma_int_t	m,
		magma_int_t	n,
		float *	A,
		magma_int_t	lda,
		float *	tau,
		float *	work,
		magma_int_t	lwork,
		magma_int_t *	info
	)

SGEQLF computes a QL factorization of a REAL M-by-N matrix A: A = Q * L.

Parameters

[in]	m	INTEGER The number of rows of the matrix A. M >= 0.
[in]	n	INTEGER The number of columns of the matrix A. N >= 0.
[in,out]	A	REAL array, dimension (LDA,N) On entry, the M-by-N matrix A. On exit, if m >= n, the lower triangle of the subarray A(m-n+1:m,1:n) contains the N-by-N lower triangular matrix L; if m <= n, the elements on and below the (n-m)-th superdiagonal contain the M-by-N lower trapezoidal matrix L; the remaining elements, with the array TAU, represent the orthogonal matrix Q as a product of elementary reflectors (see Further Details). Higher performance is achieved if A is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lda	INTEGER The leading dimension of the array A. LDA >= max(1,M).
[out]	tau	REAL array, dimension (min(M,N)) The scalar factors of the elementary reflectors (see Further Details).
[out]	work	(workspace) REAL array, dimension (MAX(1,LWORK)) On exit, if INFO = 0, WORK[0] returns the optimal LWORK. Higher performance is achieved if WORK is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lwork	INTEGER The dimension of the array WORK. LWORK >= max(1,N,2NB^2). For optimum performance LWORK >= max(NNB, 2*NB^2) where NB can be obtained through magma_get_sgeqlf_nb( M, N ). If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
[out]	info	INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value or another error occured, such as memory allocation failed.

Further Details

The matrix Q is represented as a product of elementary reflectors

Q = H(k) . . . H(2) H(1), where k = min(m,n).

Each H(i) has the form

H(i) = I - tau * v * v'

where tau is a real scalar, and v is a real vector with v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in A(1:m-k+i-1,n-k+i), and tau in TAU(i).

magma_int_t magma_zgeqlf	(	magma_int_t	m,
		magma_int_t	n,
		magmaDoubleComplex *	A,
		magma_int_t	lda,
		magmaDoubleComplex *	tau,
		magmaDoubleComplex *	work,
		magma_int_t	lwork,
		magma_int_t *	info
	)

ZGEQLF computes a QL factorization of a COMPLEX_16 M-by-N matrix A: A = Q * L.

Parameters

[in]	m	INTEGER The number of rows of the matrix A. M >= 0.
[in]	n	INTEGER The number of columns of the matrix A. N >= 0.
[in,out]	A	COMPLEX_16 array, dimension (LDA,N) On entry, the M-by-N matrix A. On exit, if m >= n, the lower triangle of the subarray A(m-n+1:m,1:n) contains the N-by-N lower triangular matrix L; if m <= n, the elements on and below the (n-m)-th superdiagonal contain the M-by-N lower trapezoidal matrix L; the remaining elements, with the array TAU, represent the orthogonal matrix Q as a product of elementary reflectors (see Further Details). Higher performance is achieved if A is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lda	INTEGER The leading dimension of the array A. LDA >= max(1,M).
[out]	tau	COMPLEX_16 array, dimension (min(M,N)) The scalar factors of the elementary reflectors (see Further Details).
[out]	work	(workspace) COMPLEX_16 array, dimension (MAX(1,LWORK)) On exit, if INFO = 0, WORK[0] returns the optimal LWORK. Higher performance is achieved if WORK is in pinned memory, e.g. allocated using magma_malloc_pinned.
[in]	lwork	INTEGER The dimension of the array WORK. LWORK >= max(1,N,2NB^2). For optimum performance LWORK >= max(NNB, 2*NB^2) where NB can be obtained through magma_get_zgeqlf_nb( M, N ). If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
[out]	info	INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value or another error occured, such as memory allocation failed.

Further Details

The matrix Q is represented as a product of elementary reflectors

Q = H(k) . . . H(2) H(1), where k = min(m,n).

Each H(i) has the form

H(i) = I - tau * v * v'

where tau is a complex scalar, and v is a complex vector with v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in A(1:m-k+i-1,n-k+i), and tau in TAU(i).

Functions

Detailed Description

Function Documentation

Further Details

Further Details

Further Details

Further Details