LAPACK 3.12.1
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ cgemlq()

subroutine cgemlq ( character side,
character trans,
integer m,
integer n,
integer k,
complex, dimension( lda, * ) a,
integer lda,
complex, dimension( * ) t,
integer tsize,
complex, dimension( ldc, * ) c,
integer ldc,
complex, dimension( * ) work,
integer lwork,
integer info )

CGEMLQ

Purpose:
!>
!>     CGEMLQ overwrites the general real M-by-N matrix C with
!>
!>                      SIDE = 'L'     SIDE = 'R'
!>      TRANS = 'N':      Q * C          C * Q
!>      TRANS = 'C':      Q**H * C       C * Q**H
!>      where Q is a complex unitary matrix defined as the product
!>      of blocked elementary reflectors computed by short wide
!>      LQ factorization (CGELQ)
!>
!> 
Parameters
[in]SIDE
!>          SIDE is CHARACTER*1
!>          = 'L': apply Q or Q**H from the Left;
!>          = 'R': apply Q or Q**H from the Right.
!> 
[in]TRANS
!>          TRANS is CHARACTER*1
!>          = 'N':  No transpose, apply Q;
!>          = 'C':  Conjugate transpose, apply Q**H.
!> 
[in]M
!>          M is INTEGER
!>          The number of rows of the matrix A.  M >=0.
!> 
[in]N
!>          N is INTEGER
!>          The number of columns of the matrix C. N >= 0.
!> 
[in]K
!>          K is INTEGER
!>          The number of elementary reflectors whose product defines
!>          the matrix Q.
!>          If SIDE = 'L', M >= K >= 0;
!>          if SIDE = 'R', N >= K >= 0.
!> 
[in]A
!>          A is COMPLEX array, dimension
!>                               (LDA,M) if SIDE = 'L',
!>                               (LDA,N) if SIDE = 'R'
!>          Part of the data structure to represent Q as returned by CGELQ.
!> 
[in]LDA
!>          LDA is INTEGER
!>          The leading dimension of the array A. LDA >= max(1,K).
!> 
[in]T
!>          T is COMPLEX array, dimension (MAX(5,TSIZE)).
!>          Part of the data structure to represent Q as returned by CGELQ.
!> 
[in]TSIZE
!>          TSIZE is INTEGER
!>          The dimension of the array T. TSIZE >= 5.
!> 
[in,out]C
!>          C is COMPLEX array, dimension (LDC,N)
!>          On entry, the M-by-N matrix C.
!>          On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q.
!> 
[in]LDC
!>          LDC is INTEGER
!>          The leading dimension of the array C. LDC >= max(1,M).
!> 
[out]WORK
!>          (workspace) COMPLEX array, dimension (MAX(1,LWORK))
!>          On exit, if INFO = 0, WORK(1) returns the minimal LWORK.
!> 
[in]LWORK
!>          LWORK is INTEGER
!>          The dimension of the array WORK. LWORK >= 1.
!>          If LWORK = -1, then a workspace query is assumed. The routine
!>          only calculates the size of the WORK array, returns this
!>          value as WORK(1), and no error message related to WORK
!>          is issued by XERBLA.
!> 
[out]INFO
!>          INFO is INTEGER
!>          = 0:  successful exit
!>          < 0:  if INFO = -i, the i-th argument had an illegal value
!> 
Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Further Details
!>
!> These details are particular for this LAPACK implementation. Users should not
!> take them for granted. These details may change in the future, and are not likely
!> true for another LAPACK implementation. These details are relevant if one wants
!> to try to understand the code. They are not part of the interface.
!>
!> In this version,
!>
!>          T(2): row block size (MB)
!>          T(3): column block size (NB)
!>          T(6:TSIZE): data structure needed for Q, computed by
!>                           CLASWQR or CGELQT
!>
!>  Depending on the matrix dimensions M and N, and row and column
!>  block sizes MB and NB returned by ILAENV, CGELQ will use either
!>  CLASWLQ (if the matrix is wide-and-short) or CGELQT to compute
!>  the LQ factorization.
!>  This version of CGEMLQ will use either CLAMSWLQ or CGEMLQT to
!>  multiply matrix Q by another matrix.
!>  Further Details in CLAMSWLQ or CGEMLQT.
!> 

