.TH "SRC/cgeqlf.f" 3 "Version 3.12.0" "LAPACK" \" -*- nroff -*- .ad l .nh .SH NAME SRC/cgeqlf.f .SH SYNOPSIS .br .PP .SS "Functions/Subroutines" .in +1c .ti -1c .RI "subroutine \fBcgeqlf\fP (m, n, a, lda, tau, work, lwork, info)" .br .RI "\fBCGEQLF\fP " .in -1c .SH "Function/Subroutine Documentation" .PP .SS "subroutine cgeqlf (integer m, integer n, complex, dimension( lda, * ) a, integer lda, complex, dimension( * ) tau, complex, dimension( * ) work, integer lwork, integer info)" .PP \fBCGEQLF\fP .PP \fBPurpose:\fP .RS 4 .PP .nf !> !> CGEQLF computes a QL factorization of a complex M-by-N matrix A: !> A = Q * L\&. !> .fi .PP .RE .PP \fBParameters\fP .RS 4 \fIM\fP .PP .nf !> M is INTEGER !> The number of rows of the matrix A\&. M >= 0\&. !> .fi .PP .br \fIN\fP .PP .nf !> N is INTEGER !> The number of columns of the matrix A\&. N >= 0\&. !> .fi .PP .br \fIA\fP .PP .nf !> A is 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 !> unitary matrix Q as a product of elementary reflectors !> (see Further Details)\&. !> .fi .PP .br \fILDA\fP .PP .nf !> LDA is INTEGER !> The leading dimension of the array A\&. LDA >= max(1,M)\&. !> .fi .PP .br \fITAU\fP .PP .nf !> TAU is COMPLEX array, dimension (min(M,N)) !> The scalar factors of the elementary reflectors (see Further !> Details)\&. !> .fi .PP .br \fIWORK\fP .PP .nf !> WORK is COMPLEX array, dimension (MAX(1,LWORK)) !> On exit, if INFO = 0, WORK(1) returns the optimal LWORK\&. !> .fi .PP .br \fILWORK\fP .PP .nf !> LWORK is INTEGER !> The dimension of the array WORK\&. !> LWORK >= 1, if MIN(M,N) = 0, and LWORK >= N, otherwise\&. !> For optimum performance LWORK >= N*NB, where NB is !> the optimal blocksize\&. !> !> 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\&. !> .fi .PP .br \fIINFO\fP .PP .nf !> INFO is INTEGER !> = 0: successful exit !> < 0: if INFO = -i, the i-th argument had an illegal value !> .fi .PP .RE .PP \fBAuthor\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP \fBFurther Details:\fP .RS 4 .PP .nf !> !> 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**H !> !> 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)\&. !> .fi .PP .RE .PP .PP Definition at line \fB138\fP of file \fBcgeqlf\&.f\fP\&. .SH "Author" .PP Generated automatically by Doxygen for LAPACK from the source code\&.