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
|
SUBROUTINE BDTREXC( N, T, LDT, IFST, ILST, NITRAF, ITRAF,
$ NDTRAF, DTRAF, WORK, INFO )
IMPLICIT NONE
*
*
* -- LAPACK routine (version 3.0) --
* Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
* Courant Institute, Argonne National Lab, and Rice University
* March 31, 1993
*
* .. Scalar Arguments ..
INTEGER IFST, ILST, INFO, LDT, N, NDTRAF, NITRAF
* ..
* .. Array Arguments ..
INTEGER ITRAF( * )
DOUBLE PRECISION DTRAF( * ), T( LDT, * ), WORK( * )
* ..
*
* Purpose
* =======
*
* BDTREXC reorders the real Schur factorization of a real matrix
* A = Q*T*Q**T, so that the diagonal block of T with row index IFST is
* moved to row ILST.
*
* The real Schur form T is reordered by an orthogonal similarity
* transformation Z**T*T*Z. In contrast to the LAPACK routine DTREXC,
* the orthogonal matrix Z is not explicitly constructed but
* represented by paramaters contained in the arrays ITRAF and DTRAF,
* see further details.
*
* T must be in Schur canonical form (as returned by DHSEQR), that is,
* block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
* 2-by-2 diagonal block has its diagonal elements equal and its
* off-diagonal elements of opposite sign.
*
* Arguments
* =========
*
* N (input) INTEGER
* The order of the matrix T. N >= 0.
*
* T (input/output) DOUBLE PRECISION array, dimension (LDT,N)
* On entry, the upper quasi-triangular matrix T, in Schur
* Schur canonical form.
* On exit, the reordered upper quasi-triangular matrix, again
* in Schur canonical form.
*
* LDT (input) INTEGER
* The leading dimension of the array T. LDT >= max(1,N).
*
* IFST (input/output) INTEGER
* ILST (input/output) INTEGER
* Specify the reordering of the diagonal blocks of T.
* The block with row index IFST is moved to row ILST, by a
* sequence of transpositions between adjacent blocks.
* On exit, if IFST pointed on entry to the second row of a
* 2-by-2 block, it is changed to point to the first row; ILST
* always points to the first row of the block in its final
* position (which may differ from its input value by +1 or -1).
* 1 <= IFST <= N; 1 <= ILST <= N.
*
* NITRAF (input/output) INTEGER
* On entry, length of the array ITRAF.
* As a minimum requirement, NITRAF >= max(1,|ILST-IFST|).
* If there are 2-by-2 blocks in T then NITRAF must be larger;
* a safe choice is NITRAF >= max(1,2*|ILST-IFST|).
* On exit, actual length of the array ITRAF.
*
* ITRAF (output) INTEGER array, length NITRAF
* List of parameters for representing the transformation
* matrix Z, see further details.
*
* NDTRAF (input/output) INTEGER
* On entry, length of the array DTRAF.
* As a minimum requirement, NDTRAF >= max(1,2*|ILST-IFST|).
* If there are 2-by-2 blocks in T then NDTRAF must be larger;
* a safe choice is NDTRAF >= max(1,5*|ILST-IFST|).
* On exit, actual length of the array DTRAF.
*
* DTRAF (output) DOUBLE PRECISION array, length NDTRAF
* List of parameters for representing the transformation
* matrix Z, see further details.
*
* WORK (workspace) DOUBLE PRECISION array, dimension (N)
*
* INFO (output) INTEGER
* = 0: successful exit
* < 0: if INFO = -i, the i-th argument had an illegal value
* = 1: two adjacent blocks were too close to swap (the problem
* is very ill-conditioned); T may have been partially
* reordered, and ILST points to the first row of the
* current position of the block being moved.
* = 2: the 2 by 2 block to be reordered split into two 1 by 1
* blocks and the second block failed to swap with an
* adjacent block. ILST points to the first row of the
* current position of the whole block being moved.
*
* Further Details
* ===============
*
* The orthogonal transformation matrix Z is a product of NITRAF
* elementary orthogonal transformations. The parameters defining these
* transformations are stored in the arrays ITRAF and DTRAF as follows:
*
* Consider the i-th transformation acting on rows/columns POS,
* POS+1, ... If this transformation is
*
* (1) a Givens rotation with cosine C and sine S then
*
* ITRAF(i) = POS,
* DTRAF(j) = C, DTRAF(j+1) = S;
*
* (2) a Householder reflector H = I - tau * v * v' with
* v = [ 1; v2; v3 ] then
*
* ITRAF(i) = N + POS,
* DTRAF(j) = tau, DTRAF(j+1) = v2, DTRAF(j+2) = v3;
*
* (3) a Householder reflector H = I - tau * v * v' with
* v = [ v1; v2; 1 ] then
*
* ITRAF(i) = 2*N + POS,
* DTRAF(j) = v1, DTRAF(j+1) = v2, DTRAF(j+2) = tau;
*
* Note that the parameters in DTRAF are stored consecutively.
*
* =====================================================================
*
* .. Parameters ..
DOUBLE PRECISION ZERO
PARAMETER ( ZERO = 0.0D+0 )
INTEGER DLNGTH(3), ILNGTH(3)
* ..
* .. Local Scalars ..
INTEGER CDTRAF, CITRAF, LDTRAF, LITRAF, HERE, I, NBF,
$ NBL, NBNEXT
* ..
* .. External Functions ..
LOGICAL LSAME
EXTERNAL LSAME
* ..
* .. External Subroutines ..
EXTERNAL BDLAEXC, XERBLA
* ..
* .. Intrinsic Functions ..
INTRINSIC ABS, MAX
* .. Data Statements ..
c DATA ( ILNGTH(I), I = 1, 3 ) / 1, 2, 4 /
c DATA ( DLNGTH(I), I = 1, 3 ) / 2, 5, 10 /
DATA ILNGTH(1)/1/, ILNGTH(2)/2/, ILNGTH(3)/4/
DATA DLNGTH(1)/2/, DLNGTH(2)/5/, DLNGTH(3)/10/
* ..
* .. Executable Statements ..
*
* Decode and test the input arguments.
*
INFO = 0
IF( N.LT.0 ) THEN
INFO = -1
ELSE IF( LDT.LT.MAX( 1, N ) ) THEN
INFO = -3
ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN
INFO = -4
ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN
INFO = -5
ELSE IF ( NITRAF.LT.MAX( 1, ABS( ILST-IFST ) ) ) THEN
INFO = -6
ELSE IF ( NDTRAF.LT.MAX( 1, 2*ABS( ILST-IFST ) ) ) THEN
INFO = -8
END IF
IF( INFO.NE.0 ) THEN
CALL XERBLA( 'DTREXC', -INFO )
RETURN
END IF
*
* Quick return if possible
*
IF( N.LE.1 )
$ RETURN
CITRAF = 1
CDTRAF = 1
*
* Determine the first row of specified block
* and find out it is 1 by 1 or 2 by 2.
*
IF( IFST.GT.1 ) THEN
IF( T( IFST, IFST-1 ).NE.ZERO )
$ IFST = IFST - 1
END IF
NBF = 1
IF( IFST.LT.N ) THEN
IF( T( IFST+1, IFST ).NE.ZERO )
$ NBF = 2
END IF
*
* Determine the first row of the final block
* and find out it is 1 by 1 or 2 by 2.
*
IF( ILST.GT.1 ) THEN
IF( T( ILST, ILST-1 ).NE.ZERO )
$ ILST = ILST - 1
END IF
NBL = 1
IF( ILST.LT.N ) THEN
IF( T( ILST+1, ILST ).NE.ZERO )
$ NBL = 2
END IF
*
IF( IFST.EQ.ILST )
$ RETURN
*
IF( IFST.LT.ILST ) THEN
*
* Update ILST
*
IF( NBF.EQ.2 .AND. NBL.EQ.1 )
$ ILST = ILST - 1
IF( NBF.EQ.1 .AND. NBL.EQ.2 )
$ ILST = ILST + 1
*
HERE = IFST
*
10 CONTINUE
*
* Swap block with next one below
*
IF( NBF.EQ.1 .OR. NBF.EQ.2 ) THEN
*
* Current block either 1 by 1 or 2 by 2
*
NBNEXT = 1
IF( HERE+NBF+1.LE.N ) THEN
IF( T( HERE+NBF+1, HERE+NBF ).NE.ZERO )
$ NBNEXT = 2
END IF
*
LITRAF = ILNGTH(NBF+NBNEXT-1)
LDTRAF = DLNGTH(NBF+NBNEXT-1)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE, NBF, NBNEXT, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
IF( INFO.NE.0 ) THEN
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
RETURN
END IF
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE + NBNEXT
*
* Test if 2 by 2 block breaks into two 1 by 1 blocks
*
IF( NBF.EQ.2 ) THEN
IF( T( HERE+1, HERE ).EQ.ZERO )
$ NBF = 3
END IF
*
ELSE
*
* Current block consists of two 1 by 1 blocks each of which
* must be swapped individually
*
NBNEXT = 1
IF( HERE+3.LE.N ) THEN
IF( T( HERE+3, HERE+2 ).NE.ZERO )
$ NBNEXT = 2
END IF
LITRAF = ILNGTH(NBNEXT)
LDTRAF = DLNGTH(NBNEXT)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE+1, 1, NBNEXT, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
IF( INFO.NE.0 ) THEN
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
RETURN
END IF
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
*
IF( NBNEXT.EQ.1 ) THEN
*
* Swap two 1 by 1 blocks, no problems possible
*
LITRAF = ILNGTH(1)
LDTRAF = DLNGTH(1)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE, 1, NBNEXT, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE + 1
ELSE
*
* Recompute NBNEXT in case 2 by 2 split
*
IF( T( HERE+2, HERE+1 ).EQ.ZERO )
$ NBNEXT = 1
IF( NBNEXT.EQ.2 ) THEN
*
* 2 by 2 Block did not split
*
LITRAF = ILNGTH(2)
LDTRAF = DLNGTH(2)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE, 1, NBNEXT,
$ ITRAF(CITRAF), DTRAF(CDTRAF), WORK,
$ INFO )
IF( INFO.NE.0 ) THEN
INFO = 2
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
RETURN
END IF
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE + 2
ELSE
*
* 2 by 2 Block did split
*
LITRAF = ILNGTH(1)
LDTRAF = DLNGTH(1)
IF( CITRAF+2*LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+2*LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE, 1, 1, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
CALL BDLAEXC( N, T, LDT, HERE+1, 1, 1, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE + 2
END IF
END IF
END IF
IF( HERE.LT.ILST )
$ GO TO 10
*
ELSE
*
HERE = IFST
20 CONTINUE
*
* Swap block with next one above
*
IF( NBF.EQ.1 .OR. NBF.EQ.2 ) THEN
*
* Current block either 1 by 1 or 2 by 2
*
NBNEXT = 1
IF( HERE.GE.3 ) THEN
IF( T( HERE-1, HERE-2 ).NE.ZERO )
$ NBNEXT = 2
END IF
*
LITRAF = ILNGTH(NBF+NBNEXT-1)
LDTRAF = DLNGTH(NBF+NBNEXT-1)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE-NBNEXT, NBNEXT, NBF,
$ ITRAF(CITRAF), DTRAF(CDTRAF), WORK, INFO )
IF( INFO.NE.0 ) THEN
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
RETURN
END IF
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE - NBNEXT
*
* Test if 2 by 2 block breaks into two 1 by 1 blocks
*
IF( NBF.EQ.2 ) THEN
IF( T( HERE+1, HERE ).EQ.ZERO )
$ NBF = 3
END IF
*
ELSE
*
* Current block consists of two 1 by 1 blocks each of which
* must be swapped individually
*
NBNEXT = 1
IF( HERE.GE.3 ) THEN
IF( T( HERE-1, HERE-2 ).NE.ZERO )
$ NBNEXT = 2
END IF
LITRAF = ILNGTH(NBNEXT)
LDTRAF = DLNGTH(NBNEXT)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE-NBNEXT, NBNEXT, 1,
$ ITRAF(CITRAF), DTRAF(CDTRAF), WORK, INFO )
IF( INFO.NE.0 ) THEN
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
RETURN
END IF
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
*
IF( NBNEXT.EQ.1 ) THEN
*
* Swap two 1 by 1 blocks, no problems possible
*
LITRAF = ILNGTH(1)
LDTRAF = DLNGTH(1)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE, NBNEXT, 1, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE - 1
ELSE
*
* Recompute NBNEXT in case 2 by 2 split
*
IF( T( HERE, HERE-1 ).EQ.ZERO )
$ NBNEXT = 1
IF( NBNEXT.EQ.2 ) THEN
*
* 2 by 2 Block did not split
*
LITRAF = ILNGTH(2)
LDTRAF = DLNGTH(2)
IF( CITRAF+LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE-1, 2, 1, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
IF( INFO.NE.0 ) THEN
INFO = 2
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
RETURN
END IF
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE - 2
ELSE
*
* 2 by 2 Block did split
*
LITRAF = ILNGTH(1)
LDTRAF = DLNGTH(1)
IF( CITRAF+2*LITRAF-1.GT.NITRAF ) THEN
INFO = -6
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
IF( CDTRAF+2*LDTRAF-1.GT.NDTRAF ) THEN
INFO = -8
CALL XERBLA( 'BDTREXC', -INFO )
RETURN
END IF
CALL BDLAEXC( N, T, LDT, HERE, 1, 1, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
CALL BDLAEXC( N, T, LDT, HERE-1, 1, 1, ITRAF(CITRAF),
$ DTRAF(CDTRAF), WORK, INFO )
CITRAF = CITRAF + LITRAF
CDTRAF = CDTRAF + LDTRAF
HERE = HERE - 2
END IF
END IF
END IF
IF( HERE.GT.ILST )
$ GO TO 20
END IF
ILST = HERE
NITRAF = CITRAF - 1
NDTRAF = CDTRAF - 1
*
RETURN
*
* End of BDTREXC
*
END
|
