
NAMEzgeqr2p.f SYNOPSISFunctions/Subroutinessubroutine zgeqr2p (M, N, A, LDA, TAU, WORK, INFO) Function/Subroutine Documentationsubroutine zgeqr2p (integerM, integerN, complex*16, dimension( lda, * )A, integerLDA, complex*16, dimension( * )TAU, complex*16, dimension( * )WORK, integerINFO)ZGEQR2P computes the QR factorization of a general rectangular matrix with nonnegative diagonal elements using an unblocked algorithm. Purpose:ZGEQR2P computes a QR factorization of a complex m by n matrix A: A = Q * R. M
Author:
M is INTEGER The number of rows of the matrix A. M >= 0.N N is INTEGER The number of columns of the matrix A. N >= 0.A A is COMPLEX*16 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 LDA is INTEGER The leading dimension of the array A. LDA >= max(1,M).TAU TAU is COMPLEX*16 array, dimension (min(M,N)) The scalar factors of the elementary reflectors (see Further Details).WORK WORK is COMPLEX*16 array, dimension (N)INFO INFO is INTEGER = 0: successful exit < 0: if INFO = i, the ith argument had an illegal value Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date:
September 2012
Further Details:
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:i1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), and tau in TAU(i). AuthorGenerated automatically by Doxygen for LAPACK from the source code.
Visit the GSP FreeBSD Man Page Interface. 