Definition at line 171 of file cgemlq.f.

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 COMPLEX 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 REAL SROUNDUP_LWORK
196 EXTERNAL lsame, sroundup_lwork
197* ..
198* .. External Subroutines ..
199 EXTERNAL clamswlq, cgemlqt, xerbla
200* ..
201* .. Intrinsic Functions ..
202 INTRINSIC int, max, min, mod
203* ..
204* .. Executable Statements ..
205*
206* Test the input arguments
207*
208 lquery = ( lwork.EQ.-1 )
209 notran = lsame( trans, 'N' )
210 tran = lsame( trans, 'C' )
211 left = lsame( side, 'L' )
212 right = lsame( side, 'R' )
213*
214 mb = int( t( 2 ) )
215 nb = int( t( 3 ) )
216 IF( left ) THEN
217 lw = n * mb
218 mn = m
219 ELSE
220 lw = m * mb
221 mn = n
222 END IF
223*
224 minmnk = min( m, n, k )
225 IF( minmnk.EQ.0 ) THEN
226 lwmin = 1
227 ELSE
228 lwmin = max( 1, lw )
229 END IF
230*
231 IF( ( nb.GT.k ) .AND. ( mn.GT.k ) ) THEN
232 IF( mod( mn - k, nb - k ) .EQ. 0 ) THEN
233 nblcks = ( mn - k ) / ( nb - k )
234 ELSE
235 nblcks = ( mn - k ) / ( nb - k ) + 1
236 END IF
237 ELSE
238 nblcks = 1
239 END IF
240*
241 info = 0
242 IF( .NOT.left .AND. .NOT.right ) THEN
243 info = -1
244 ELSE IF( .NOT.tran .AND. .NOT.notran ) THEN
245 info = -2
246 ELSE IF( m.LT.0 ) THEN
247 info = -3
248 ELSE IF( n.LT.0 ) THEN
249 info = -4
250 ELSE IF( k.LT.0 .OR. k.GT.mn ) THEN
251 info = -5
252 ELSE IF( lda.LT.max( 1, k ) ) THEN
253 info = -7
254 ELSE IF( tsize.LT.5 ) THEN
255 info = -9
256 ELSE IF( ldc.LT.max( 1, m ) ) THEN
257 info = -11
258 ELSE IF( ( lwork.LT.lwmin ) .AND. ( .NOT.lquery ) ) THEN
259 info = -13
260 END IF
261*
262 IF( info.EQ.0 ) THEN
263 work( 1 ) = sroundup_lwork( lwmin )
264 END IF
265*
266 IF( info.NE.0 ) THEN
267 CALL xerbla( 'CGEMLQ', -info )
268 RETURN
269 ELSE IF( lquery ) THEN
270 RETURN
271 END IF
272*
273* Quick return if possible
274*
275 IF( minmnk.EQ.0 ) THEN
276 RETURN
277 END IF
278*
279 IF( ( left .AND. m.LE.k ) .OR. ( right .AND. n.LE.k )
280 $ .OR. ( nb.LE.k ) .OR. ( nb.GE.max( m, n, k ) ) ) THEN
281 CALL cgemlqt( side, trans, m, n, k, mb, a, lda,
282 $ t( 6 ), mb, c, ldc, work, info )
283 ELSE
284 CALL clamswlq( side, trans, m, n, k, mb, nb, a, lda, t( 6 ),
285 $ mb, c, ldc, work, lwork, info )
286 END IF
287*
288 work( 1 ) = sroundup_lwork( lwmin )
289*
290 RETURN
291*
292* End of CGEMLQ
293*
subroutine xerbla(srname, info)
Definition cblat2.f:3285
subroutine cgemlqt(side, trans, m, n, k, mb, v, ldv, t, ldt, c, ldc, work, info)
CGEMLQT
Definition cgemlqt.f:153
subroutine clamswlq(side, trans, m, n, k, mb, nb, a, lda, t, ldt, c, ldc, work, lwork, info)
CLAMSWLQ
Definition clamswlq.f:200
logical function lsame(ca, cb)
LSAME
Definition lsame.f:48
real function sroundup_lwork(lwork)
SROUNDUP_LWORK
Here is the call graph for this function:
Here is the caller graph for this function: