LAPACK 3.12.0 LAPACK: Linear Algebra PACKage
Searching...
No Matches
claswlq.f
Go to the documentation of this file.
1*> \brief \b CLASWLQ
2*
3* Definition:
4* ===========
5*
6* SUBROUTINE CLASWLQ( M, N, MB, NB, A, LDA, T, LDT, WORK,
7* LWORK, INFO)
8*
9* .. Scalar Arguments ..
10* INTEGER INFO, LDA, M, N, MB, NB, LDT, LWORK
11* ..
12* .. Array Arguments ..
13* COMPLEX A( LDA, * ), T( LDT, * ), WORK( * )
14* ..
15*
16*
17*> \par Purpose:
18* =============
19*>
20*> \verbatim
21*>
22*> CLASWLQ computes a blocked Tall-Skinny LQ factorization of
23*> a complex M-by-N matrix A for M <= N:
24*>
25*> A = ( L 0 ) * Q,
26*>
27*> where:
28*>
29*> Q is a n-by-N orthogonal matrix, stored on exit in an implicit
30*> form in the elements above the diagonal of the array A and in
31*> the elements of the array T;
32*> L is a lower-triangular M-by-M matrix stored on exit in
33*> the elements on and below the diagonal of the array A.
34*> 0 is a M-by-(N-M) zero matrix, if M < N, and is not stored.
35*>
36*> \endverbatim
37*
38* Arguments:
39* ==========
40*
41*> \param[in] M
42*> \verbatim
43*> M is INTEGER
44*> The number of rows of the matrix A. M >= 0.
45*> \endverbatim
46*>
47*> \param[in] N
48*> \verbatim
49*> N is INTEGER
50*> The number of columns of the matrix A. N >= M >= 0.
51*> \endverbatim
52*>
53*> \param[in] MB
54*> \verbatim
55*> MB is INTEGER
56*> The row block size to be used in the blocked QR.
57*> M >= MB >= 1
58*> \endverbatim
59*> \param[in] NB
60*> \verbatim
61*> NB is INTEGER
62*> The column block size to be used in the blocked QR.
63*> NB > 0.
64*> \endverbatim
65*>
66*> \param[in,out] A
67*> \verbatim
68*> A is COMPLEX array, dimension (LDA,N)
69*> On entry, the M-by-N matrix A.
70*> On exit, the elements on and below the diagonal
71*> of the array contain the N-by-N lower triangular matrix L;
72*> the elements above the diagonal represent Q by the rows
73*> of blocked V (see Further Details).
74*>
75*> \endverbatim
76*>
77*> \param[in] LDA
78*> \verbatim
79*> LDA is INTEGER
80*> The leading dimension of the array A. LDA >= max(1,M).
81*> \endverbatim
82*>
83*> \param[out] T
84*> \verbatim
85*> T is COMPLEX array,
86*> dimension (LDT, N * Number_of_row_blocks)
87*> where Number_of_row_blocks = CEIL((N-M)/(NB-M))
88*> The blocked upper triangular block reflectors stored in compact form
89*> as a sequence of upper triangular blocks.
90*> See Further Details below.
91*> \endverbatim
92*>
93*> \param[in] LDT
94*> \verbatim
95*> LDT is INTEGER
96*> The leading dimension of the array T. LDT >= MB.
97*> \endverbatim
98*>
99*>
100*> \param[out] WORK
101*> \verbatim
102*> (workspace) COMPLEX array, dimension (MAX(1,LWORK))
103*>
104*> \endverbatim
105*> \param[in] LWORK
106*> \verbatim
107*> LWORK is INTEGER
108*> The dimension of the array WORK. LWORK >= MB*M.
109*> If LWORK = -1, then a workspace query is assumed; the routine
110*> only calculates the optimal size of the WORK array, returns
111*> this value as the first entry of the WORK array, and no error
112*> message related to LWORK is issued by XERBLA.
113*>
114*> \endverbatim
115*> \param[out] INFO
116*> \verbatim
117*> INFO is INTEGER
118*> = 0: successful exit
119*> < 0: if INFO = -i, the i-th argument had an illegal value
120*> \endverbatim
121*
122* Authors:
123* ========
124*
125*> \author Univ. of Tennessee
126*> \author Univ. of California Berkeley
127*> \author Univ. of Colorado Denver
128*> \author NAG Ltd.
129*
130*> \par Further Details:
131* =====================
132*>
133*> \verbatim
134*> Short-Wide LQ (SWLQ) performs LQ by a sequence of orthogonal transformations,
135*> representing Q as a product of other orthogonal matrices
136*> Q = Q(1) * Q(2) * . . . * Q(k)
137*> where each Q(i) zeros out upper diagonal entries of a block of NB rows of A:
138*> Q(1) zeros out the upper diagonal entries of rows 1:NB of A
139*> Q(2) zeros out the bottom MB-N rows of rows [1:M,NB+1:2*NB-M] of A
140*> Q(3) zeros out the bottom MB-N rows of rows [1:M,2*NB-M+1:3*NB-2*M] of A
141*> . . .
142*>
143*> Q(1) is computed by GELQT, which represents Q(1) by Householder vectors
144*> stored under the diagonal of rows 1:MB of A, and by upper triangular
145*> block reflectors, stored in array T(1:LDT,1:N).
147*>
148*> Q(i) for i>1 is computed by TPLQT, which represents Q(i) by Householder vectors
149*> stored in columns [(i-1)*(NB-M)+M+1:i*(NB-M)+M] of A, and by upper triangular
150*> block reflectors, stored in array T(1:LDT,(i-1)*M+1:i*M).
151*> The last Q(k) may use fewer rows.
153*>
154*> For more details of the overall algorithm, see the description of
155*> Sequential TSQR in Section 2.2 of [1].
156*>
157*> [1] “Communication-Optimal Parallel and Sequential QR and LU Factorizations,”
158*> J. Demmel, L. Grigori, M. Hoemmen, J. Langou,
159*> SIAM J. Sci. Comput, vol. 34, no. 1, 2012
160*> \endverbatim
161*>
162*> \ingroup laswlq
163*>
164* =====================================================================
165 SUBROUTINE claswlq( M, N, MB, NB, A, LDA, T, LDT, WORK, LWORK,
166 \$ INFO)
167*
168* -- LAPACK computational routine --
169* -- LAPACK is a software package provided by Univ. of Tennessee, --
170* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd. --
171*
172* .. Scalar Arguments ..
173 INTEGER INFO, LDA, M, N, MB, NB, LWORK, LDT
174* ..
175* .. Array Arguments ..
176 COMPLEX A( LDA, * ), WORK( * ), T( LDT, *)
177* ..
178*
179* =====================================================================
180*
181* ..
182* .. Local Scalars ..
183 LOGICAL LQUERY
184 INTEGER I, II, KK, CTR
185* ..
186* .. EXTERNAL FUNCTIONS ..
187 LOGICAL LSAME
188 INTEGER ILAENV
189 REAL SROUNDUP_LWORK
190 EXTERNAL lsame, ilaenv, sroundup_lwork
191* .. EXTERNAL SUBROUTINES ..
192 EXTERNAL cgelqt, ctplqt, xerbla
193* .. INTRINSIC FUNCTIONS ..
194 INTRINSIC max, min, mod
195* ..
196* .. EXECUTABLE STATEMENTS ..
197*
198* TEST THE INPUT ARGUMENTS
199*
200 info = 0
201*
202 lquery = ( lwork.EQ.-1 )
203*
204 IF( m.LT.0 ) THEN
205 info = -1
206 ELSE IF( n.LT.0 .OR. n.LT.m ) THEN
207 info = -2
208 ELSE IF( mb.LT.1 .OR. ( mb.GT.m .AND. m.GT.0 )) THEN
209 info = -3
210 ELSE IF( nb.LE.0 ) THEN
211 info = -4
212 ELSE IF( lda.LT.max( 1, m ) ) THEN
213 info = -6
214 ELSE IF( ldt.LT.mb ) THEN
215 info = -8
216 ELSE IF( ( lwork.LT.m*mb) .AND. (.NOT.lquery) ) THEN
217 info = -10
218 END IF
219 IF( info.EQ.0) THEN
220 work(1) = sroundup_lwork(mb*m)
221 END IF
222*
223 IF( info.NE.0 ) THEN
224 CALL xerbla( 'CLASWLQ', -info )
225 RETURN
226 ELSE IF (lquery) THEN
227 RETURN
228 END IF
229*
230* Quick return if possible
231*
232 IF( min(m,n).EQ.0 ) THEN
233 RETURN
234 END IF
235*
236* The LQ Decomposition
237*
238 IF((m.GE.n).OR.(nb.LE.m).OR.(nb.GE.n)) THEN
239 CALL cgelqt( m, n, mb, a, lda, t, ldt, work, info)
240 RETURN
241 END IF
242*
243 kk = mod((n-m),(nb-m))
244 ii=n-kk+1
245*
246* Compute the LQ factorization of the first block A(1:M,1:NB)
247*
248 CALL cgelqt( m, nb, mb, a(1,1), lda, t, ldt, work, info)
249 ctr = 1
250*
251 DO i = nb+1, ii-nb+m , (nb-m)
252*
253* Compute the QR factorization of the current block A(1:M,I:I+NB-M)
254*
255 CALL ctplqt( m, nb-m, 0, mb, a(1,1), lda, a( 1, i ),
256 \$ lda, t(1,ctr*m+1),
257 \$ ldt, work, info )
258 ctr = ctr + 1
259 END DO
260*
261* Compute the QR factorization of the last block A(1:M,II:N)
262*
263 IF (ii.LE.n) THEN
264 CALL ctplqt( m, kk, 0, mb, a(1,1), lda, a( 1, ii ),
265 \$ lda, t(1,ctr*m+1), ldt,
266 \$ work, info )
267 END IF
268*
269 work( 1 ) = sroundup_lwork(m * mb)
270 RETURN
271*
272* End of CLASWLQ
273*
274 END
subroutine xerbla(srname, info)
Definition cblat2.f:3285
subroutine cgelqt(m, n, mb, a, lda, t, ldt, work, info)
CGELQT
Definition cgelqt.f:124
subroutine claswlq(m, n, mb, nb, a, lda, t, ldt, work, lwork, info)
CLASWLQ
Definition claswlq.f:167
subroutine ctplqt(m, n, l, mb, a, lda, b, ldb, t, ldt, work, info)
CTPLQT
Definition ctplqt.f:174