cgeqr2p.f(3) LAPACK cgeqr2p.f(3)NAME
subroutine cgeqr2p (M, N, A, LDA, TAU, WORK, INFO)
CGEQR2P computes the QR factorization of a general rectangular
matrix with non-negative diagonal elements using an unblocked
subroutine cgeqr2p (integerM, integerN, complex, dimension( lda, * )A,
integerLDA, complex, dimension( * )TAU, complex, dimension( * )WORK,
CGEQR2P computes the QR factorization of a general rectangular matrix
with non-negative diagonal elements using an unblocked algorithm.
CGEQR2P computes a QR factorization of a complex m by n matrix A:
A = Q * R.
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 above the diagonal of the array
contain the min(m,n) by n upper trapezoidal matrix R (R is
upper triangular if m >= n); the elements below 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 (N)
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(1)H(2) . . . H(k), 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; v(i+1:m) is stored on exit in A(i+1:m,i),
and tau in TAU(i).
Definition at line 122 of file cgeqr2p.f.
Generated automatically by Doxygen for LAPACK from the source code.
Version 3.4.2 Tue Sep 25 2012 cgeqr2p.f(3)