1ZGEQRF(1) LAPACK routine (version 3.2) ZGEQRF(1)
2
3
4
6 ZGEQRF - computes a QR factorization of a complex M-by-N matrix A
7
9 SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
10
11 INTEGER INFO, LDA, LWORK, M, N
12
13 COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * )
14
16 ZGEQRF computes a QR factorization of a complex M-by-N matrix A: A = Q
17 * R.
18
20 M (input) INTEGER
21 The number of rows of the matrix A. M >= 0.
22
23 N (input) INTEGER
24 The number of columns of the matrix A. N >= 0.
25
26 A (input/output) COMPLEX*16 array, dimension (LDA,N)
27 On entry, the M-by-N matrix A. On exit, the elements on and
28 above the diagonal of the array contain the min(M,N)-by-N upper
29 trapezoidal matrix R (R is upper triangular if m >= n); the
30 elements below the diagonal, with the array TAU, represent the
31 unitary matrix Q as a product of min(m,n) elementary reflectors
32 (see Further Details).
33
34 LDA (input) INTEGER
35 The leading dimension of the array A. LDA >= max(1,M).
36
37 TAU (output) COMPLEX*16 array, dimension (min(M,N))
38 The scalar factors of the elementary reflectors (see Further
39 Details).
40
41 WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
42 On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
43
44 LWORK (input) INTEGER
45 The dimension of the array WORK. LWORK >= max(1,N). For opti‐
46 mum performance LWORK >= N*NB, where NB is the optimal block‐
47 size. If LWORK = -1, then a workspace query is assumed; the
48 routine only calculates the optimal size of the WORK array,
49 returns this value as the first entry of the WORK array, and no
50 error message related to LWORK is issued by XERBLA.
51
52 INFO (output) INTEGER
53 = 0: successful exit
54 < 0: if INFO = -i, the i-th argument had an illegal value
55
57 The matrix Q is represented as a product of elementary reflectors
58 Q = H(1) H(2) . . . H(k), where k = min(m,n).
59 Each H(i) has the form
60 H(i) = I - tau * v * v'
61 where tau is a complex scalar, and v is a complex vector with v(1:i-1)
62 = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), and tau in
63 TAU(i).
64
65
66
67 LAPACK routine (version 3.2) November 2008 ZGEQRF(1)