139 SUBROUTINE cgerqf( M, N, A, LDA, TAU, WORK, LWORK, INFO )
147 INTEGER info, lda, lwork, m, n
150 COMPLEX a( lda, * ), tau( * ), work( * )
157 INTEGER i, ib, iinfo, iws, k, ki, kk, ldwork, lwkopt,
158 $ mu, nb, nbmin, nu, nx
175 lquery = ( lwork.EQ.-1 )
178 ELSE IF( n.LT.0 )
THEN
180 ELSE IF( lda.LT.max( 1, m ) )
THEN
189 nb =
ilaenv( 1,
'CGERQF',
' ', m, n, -1, -1 )
194 IF( lwork.LT.max( 1, m ) .AND. .NOT.lquery )
THEN
200 CALL
xerbla(
'CGERQF', -info )
202 ELSE IF( lquery )
THEN
215 IF( nb.GT.1 .AND. nb.LT.k )
THEN
219 nx = max( 0,
ilaenv( 3,
'CGERQF',
' ', m, n, -1, -1 ) )
226 IF( lwork.LT.iws )
THEN
232 nbmin = max( 2,
ilaenv( 2,
'CGERQF',
' ', m, n, -1,
238 IF( nb.GE.nbmin .AND. nb.LT.k .AND. nx.LT.k )
THEN
243 ki = ( ( k-nx-1 ) / nb )*nb
246 DO 10 i = k - kk + ki + 1, k - kk + 1, -nb
247 ib = min( k-i+1, nb )
252 CALL
cgerq2( ib, n-k+i+ib-1, a( m-k+i, 1 ), lda, tau( i ),
254 IF( m-k+i.GT.1 )
THEN
259 CALL
clarft(
'Backward',
'Rowwise', n-k+i+ib-1, ib,
260 $ a( m-k+i, 1 ), lda, tau( i ), work, ldwork )
264 CALL
clarfb(
'Right',
'No transpose',
'Backward',
265 $
'Rowwise', m-k+i-1, n-k+i+ib-1, ib,
266 $ a( m-k+i, 1 ), lda, work, ldwork, a, lda,
267 $ work( ib+1 ), ldwork )
270 mu = m - k + i + nb - 1
271 nu = n - k + i + nb - 1
279 IF( mu.GT.0 .AND. nu.GT.0 )
280 $ CALL
cgerq2( mu, nu, a, lda, tau, work, iinfo )
subroutine cgerqf(M, N, A, LDA, TAU, WORK, LWORK, INFO)
CGERQF
integer function ilaenv(ISPEC, NAME, OPTS, N1, N2, N3, N4)
ILAENV
subroutine clarfb(SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, T, LDT, C, LDC, WORK, LDWORK)
CLARFB
subroutine clarft(DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT)
CLARFT
subroutine cgerq2(M, N, A, LDA, TAU, WORK, INFO)
CGERQ2
subroutine xerbla(SRNAME, INFO)
XERBLA