forked from Reference-LAPACK/lapack
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchetrf_aa_2stage.f
659 lines (659 loc) · 23.5 KB
/
chetrf_aa_2stage.f
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
*> \brief \b CHETRF_AA_2STAGE
*
* @generated from SRC/dsytrf_aa_2stage.f, fortran d -> c, Mon Oct 30 11:57:50 2017
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* http://www.netlib.org/lapack/explore-html/
*
*> \htmlonly
*> Download CHETRF_AA_2STAGE + dependencies
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/chetrf_aa_2stage.f">
*> [TGZ]</a>
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/chetrf_aa_2stage.f">
*> [ZIP]</a>
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/chetrf_aa_2stage.f">
*> [TXT]</a>
*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE CHETRF_AA_2STAGE( UPLO, N, A, LDA, TB, LTB, IPIV,
* IPIV2, WORK, LWORK, INFO )
*
* .. Scalar Arguments ..
* CHARACTER UPLO
* INTEGER N, LDA, LTB, LWORK, INFO
* ..
* .. Array Arguments ..
* INTEGER IPIV( * ), IPIV2( * )
* COMPLEX A( LDA, * ), TB( * ), WORK( * )
* ..
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> CHETRF_AA_2STAGE computes the factorization of a real hermitian matrix A
*> using the Aasen's algorithm. The form of the factorization is
*>
*> A = U*T*U**T or A = L*T*L**T
*>
*> where U (or L) is a product of permutation and unit upper (lower)
*> triangular matrices, and T is a hermitian band matrix with the
*> bandwidth of NB (NB is internally selected and stored in TB( 1 ), and T is
*> LU factorized with partial pivoting).
*>
*> This is the blocked version of the algorithm, calling Level 3 BLAS.
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] UPLO
*> \verbatim
*> UPLO is CHARACTER*1
*> = 'U': Upper triangle of A is stored;
*> = 'L': Lower triangle of A is stored.
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*> N is INTEGER
*> The order of the matrix A. N >= 0.
*> \endverbatim
*>
*> \param[in,out] A
*> \verbatim
*> A is COMPLEX array, dimension (LDA,N)
*> On entry, the hermitian matrix A. If UPLO = 'U', the leading
*> N-by-N upper triangular part of A contains the upper
*> triangular part of the matrix A, and the strictly lower
*> triangular part of A is not referenced. If UPLO = 'L', the
*> leading N-by-N lower triangular part of A contains the lower
*> triangular part of the matrix A, and the strictly upper
*> triangular part of A is not referenced.
*>
*> On exit, L is stored below (or above) the subdiaonal blocks,
*> when UPLO is 'L' (or 'U').
*> \endverbatim
*>
*> \param[in] LDA
*> \verbatim
*> LDA is INTEGER
*> The leading dimension of the array A. LDA >= max(1,N).
*> \endverbatim
*>
*> \param[out] TB
*> \verbatim
*> TB is COMPLEX array, dimension (LTB)
*> On exit, details of the LU factorization of the band matrix.
*> \endverbatim
*>
*> \param[in] LTB
*> \verbatim
*> The size of the array TB. LTB >= 4*N, internally
*> used to select NB such that LTB >= (3*NB+1)*N.
*>
*> If LTB = -1, then a workspace query is assumed; the
*> routine only calculates the optimal size of LTB,
*> returns this value as the first entry of TB, and
*> no error message related to LTB is issued by XERBLA.
*> \endverbatim
*>
*> \param[out] IPIV
*> \verbatim
*> IPIV is INTEGER array, dimension (N)
*> On exit, it contains the details of the interchanges, i.e.,
*> the row and column k of A were interchanged with the
*> row and column IPIV(k).
*> \endverbatim
*>
*> \param[out] IPIV2
*> \verbatim
*> IPIV is INTEGER array, dimension (N)
*> On exit, it contains the details of the interchanges, i.e.,
*> the row and column k of T were interchanged with the
*> row and column IPIV(k).
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*> WORK is COMPLEX workspace of size LWORK
*> \endverbatim
*>
*> \param[in] LWORK
*> \verbatim
*> The size of WORK. LWORK >= N, internally used to select NB
*> such that LWORK >= N*NB.
*>
*> If LWORK = -1, then a workspace query is assumed; the
*> routine only calculates the optimal size of the WORK array,
*> returns this value as the first entry of the WORK array, and
*> no error message related to LWORK is issued by XERBLA.
*> \endverbatim
*>
*> \param[out] INFO
*> \verbatim
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value.
*> > 0: if INFO = i, band LU factorization failed on i-th column
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \date December 2016
*
*> \ingroup complexSYcomputational
*
* =====================================================================
SUBROUTINE CHETRF_AA_2STAGE( UPLO, N, A, LDA, TB, LTB, IPIV,
$ IPIV2, WORK, LWORK, INFO )
*
* -- LAPACK computational routine (version 3.7.0) --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
* December 2016
*
IMPLICIT NONE
*
* .. Scalar Arguments ..
CHARACTER UPLO
INTEGER N, LDA, LTB, LWORK, INFO
* ..
* .. Array Arguments ..
INTEGER IPIV( * ), IPIV2( * )
COMPLEX A( LDA, * ), TB( * ), WORK( * )
* ..
*
* =====================================================================
* .. Parameters ..
COMPLEX ZERO, ONE
PARAMETER ( ZERO = ( 0.0E+0, 0.0E+0 ),
$ ONE = ( 1.0E+0, 0.0E+0 ) )
*
* .. Local Scalars ..
LOGICAL UPPER, TQUERY, WQUERY
INTEGER I, J, K, I1, I2, TD
INTEGER LDTB, NB, KB, NT, IINFO
COMPLEX PIV
* ..
* .. External Functions ..
LOGICAL LSAME
INTEGER ILAENV
EXTERNAL LSAME, ILAENV
* ..
* .. External Subroutines ..
EXTERNAL XERBLA
* ..
* .. Intrinsic Functions ..
INTRINSIC CONJG, MIN, MAX
* ..
* .. Executable Statements ..
*
* Test the input parameters.
*
INFO = 0
UPPER = LSAME( UPLO, 'U' )
WQUERY = ( LWORK.EQ.-1 )
TQUERY = ( LTB.EQ.-1 )
IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN
INFO = -1
ELSE IF( N.LT.0 ) THEN
INFO = -2
ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
INFO = -4
ELSE IF ( LTB .LT. 4*N .AND. .NOT.TQUERY ) THEN
INFO = -6
ELSE IF ( LWORK .LT. N .AND. .NOT.WQUERY ) THEN
INFO = -10
END IF
*
IF( INFO.NE.0 ) THEN
CALL XERBLA( 'CHETRF_AA_2STAGE', -INFO )
RETURN
END IF
*
* Answer the query
*
NB = ILAENV( 1, 'CHETRF_AA_2STAGE', UPLO, N, -1, -1, -1 )
IF( INFO.EQ.0 ) THEN
IF( TQUERY ) THEN
TB( 1 ) = (3*NB+1)*N
END IF
IF( WQUERY ) THEN
WORK( 1 ) = N*NB
END IF
END IF
IF( TQUERY .OR. WQUERY ) THEN
RETURN
END IF
*
* Quick return
*
IF ( N.EQ.0 ) THEN
RETURN
ENDIF
*
* Determine the number of the block size
*
LDTB = LTB/N
IF( LDTB .LT. 3*NB+1 ) THEN
NB = (LDTB-1)/3
END IF
IF( LWORK .LT. NB*N ) THEN
NB = LWORK/N
END IF
*
* Determine the number of the block columns
*
NT = (N+NB-1)/NB
TD = 2*NB
KB = MIN(NB, N)
*
* Initialize vectors/matrices
*
DO J = 1, KB
IPIV( J ) = J
END DO
*
* Save NB
*
TB( 1 ) = NB
*
IF( UPPER ) THEN
*
* .....................................................
* Factorize A as L*D*L**T using the upper triangle of A
* .....................................................
*
DO J = 0, NT-1
*
* Generate Jth column of W and H
*
KB = MIN(NB, N-J*NB)
DO I = 1, J-1
IF( I.EQ.1 ) THEN
* H(I,J) = T(I,I)*U(I,J) + T(I+1,I)*U(I+1,J)
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ NB, KB, 2*NB,
$ ONE, TB( TD+1 + (I*NB)*LDTB ), LDTB-1,
$ A( (I-1)*NB+1, J*NB+1 ), LDA,
$ ZERO, WORK( I*NB+1 ), N )
ELSE IF( I .EQ. J-1) THEN
* H(I,J) = T(I,I-1)*U(I-1,J) + T(I,I)*U(I,J) + T(I,I+1)*U(I+1,J)
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ NB, KB, 2*NB+KB,
$ ONE, TB( TD+NB+1 + ((I-1)*NB)*LDTB ),
$ LDTB-1,
$ A( (I-2)*NB+1, J*NB+1 ), LDA,
$ ZERO, WORK( I*NB+1 ), N )
ELSE
* H(I,J) = T(I,I-1)*U(I-1,J) + T(I,I)*U(I,J) + T(I,I+1)*U(I+1,J)
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ NB, KB, 3*NB,
$ ONE, TB( TD+NB+1 + ((I-1)*NB)*LDTB ),
$ LDTB-1,
$ A( (I-2)*NB+1, J*NB+1 ), LDA,
$ ZERO, WORK( I*NB+1 ), N )
END IF
END DO
*
* Compute T(J,J)
*
CALL CLACPY( 'Upper', KB, KB, A( J*NB+1, J*NB+1 ), LDA,
$ TB( TD+1 + (J*NB)*LDTB ), LDTB-1 )
IF( J.GT.1 ) THEN
* T(J,J) = U(1:J,J)'*H(1:J)
CALL CGEMM( 'Conjugate transpose', 'NoTranspose',
$ KB, KB, (J-1)*NB,
$ -ONE, A( 1, J*NB+1 ), LDA,
$ WORK( NB+1 ), N,
$ ONE, TB( TD+1 + (J*NB)*LDTB ), LDTB-1 )
* T(J,J) += U(J,J)'*T(J,J-1)*U(J-1,J)
CALL CGEMM( 'Conjugate transpose', 'NoTranspose',
$ KB, NB, KB,
$ ONE, A( (J-1)*NB+1, J*NB+1 ), LDA,
$ TB( TD+NB+1 + ((J-1)*NB)*LDTB ), LDTB-1,
$ ZERO, WORK( 1 ), N )
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ KB, KB, NB,
$ -ONE, WORK( 1 ), N,
$ A( (J-2)*NB+1, J*NB+1 ), LDA,
$ ONE, TB( TD+1 + (J*NB)*LDTB ), LDTB-1 )
END IF
IF( J.GT.0 ) THEN
CALL CHEGST( 1, 'Upper', KB,
$ TB( TD+1 + (J*NB)*LDTB ), LDTB-1,
$ A( (J-1)*NB+1, J*NB+1 ), LDA, IINFO )
END IF
*
* Expand T(J,J) into full format
*
DO I = 1, KB
TB( TD+1 + (J*NB+I-1)*LDTB )
$ = REAL( TB( TD+1 + (J*NB+I-1)*LDTB ) )
DO K = I+1, KB
TB( TD+(K-I)+1 + (J*NB+I-1)*LDTB )
$ = CONJG( TB( TD-(K-(I+1)) + (J*NB+K-1)*LDTB ) )
END DO
END DO
*
IF( J.LT.NT-1 ) THEN
IF( J.GT.0 ) THEN
*
* Compute H(J,J)
*
IF( J.EQ.1 ) THEN
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ KB, KB, KB,
$ ONE, TB( TD+1 + (J*NB)*LDTB ), LDTB-1,
$ A( (J-1)*NB+1, J*NB+1 ), LDA,
$ ZERO, WORK( J*NB+1 ), N )
ELSE
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ KB, KB, NB+KB,
$ ONE, TB( TD+NB+1 + ((J-1)*NB)*LDTB ),
$ LDTB-1,
$ A( (J-2)*NB+1, J*NB+1 ), LDA,
$ ZERO, WORK( J*NB+1 ), N )
END IF
*
* Update with the previous column
*
CALL CGEMM( 'Conjugate transpose', 'NoTranspose',
$ NB, N-(J+1)*NB, J*NB,
$ -ONE, WORK( NB+1 ), N,
$ A( 1, (J+1)*NB+1 ), LDA,
$ ONE, A( J*NB+1, (J+1)*NB+1 ), LDA )
END IF
*
* Copy panel to workspace to call CGETRF
*
DO K = 1, NB
CALL CCOPY( N-(J+1)*NB,
$ A( J*NB+K, (J+1)*NB+1 ), LDA,
$ WORK( 1+(K-1)*N ), 1 )
END DO
*
* Factorize panel
*
CALL CGETRF( N-(J+1)*NB, NB,
$ WORK, N,
$ IPIV( (J+1)*NB+1 ), IINFO )
c IF (IINFO.NE.0 .AND. INFO.EQ.0) THEN
c INFO = IINFO+(J+1)*NB
c END IF
*
* Copy panel back
*
DO K = 1, NB
*
* Copy only L-factor
*
CALL CCOPY( N-K-(J+1)*NB,
$ WORK( K+1+(K-1)*N ), 1,
$ A( J*NB+K, (J+1)*NB+K+1 ), LDA )
*
* Transpose U-factor to be copied back into T(J+1, J)
*
CALL CLACGV( K, WORK( 1+(K-1)*N ), 1 )
END DO
*
* Compute T(J+1, J), zero out for GEMM update
*
KB = MIN(NB, N-(J+1)*NB)
CALL CLASET( 'Full', KB, NB, ZERO, ZERO,
$ TB( TD+NB+1 + (J*NB)*LDTB) , LDTB-1 )
CALL CLACPY( 'Upper', KB, NB,
$ WORK, N,
$ TB( TD+NB+1 + (J*NB)*LDTB ), LDTB-1 )
IF( J.GT.0 ) THEN
CALL CTRSM( 'R', 'U', 'N', 'U', KB, NB, ONE,
$ A( (J-1)*NB+1, J*NB+1 ), LDA,
$ TB( TD+NB+1 + (J*NB)*LDTB ), LDTB-1 )
END IF
*
* Copy T(J,J+1) into T(J+1, J), both upper/lower for GEMM
* updates
*
DO K = 1, NB
DO I = 1, KB
TB( TD-NB+K-I+1 + (J*NB+NB+I-1)*LDTB )
$ = CONJG( TB( TD+NB+I-K+1 + (J*NB+K-1)*LDTB ) )
END DO
END DO
CALL CLASET( 'Lower', KB, NB, ZERO, ONE,
$ A( J*NB+1, (J+1)*NB+1), LDA )
*
* Apply pivots to trailing submatrix of A
*
DO K = 1, KB
* > Adjust ipiv
IPIV( (J+1)*NB+K ) = IPIV( (J+1)*NB+K ) + (J+1)*NB
*
I1 = (J+1)*NB+K
I2 = IPIV( (J+1)*NB+K )
IF( I1.NE.I2 ) THEN
* > Apply pivots to previous columns of L
CALL CSWAP( K-1, A( (J+1)*NB+1, I1 ), 1,
$ A( (J+1)*NB+1, I2 ), 1 )
* > Swap A(I1+1:M, I1) with A(I2, I1+1:M)
CALL CSWAP( I2-I1-1, A( I1, I1+1 ), LDA,
$ A( I1+1, I2 ), 1 )
CALL CLACGV( I2-I1, A( I1, I1+1 ), LDA )
CALL CLACGV( I2-I1-1, A( I1+1, I2 ), 1 )
* > Swap A(I2+1:M, I1) with A(I2+1:M, I2)
CALL CSWAP( N-I2, A( I1, I2+1 ), LDA,
$ A( I2, I2+1 ), LDA )
* > Swap A(I1, I1) with A(I2, I2)
PIV = A( I1, I1 )
A( I1, I1 ) = A( I2, I2 )
A( I2, I2 ) = PIV
* > Apply pivots to previous columns of L
IF( J.GT.0 ) THEN
CALL CSWAP( J*NB, A( 1, I1 ), 1,
$ A( 1, I2 ), 1 )
END IF
ENDIF
END DO
END IF
END DO
ELSE
*
* .....................................................
* Factorize A as L*D*L**T using the lower triangle of A
* .....................................................
*
DO J = 0, NT-1
*
* Generate Jth column of W and H
*
KB = MIN(NB, N-J*NB)
DO I = 1, J-1
IF( I.EQ.1 ) THEN
* H(I,J) = T(I,I)*L(J,I)' + T(I+1,I)'*L(J,I+1)'
CALL CGEMM( 'NoTranspose', 'Conjugate transpose',
$ NB, KB, 2*NB,
$ ONE, TB( TD+1 + (I*NB)*LDTB ), LDTB-1,
$ A( J*NB+1, (I-1)*NB+1 ), LDA,
$ ZERO, WORK( I*NB+1 ), N )
ELSE IF( I .EQ. J-1) THEN
* H(I,J) = T(I,I-1)*L(J,I-1)' + T(I,I)*L(J,I)' + T(I,I+1)*L(J,I+1)'
CALL CGEMM( 'NoTranspose', 'Conjugate transpose',
$ NB, KB, 2*NB+KB,
$ ONE, TB( TD+NB+1 + ((I-1)*NB)*LDTB ),
$ LDTB-1,
$ A( J*NB+1, (I-2)*NB+1 ), LDA,
$ ZERO, WORK( I*NB+1 ), N )
ELSE
* H(I,J) = T(I,I-1)*L(J,I-1)' + T(I,I)*L(J,I)' + T(I,I+1)*L(J,I+1)'
CALL CGEMM( 'NoTranspose', 'Conjugate transpose',
$ NB, KB, 3*NB,
$ ONE, TB( TD+NB+1 + ((I-1)*NB)*LDTB ),
$ LDTB-1,
$ A( J*NB+1, (I-2)*NB+1 ), LDA,
$ ZERO, WORK( I*NB+1 ), N )
END IF
END DO
*
* Compute T(J,J)
*
CALL CLACPY( 'Lower', KB, KB, A( J*NB+1, J*NB+1 ), LDA,
$ TB( TD+1 + (J*NB)*LDTB ), LDTB-1 )
IF( J.GT.1 ) THEN
* T(J,J) = L(J,1:J)*H(1:J)
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ KB, KB, (J-1)*NB,
$ -ONE, A( J*NB+1, 1 ), LDA,
$ WORK( NB+1 ), N,
$ ONE, TB( TD+1 + (J*NB)*LDTB ), LDTB-1 )
* T(J,J) += L(J,J)*T(J,J-1)*L(J,J-1)'
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ KB, NB, KB,
$ ONE, A( J*NB+1, (J-1)*NB+1 ), LDA,
$ TB( TD+NB+1 + ((J-1)*NB)*LDTB ), LDTB-1,
$ ZERO, WORK( 1 ), N )
CALL CGEMM( 'NoTranspose', 'Conjugate transpose',
$ KB, KB, NB,
$ -ONE, WORK( 1 ), N,
$ A( J*NB+1, (J-2)*NB+1 ), LDA,
$ ONE, TB( TD+1 + (J*NB)*LDTB ), LDTB-1 )
END IF
IF( J.GT.0 ) THEN
CALL CHEGST( 1, 'Lower', KB,
$ TB( TD+1 + (J*NB)*LDTB ), LDTB-1,
$ A( J*NB+1, (J-1)*NB+1 ), LDA, IINFO )
END IF
*
* Expand T(J,J) into full format
*
DO I = 1, KB
TB( TD+1 + (J*NB+I-1)*LDTB )
$ = REAL( TB( TD+1 + (J*NB+I-1)*LDTB ) )
DO K = I+1, KB
TB( TD-(K-(I+1)) + (J*NB+K-1)*LDTB )
$ = CONJG( TB( TD+(K-I)+1 + (J*NB+I-1)*LDTB ) )
END DO
END DO
*
IF( J.LT.NT-1 ) THEN
IF( J.GT.0 ) THEN
*
* Compute H(J,J)
*
IF( J.EQ.1 ) THEN
CALL CGEMM( 'NoTranspose', 'Conjugate transpose',
$ KB, KB, KB,
$ ONE, TB( TD+1 + (J*NB)*LDTB ), LDTB-1,
$ A( J*NB+1, (J-1)*NB+1 ), LDA,
$ ZERO, WORK( J*NB+1 ), N )
ELSE
CALL CGEMM( 'NoTranspose', 'Conjugate transpose',
$ KB, KB, NB+KB,
$ ONE, TB( TD+NB+1 + ((J-1)*NB)*LDTB ),
$ LDTB-1,
$ A( J*NB+1, (J-2)*NB+1 ), LDA,
$ ZERO, WORK( J*NB+1 ), N )
END IF
*
* Update with the previous column
*
CALL CGEMM( 'NoTranspose', 'NoTranspose',
$ N-(J+1)*NB, NB, J*NB,
$ -ONE, A( (J+1)*NB+1, 1 ), LDA,
$ WORK( NB+1 ), N,
$ ONE, A( (J+1)*NB+1, J*NB+1 ), LDA )
END IF
*
* Factorize panel
*
CALL CGETRF( N-(J+1)*NB, NB,
$ A( (J+1)*NB+1, J*NB+1 ), LDA,
$ IPIV( (J+1)*NB+1 ), IINFO )
c IF (IINFO.NE.0 .AND. INFO.EQ.0) THEN
c INFO = IINFO+(J+1)*NB
c END IF
*
* Compute T(J+1, J), zero out for GEMM update
*
KB = MIN(NB, N-(J+1)*NB)
CALL CLASET( 'Full', KB, NB, ZERO, ZERO,
$ TB( TD+NB+1 + (J*NB)*LDTB) , LDTB-1 )
CALL CLACPY( 'Upper', KB, NB,
$ A( (J+1)*NB+1, J*NB+1 ), LDA,
$ TB( TD+NB+1 + (J*NB)*LDTB ), LDTB-1 )
IF( J.GT.0 ) THEN
CALL CTRSM( 'R', 'L', 'C', 'U', KB, NB, ONE,
$ A( J*NB+1, (J-1)*NB+1 ), LDA,
$ TB( TD+NB+1 + (J*NB)*LDTB ), LDTB-1 )
END IF
*
* Copy T(J+1,J) into T(J, J+1), both upper/lower for GEMM
* updates
*
DO K = 1, NB
DO I = 1, KB
TB( TD-NB+K-I+1 + (J*NB+NB+I-1)*LDTB )
$ = CONJG( TB( TD+NB+I-K+1 + (J*NB+K-1)*LDTB ) )
END DO
END DO
CALL CLASET( 'Upper', KB, NB, ZERO, ONE,
$ A( (J+1)*NB+1, J*NB+1), LDA )
*
* Apply pivots to trailing submatrix of A
*
DO K = 1, KB
* > Adjust ipiv
IPIV( (J+1)*NB+K ) = IPIV( (J+1)*NB+K ) + (J+1)*NB
*
I1 = (J+1)*NB+K
I2 = IPIV( (J+1)*NB+K )
IF( I1.NE.I2 ) THEN
* > Apply pivots to previous columns of L
CALL CSWAP( K-1, A( I1, (J+1)*NB+1 ), LDA,
$ A( I2, (J+1)*NB+1 ), LDA )
* > Swap A(I1+1:M, I1) with A(I2, I1+1:M)
CALL CSWAP( I2-I1-1, A( I1+1, I1 ), 1,
$ A( I2, I1+1 ), LDA )
CALL CLACGV( I2-I1, A( I1+1, I1 ), 1 )
CALL CLACGV( I2-I1-1, A( I2, I1+1 ), LDA )
* > Swap A(I2+1:M, I1) with A(I2+1:M, I2)
CALL CSWAP( N-I2, A( I2+1, I1 ), 1,
$ A( I2+1, I2 ), 1 )
* > Swap A(I1, I1) with A(I2, I2)
PIV = A( I1, I1 )
A( I1, I1 ) = A( I2, I2 )
A( I2, I2 ) = PIV
* > Apply pivots to previous columns of L
IF( J.GT.0 ) THEN
CALL CSWAP( J*NB, A( I1, 1 ), LDA,
$ A( I2, 1 ), LDA )
END IF
ENDIF
END DO
*
* Apply pivots to previous columns of L
*
c CALL CLASWP( J*NB, A( 1, 1 ), LDA,
c $ (J+1)*NB+1, (J+1)*NB+KB, IPIV, 1 )
END IF
END DO
END IF
*
* Factor the band matrix
CALL CGBTRF( N, N, NB, NB, TB, LDTB, IPIV2, INFO )
*
* End of CHETRF_AA_2STAGE
*
END