|QRDecompose(Int32, Int32, Array2DComplexT, Array1DComplexT, Int32)|
ZGEQRF computes a QR decomposition of a real M-by-N matrix A:
A = Q * R.
M (input) INTEGER
The number of rows of the matrix A. M >= 0.
N (input) INTEGER
The number of columns of the matrix A. N >= 0.
A (input/output) ZOUBLE PRECISION 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 orthogonal matrix Q as a
product of min(m,n) elementary reflectors (see Further
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,M).
TAU (output) ZOUBLE PRECISION array, dimension (min(M,N))
The scalar factors of the elementary reflectors (see Further
WORK (workspace/output) ZOUBLE PRECISION array, dimension (LWORK)
On exit, if info = 0, WORK(1) returns the optimal LWORK.
LWORK (input) INTEGER
The dimension of the array WORK. LWORK >= max(1,N).
For optimum performance LWORK >= N*NB, where NB is
the optimal blocksize.
If LWORK = -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 LWORK is issued by XERBLA.
info (output) INTEGER
= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
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'
where tau is a real scalar, and v is a real vector with
v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit inthis. A(i+1:m,i),
and tau inthis. TAU(i).
(Overrides DecompositionOperationsTReal, TComplexQRDecompose(Int32, Int32, Array2DTComplex, Array1DTComplex, Int32).)