NAME

cgelqf - compute an LQ factorization of a complex M-by-N matrix A


SYNOPSIS

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

F95 INTERFACE

  SUBROUTINE GELQF( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], [INFO])
  COMPLEX, DIMENSION(:) :: TAU, WORK
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER :: M, N, LDA, LDWORK, INFO
  SUBROUTINE GELQF_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

#include <sunperf.h>

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

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


PURPOSE

cgelqf computes an LQ factorization of a complex M-by-N matrix A: A = L * Q.


ARGUMENTS


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(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in A(i,i+1:n), and tau in TAU(i).