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
|
---
:name: ctrexc
:md5sum: 98fce909e94f4aeceac927f4fb0dce87
:category: :subroutine
:arguments:
- compq:
:type: char
:intent: input
- n:
:type: integer
:intent: input
- t:
:type: complex
:intent: input/output
:dims:
- ldt
- n
- ldt:
:type: integer
:intent: input
- q:
:type: complex
:intent: input/output
:dims:
- ldq
- n
- ldq:
:type: integer
:intent: input
- ifst:
:type: integer
:intent: input
- ilst:
:type: integer
:intent: input
- info:
:type: integer
:intent: output
:substitutions: {}
:fortran_help: " SUBROUTINE CTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO )\n\n\
* Purpose\n\
* =======\n\
*\n\
* CTREXC reorders the Schur factorization of a complex matrix\n\
* A = Q*T*Q**H, so that the diagonal element of T with row index IFST\n\
* is moved to row ILST.\n\
*\n\
* The Schur form T is reordered by a unitary similarity transformation\n\
* Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by\n\
* postmultplying it with Z.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* COMPQ (input) CHARACTER*1\n\
* = 'V': update the matrix Q of Schur vectors;\n\
* = 'N': do not update Q.\n\
*\n\
* N (input) INTEGER\n\
* The order of the matrix T. N >= 0.\n\
*\n\
* T (input/output) COMPLEX array, dimension (LDT,N)\n\
* On entry, the upper triangular matrix T.\n\
* On exit, the reordered upper triangular matrix.\n\
*\n\
* LDT (input) INTEGER\n\
* The leading dimension of the array T. LDT >= max(1,N).\n\
*\n\
* Q (input/output) COMPLEX array, dimension (LDQ,N)\n\
* On entry, if COMPQ = 'V', the matrix Q of Schur vectors.\n\
* On exit, if COMPQ = 'V', Q has been postmultiplied by the\n\
* unitary transformation matrix Z which reorders T.\n\
* If COMPQ = 'N', Q is not referenced.\n\
*\n\
* LDQ (input) INTEGER\n\
* The leading dimension of the array Q. LDQ >= max(1,N).\n\
*\n\
* IFST (input) INTEGER\n\
* ILST (input) INTEGER\n\
* Specify the reordering of the diagonal elements of T:\n\
* The element with row index IFST is moved to row ILST by a\n\
* sequence of transpositions between adjacent elements.\n\
* 1 <= IFST <= N; 1 <= ILST <= N.\n\
*\n\
* INFO (output) INTEGER\n\
* = 0: successful exit\n\
* < 0: if INFO = -i, the i-th argument had an illegal value\n\
*\n\n\
* =====================================================================\n\
*\n\
* .. Local Scalars ..\n LOGICAL WANTQ\n INTEGER K, M1, M2, M3\n REAL CS\n COMPLEX SN, T11, T22, TEMP\n\
* ..\n\
* .. External Functions ..\n LOGICAL LSAME\n EXTERNAL LSAME\n\
* ..\n\
* .. External Subroutines ..\n EXTERNAL CLARTG, CROT, XERBLA\n\
* ..\n\
* .. Intrinsic Functions ..\n INTRINSIC CONJG, MAX\n\
* ..\n"
|
