LAPACK 3.12.1
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
sgemlq.f
Go to the documentation of this file.
1*> \brief \b SGEMLQ
2*
3* Definition:
4* ===========
5*
6* SUBROUTINE SGEMLQ( SIDE, TRANS, M, N, K, A, LDA, T,
7* $ TSIZE, C, LDC, WORK, LWORK, INFO )
8*
9*
10* .. Scalar Arguments ..
11* CHARACTER SIDE, TRANS
12* INTEGER INFO, LDA, M, N, K, LDT, TSIZE, LWORK, LDC
13* ..
14* .. Array Arguments ..
15* REAL A( LDA, * ), T( * ), C(LDC, * ), WORK( * )
16* ..
17*
18*> \par Purpose:
19* =============
20*>
21*> \verbatim
22*>
23*> SGEMLQ overwrites the general real M-by-N matrix C with
24*>
25*> SIDE = 'L' SIDE = 'R'
26*> TRANS = 'N': Q * C C * Q
27*> TRANS = 'T': Q**T * C C * Q**T
28*> where Q is a real orthogonal matrix defined as the product
29*> of blocked elementary reflectors computed by short wide LQ
30*> factorization (SGELQ)
31*>
32*> \endverbatim
33*
34* Arguments:
35* ==========
36*
37*> \param[in] SIDE
38*> \verbatim
39*> SIDE is CHARACTER*1
40*> = 'L': apply Q or Q**T from the Left;
41*> = 'R': apply Q or Q**T from the Right.
42*> \endverbatim
43*>
44*> \param[in] TRANS
45*> \verbatim
46*> TRANS is CHARACTER*1
47*> = 'N': No transpose, apply Q;
48*> = 'T': Transpose, apply Q**T.
49*> \endverbatim
50*>
51*> \param[in] M
52*> \verbatim
53*> M is INTEGER
54*> The number of rows of the matrix A. M >=0.
55*> \endverbatim
56*>
57*> \param[in] N
58*> \verbatim
59*> N is INTEGER
60*> The number of columns of the matrix C. N >= 0.
61*> \endverbatim
62*>
63*> \param[in] K
64*> \verbatim
65*> K is INTEGER
66*> The number of elementary reflectors whose product defines
67*> the matrix Q.
68*> If SIDE = 'L', M >= K >= 0;
69*> if SIDE = 'R', N >= K >= 0.
70*> \endverbatim
71*>
72*> \param[in] A
73*> \verbatim
74*> A is REAL array, dimension
75*> (LDA,M) if SIDE = 'L',
76*> (LDA,N) if SIDE = 'R'
77*> Part of the data structure to represent Q as returned by SGELQ.
78*> \endverbatim
79*>
80*> \param[in] LDA
81*> \verbatim
82*> LDA is INTEGER
83*> The leading dimension of the array A. LDA >= max(1,K).
84*> \endverbatim
85*>
86*> \param[in] T
87*> \verbatim
88*> T is REAL array, dimension (MAX(5,TSIZE)).
89*> Part of the data structure to represent Q as returned by SGELQ.
90*> \endverbatim
91*>
92*> \param[in] TSIZE
93*> \verbatim
94*> TSIZE is INTEGER
95*> The dimension of the array T. TSIZE >= 5.
96*> \endverbatim
97*>
98*> \param[in,out] C
99*> \verbatim
100*> C is REAL array, dimension (LDC,N)
101*> On entry, the M-by-N matrix C.
102*> On exit, C is overwritten by Q*C or Q**T*C or C*Q**T or C*Q.
103*> \endverbatim
104*>
105*> \param[in] LDC
106*> \verbatim
107*> LDC is INTEGER
108*> The leading dimension of the array C. LDC >= max(1,M).
109*> \endverbatim
110*>
111*> \param[out] WORK
112*> \verbatim
113*> (workspace) DOUBLE PRECISION array, dimension (MAX(1,LWORK))
114*> On exit, if INFO = 0, WORK(1) returns the minimal LWORK.
115*> \endverbatim
116*>
117*> \param[in] LWORK
118*> \verbatim
119*> LWORK is INTEGER
120*> The dimension of the array WORK. LWORK >= 1.
121*> If LWORK = -1, then a workspace query is assumed. The routine
122*> only calculates the size of the WORK array, returns this
123*> value as WORK(1), and no error message related to WORK
124*> is issued by XERBLA.
125*> \endverbatim
126*>
127*> \param[out] INFO
128*> \verbatim
129*> INFO is INTEGER
130*> = 0: successful exit
131*> < 0: if INFO = -i, the i-th argument had an illegal value
132*> \endverbatim
133*
134* Authors:
135* ========
136*
137*> \author Univ. of Tennessee
138*> \author Univ. of California Berkeley
139*> \author Univ. of Colorado Denver
140*> \author NAG Ltd.
141*
142*> \par Further Details
143* ====================
144*>
145*> \verbatim
146*>
147*> These details are particular for this LAPACK implementation. Users should not
148*> take them for granted. These details may change in the future, and are not likely
149*> true for another LAPACK implementation. These details are relevant if one wants
150*> to try to understand the code. They are not part of the interface.
151*>
152*> In this version,
153*>
154*> T(2): row block size (MB)
155*> T(3): column block size (NB)
156*> T(6:TSIZE): data structure needed for Q, computed by
157*> SLASWLQ or SGELQT
158*>
159*> Depending on the matrix dimensions M and N, and row and column
160*> block sizes MB and NB returned by ILAENV, SGELQ will use either
161*> SLASWLQ (if the matrix is wide-and-short) or SGELQT to compute
162*> the LQ factorization.
163*> This version of SGEMLQ will use either SLAMSWLQ or SGEMLQT to
164*> multiply matrix Q by another matrix.
165*> Further Details in SLAMSWLQ or SGEMLQT.
166*> \endverbatim
167*>
168*> \ingroup gemlq
169*>
170* =====================================================================
171 SUBROUTINE sgemlq( SIDE, TRANS, M, N, K, A, LDA, T, TSIZE,
172 $ C, LDC, WORK, LWORK, INFO )
173*
174* -- LAPACK computational routine --
175* -- LAPACK is a software package provided by Univ. of Tennessee, --
176* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
177*
178* .. Scalar Arguments ..
179 CHARACTER SIDE, TRANS
180 INTEGER INFO, LDA, M, N, K, TSIZE, LWORK, LDC
181* ..
182* .. Array Arguments ..
183 REAL A( LDA, * ), T( * ), C( LDC, * ), WORK( * )
184* ..
185*
186* =====================================================================
187*
188* ..
189* .. Local Scalars ..
190 LOGICAL LEFT, RIGHT, TRAN, NOTRAN, LQUERY
191 INTEGER MB, NB, LW, NBLCKS, MN, MINMNK, LWMIN
192* ..
193* .. External Functions ..
194 LOGICAL LSAME
195 EXTERNAL lsame
196* ..
197* .. External Functions ..
198 REAL SROUNDUP_LWORK
199 EXTERNAL sroundup_lwork
200* ..
201* .. External Subroutines ..
202 EXTERNAL slamswlq, sgemlqt, xerbla
203* ..
204* .. Intrinsic Functions ..
205 INTRINSIC int, max, min, mod
206* ..
207* .. Executable Statements ..
208*
209* Test the input arguments
210*
211 lquery = ( lwork.EQ.-1 )
212 notran = lsame( trans, 'N' )
213 tran = lsame( trans, 'T' )
214 left = lsame( side, 'L' )
215 right = lsame( side, 'R' )
216*
217 mb = int( t( 2 ) )
218 nb = int( t( 3 ) )
219 IF( left ) THEN
220 lw = n * mb
221 mn = m
222 ELSE
223 lw = m * mb
224 mn = n
225 END IF
226*
227 minmnk = min( m, n, k )
228 IF( minmnk.EQ.0 ) THEN
229 lwmin = 1
230 ELSE
231 lwmin = max( 1, lw )
232 END IF
233*
234 IF( ( nb.GT.k ) .AND. ( mn.GT.k ) ) THEN
235 IF( mod( mn - k, nb - k ) .EQ. 0 ) THEN
236 nblcks = ( mn - k ) / ( nb - k )
237 ELSE
238 nblcks = ( mn - k ) / ( nb - k ) + 1
239 END IF
240 ELSE
241 nblcks = 1
242 END IF
243*
244 info = 0
245 IF( .NOT.left .AND. .NOT.right ) THEN
246 info = -1
247 ELSE IF( .NOT.tran .AND. .NOT.notran ) THEN
248 info = -2
249 ELSE IF( m.LT.0 ) THEN
250 info = -3
251 ELSE IF( n.LT.0 ) THEN
252 info = -4
253 ELSE IF( k.LT.0 .OR. k.GT.mn ) THEN
254 info = -5
255 ELSE IF( lda.LT.max( 1, k ) ) THEN
256 info = -7
257 ELSE IF( tsize.LT.5 ) THEN
258 info = -9
259 ELSE IF( ldc.LT.max( 1, m ) ) THEN
260 info = -11
261 ELSE IF( lwork.LT.lwmin .AND. .NOT.lquery ) THEN
262 info = -13
263 END IF
264*
265 IF( info.EQ.0 ) THEN
266 work( 1 ) = sroundup_lwork( lwmin )
267 END IF
268*
269 IF( info.NE.0 ) THEN
270 CALL xerbla( 'SGEMLQ', -info )
271 RETURN
272 ELSE IF( lquery ) THEN
273 RETURN
274 END IF
275*
276* Quick return if possible
277*
278 IF( minmnk.EQ.0 ) THEN
279 RETURN
280 END IF
281*
282 IF( ( left .AND. m.LE.k ) .OR. ( right .AND. n.LE.k )
283 $ .OR. ( nb.LE.k ) .OR. ( nb.GE.max( m, n, k ) ) ) THEN
284 CALL sgemlqt( side, trans, m, n, k, mb, a, lda,
285 $ t( 6 ), mb, c, ldc, work, info )
286 ELSE
287 CALL slamswlq( side, trans, m, n, k, mb, nb, a, lda, t( 6 ),
288 $ mb, c, ldc, work, lwork, info )
289 END IF
290*
291 work( 1 ) = sroundup_lwork( lwmin )
292*
293 RETURN
294*
295* End of SGEMLQ
296*
297 END
subroutine xerbla(srname, info)
Definition cblat2.f:3285
subroutine sgemlq(side, trans, m, n, k, a, lda, t, tsize, c, ldc, work, lwork, info)
SGEMLQ
Definition sgemlq.f:173
subroutine sgemlqt(side, trans, m, n, k, mb, v, ldv, t, ldt, c, ldc, work, info)
SGEMLQT
Definition sgemlqt.f:153
subroutine slamswlq(side, trans, m, n, k, mb, nb, a, lda, t, ldt, c, ldc, work, lwork, info)
SLAMSWLQ
Definition slamswlq.f:200