cgelq2.f(3) LAPACK cgelq2.f(3)NAME
subroutine cgelq2 (M, N, A, LDA, TAU, WORK, INFO)
CGELQ2 computes the LQ factorization of a general rectangular
matrix using an unblocked algorithm.
subroutine cgelq2 (integerM, integerN, complex, dimension( lda, * )A,
integerLDA, complex, dimension( * )TAU, complex, dimension( * )WORK,
CGELQ2 computes the LQ factorization of a general rectangular matrix
using an unblocked algorithm.
CGELQ2 computes an LQ factorization of a complex m by n matrix A:
A = L * Q.
M is INTEGER
The number of rows of the matrix A. M >= 0.
N is INTEGER
The number of columns of the matrix A. N >= 0.
A is COMPLEX array, dimension (LDA,N)
On entry, the m by n matrix A.
On exit, the elements on and below the diagonal of the array
contain the m by min(m,n) lower trapezoidal matrix L (L is
lower triangular if m <= n); the elements above the diagonal,
with the array TAU, represent the unitary matrix Q as a
product of elementary reflectors (see Further Details).
LDA is INTEGER
The leading dimension of the array A. LDA >= max(1,M).
TAU is COMPLEX array, dimension (min(M,N))
The scalar factors of the elementary reflectors (see Further
WORK is COMPLEX array, dimension (M)
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
The matrix Q is represented as a product of elementary reflectors
Q = H(k)**H . . . H(2)**H H(1)**H, 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(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).
Definition at line 122 of file cgelq2.f.
Generated automatically by Doxygen for LAPACK from the source code.
Version 3.4.2 Tue Sep 25 2012 cgelq2.f(3)