NAME

SYNOPSIS

  SUBROUTINE CGEQLF( M, N, A, LDA, TAU, WORK, LDWORK, INFO)
  COMPLEX A(LDA,*), TAU(*), WORK(*)
  INTEGER M, N, LDA, LDWORK, INFO
 
  SUBROUTINE CGEQLF_64( M, N, A, LDA, TAU, WORK, LDWORK, INFO)
  COMPLEX A(LDA,*), TAU(*), WORK(*)
  INTEGER*8 M, N, LDA, LDWORK, INFO
 

F95 INTERFACE

  SUBROUTINE GEQLF( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], [INFO])
  COMPLEX, DIMENSION(:) :: TAU, WORK
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER :: M, N, LDA, LDWORK, INFO
 
  SUBROUTINE GEQLF_64( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], 
 *       [INFO])
  COMPLEX, DIMENSION(:) :: TAU, WORK
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER(8) :: M, N, LDA, LDWORK, INFO
 

C INTERFACE

void cgeqlf(int m, int n, complex *a, int lda, complex *tau, int *info);

void cgeqlf_64(long m, long n, complex *a, long lda, complex *tau, long *info);

PURPOSE

ARGUMENTS

* M (input)

The number of rows of the matrix A. M >= 0.

* N (input)

The number of columns of the matrix A. N >= 0.

* A (input/output)

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).

* LDA (input)

The leading dimension of the array A. LDA >= max(1,M).

* TAU (output)

The scalar factors of the elementary reflectors (see Further Details).

* WORK (workspace)

On exit, if INFO = 0, WORK(1) returns the optimal LDWORK.

* LDWORK (input)

The dimension of the array WORK. LDWORK >= max(1,N). For optimum performance LDWORK >= N*NB, where NB is the optimal blocksize.

If LDWORK = -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 LDWORK is issued by XERBLA.

* INFO (output)