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
|
#include "rb_lapack.h"
static logical
rblapack_selctg(real *arg0, real *arg1, real *arg2){
VALUE rblapack_arg0, rblapack_arg1, rblapack_arg2;
VALUE rblapack_ret;
logical ret;
rblapack_arg0 = rb_float_new((double)(*arg0));
rblapack_arg1 = rb_float_new((double)(*arg1));
rblapack_arg2 = rb_float_new((double)(*arg2));
rblapack_ret = rb_yield_values(3, rblapack_arg0, rblapack_arg1, rblapack_arg2);
ret = (rblapack_ret == Qtrue);
return ret;
}
extern VOID sggesx_(char* jobvsl, char* jobvsr, char* sort, L_fp selctg, char* sense, integer* n, real* a, integer* lda, real* b, integer* ldb, integer* sdim, real* alphar, real* alphai, real* beta, real* vsl, integer* ldvsl, real* vsr, integer* ldvsr, real* rconde, real* rcondv, real* work, integer* lwork, integer* iwork, integer* liwork, logical* bwork, integer* info);
static VALUE
rblapack_sggesx(int argc, VALUE *argv, VALUE self){
VALUE rblapack_jobvsl;
char jobvsl;
VALUE rblapack_jobvsr;
char jobvsr;
VALUE rblapack_sort;
char sort;
VALUE rblapack_sense;
char sense;
VALUE rblapack_a;
real *a;
VALUE rblapack_b;
real *b;
VALUE rblapack_lwork;
integer lwork;
VALUE rblapack_liwork;
integer liwork;
VALUE rblapack_sdim;
integer sdim;
VALUE rblapack_alphar;
real *alphar;
VALUE rblapack_alphai;
real *alphai;
VALUE rblapack_beta;
real *beta;
VALUE rblapack_vsl;
real *vsl;
VALUE rblapack_vsr;
real *vsr;
VALUE rblapack_rconde;
real *rconde;
VALUE rblapack_rcondv;
real *rcondv;
VALUE rblapack_work;
real *work;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
real *a_out__;
VALUE rblapack_b_out__;
real *b_out__;
integer *iwork;
logical *bwork;
integer lda;
integer n;
integer ldb;
integer ldvsl;
integer ldvsr;
VALUE rblapack_options;
if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
argc--;
rblapack_options = argv[argc];
if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
printf("%s\n", "USAGE:\n sdim, alphar, alphai, beta, vsl, vsr, rconde, rcondv, work, info, a, b = NumRu::Lapack.sggesx( jobvsl, jobvsr, sort, sense, a, b, [:lwork => lwork, :liwork => liwork, :usage => usage, :help => help]){|a,b,c| ... }\n\n\nFORTRAN MANUAL\n SUBROUTINE SGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA, B, LDB, SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, VSR, LDVSR, RCONDE, RCONDV, WORK, LWORK, IWORK, LIWORK, BWORK, INFO )\n\n* Purpose\n* =======\n*\n* SGGESX computes for a pair of N-by-N real nonsymmetric matrices\n* (A,B), the generalized eigenvalues, the real Schur form (S,T), and,\n* optionally, the left and/or right matrices of Schur vectors (VSL and\n* VSR). This gives the generalized Schur factorization\n*\n* (A,B) = ( (VSL) S (VSR)**T, (VSL) T (VSR)**T )\n*\n* Optionally, it also orders the eigenvalues so that a selected cluster\n* of eigenvalues appears in the leading diagonal blocks of the upper\n* quasi-triangular matrix S and the upper triangular matrix T; computes\n* a reciprocal condition number for the average of the selected\n* eigenvalues (RCONDE); and computes a reciprocal condition number for\n* the right and left deflating subspaces corresponding to the selected\n* eigenvalues (RCONDV). The leading columns of VSL and VSR then form\n* an orthonormal basis for the corresponding left and right eigenspaces\n* (deflating subspaces).\n*\n* A generalized eigenvalue for a pair of matrices (A,B) is a scalar w\n* or a ratio alpha/beta = w, such that A - w*B is singular. It is\n* usually represented as the pair (alpha,beta), as there is a\n* reasonable interpretation for beta=0 or for both being zero.\n*\n* A pair of matrices (S,T) is in generalized real Schur form if T is\n* upper triangular with non-negative diagonal and S is block upper\n* triangular with 1-by-1 and 2-by-2 blocks. 1-by-1 blocks correspond\n* to real generalized eigenvalues, while 2-by-2 blocks of S will be\n* \"standardized\" by making the corresponding elements of T have the\n* form:\n* [ a 0 ]\n* [ 0 b ]\n*\n* and the pair of corresponding 2-by-2 blocks in S and T will have a\n* complex conjugate pair of generalized eigenvalues.\n*\n*\n\n* Arguments\n* =========\n*\n* JOBVSL (input) CHARACTER*1\n* = 'N': do not compute the left Schur vectors;\n* = 'V': compute the left Schur vectors.\n*\n* JOBVSR (input) CHARACTER*1\n* = 'N': do not compute the right Schur vectors;\n* = 'V': compute the right Schur vectors.\n*\n* SORT (input) CHARACTER*1\n* Specifies whether or not to order the eigenvalues on the\n* diagonal of the generalized Schur form.\n* = 'N': Eigenvalues are not ordered;\n* = 'S': Eigenvalues are ordered (see SELCTG).\n*\n* SELCTG (external procedure) LOGICAL FUNCTION of three REAL arguments\n* SELCTG must be declared EXTERNAL in the calling subroutine.\n* If SORT = 'N', SELCTG is not referenced.\n* If SORT = 'S', SELCTG is used to select eigenvalues to sort\n* to the top left of the Schur form.\n* An eigenvalue (ALPHAR(j)+ALPHAI(j))/BETA(j) is selected if\n* SELCTG(ALPHAR(j),ALPHAI(j),BETA(j)) is true; i.e. if either\n* one of a complex conjugate pair of eigenvalues is selected,\n* then both complex eigenvalues are selected.\n* Note that a selected complex eigenvalue may no longer satisfy\n* SELCTG(ALPHAR(j),ALPHAI(j),BETA(j)) = .TRUE. after ordering,\n* since ordering may change the value of complex eigenvalues\n* (especially if the eigenvalue is ill-conditioned), in this\n* case INFO is set to N+3.\n*\n* SENSE (input) CHARACTER*1\n* Determines which reciprocal condition numbers are computed.\n* = 'N' : None are computed;\n* = 'E' : Computed for average of selected eigenvalues only;\n* = 'V' : Computed for selected deflating subspaces only;\n* = 'B' : Computed for both.\n* If SENSE = 'E', 'V', or 'B', SORT must equal 'S'.\n*\n* N (input) INTEGER\n* The order of the matrices A, B, VSL, and VSR. N >= 0.\n*\n* A (input/output) REAL array, dimension (LDA, N)\n* On entry, the first of the pair of matrices.\n* On exit, A has been overwritten by its generalized Schur\n* form S.\n*\n* LDA (input) INTEGER\n* The leading dimension of A. LDA >= max(1,N).\n*\n* B (input/output) REAL array, dimension (LDB, N)\n* On entry, the second of the pair of matrices.\n* On exit, B has been overwritten by its generalized Schur\n* form T.\n*\n* LDB (input) INTEGER\n* The leading dimension of B. LDB >= max(1,N).\n*\n* SDIM (output) INTEGER\n* If SORT = 'N', SDIM = 0.\n* If SORT = 'S', SDIM = number of eigenvalues (after sorting)\n* for which SELCTG is true. (Complex conjugate pairs for which\n* SELCTG is true for either eigenvalue count as 2.)\n*\n* ALPHAR (output) REAL array, dimension (N)\n* ALPHAI (output) REAL array, dimension (N)\n* BETA (output) REAL array, dimension (N)\n* On exit, (ALPHAR(j) + ALPHAI(j)*i)/BETA(j), j=1,...,N, will\n* be the generalized eigenvalues. ALPHAR(j) + ALPHAI(j)*i\n* and BETA(j),j=1,...,N are the diagonals of the complex Schur\n* form (S,T) that would result if the 2-by-2 diagonal blocks of\n* the real Schur form of (A,B) were further reduced to\n* triangular form using 2-by-2 complex unitary transformations.\n* If ALPHAI(j) is zero, then the j-th eigenvalue is real; if\n* positive, then the j-th and (j+1)-st eigenvalues are a\n* complex conjugate pair, with ALPHAI(j+1) negative.\n*\n* Note: the quotients ALPHAR(j)/BETA(j) and ALPHAI(j)/BETA(j)\n* may easily over- or underflow, and BETA(j) may even be zero.\n* Thus, the user should avoid naively computing the ratio.\n* However, ALPHAR and ALPHAI will be always less than and\n* usually comparable with norm(A) in magnitude, and BETA always\n* less than and usually comparable with norm(B).\n*\n* VSL (output) REAL array, dimension (LDVSL,N)\n* If JOBVSL = 'V', VSL will contain the left Schur vectors.\n* Not referenced if JOBVSL = 'N'.\n*\n* LDVSL (input) INTEGER\n* The leading dimension of the matrix VSL. LDVSL >=1, and\n* if JOBVSL = 'V', LDVSL >= N.\n*\n* VSR (output) REAL array, dimension (LDVSR,N)\n* If JOBVSR = 'V', VSR will contain the right Schur vectors.\n* Not referenced if JOBVSR = 'N'.\n*\n* LDVSR (input) INTEGER\n* The leading dimension of the matrix VSR. LDVSR >= 1, and\n* if JOBVSR = 'V', LDVSR >= N.\n*\n* RCONDE (output) REAL array, dimension ( 2 )\n* If SENSE = 'E' or 'B', RCONDE(1) and RCONDE(2) contain the\n* reciprocal condition numbers for the average of the selected\n* eigenvalues.\n* Not referenced if SENSE = 'N' or 'V'.\n*\n* RCONDV (output) REAL array, dimension ( 2 )\n* If SENSE = 'V' or 'B', RCONDV(1) and RCONDV(2) contain the\n* reciprocal condition numbers for the selected deflating\n* subspaces.\n* Not referenced if SENSE = 'N' or 'E'.\n*\n* WORK (workspace/output) REAL array, dimension (MAX(1,LWORK))\n* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n*\n* LWORK (input) INTEGER\n* The dimension of the array WORK.\n* If N = 0, LWORK >= 1, else if SENSE = 'E', 'V', or 'B',\n* LWORK >= max( 8*N, 6*N+16, 2*SDIM*(N-SDIM) ), else\n* LWORK >= max( 8*N, 6*N+16 ).\n* Note that 2*SDIM*(N-SDIM) <= N*N/2.\n* Note also that an error is only returned if\n* LWORK < max( 8*N, 6*N+16), but if SENSE = 'E' or 'V' or 'B'\n* this may not be large enough.\n*\n* If LWORK = -1, then a workspace query is assumed; the routine\n* only calculates the bound on the optimal size of the WORK\n* array and the minimum size of the IWORK array, returns these\n* values as the first entries of the WORK and IWORK arrays, and\n* no error message related to LWORK or LIWORK is issued by\n* XERBLA.\n*\n* IWORK (workspace) INTEGER array, dimension (MAX(1,LIWORK))\n* On exit, if INFO = 0, IWORK(1) returns the minimum LIWORK.\n*\n* LIWORK (input) INTEGER\n* The dimension of the array IWORK.\n* If SENSE = 'N' or N = 0, LIWORK >= 1, otherwise\n* LIWORK >= N+6.\n*\n* If LIWORK = -1, then a workspace query is assumed; the\n* routine only calculates the bound on the optimal size of the\n* WORK array and the minimum size of the IWORK array, returns\n* these values as the first entries of the WORK and IWORK\n* arrays, and no error message related to LWORK or LIWORK is\n* issued by XERBLA.\n*\n* BWORK (workspace) LOGICAL array, dimension (N)\n* Not referenced if SORT = 'N'.\n*\n* INFO (output) INTEGER\n* = 0: successful exit\n* < 0: if INFO = -i, the i-th argument had an illegal value.\n* = 1,...,N:\n* The QZ iteration failed. (A,B) are not in Schur\n* form, but ALPHAR(j), ALPHAI(j), and BETA(j) should\n* be correct for j=INFO+1,...,N.\n* > N: =N+1: other than QZ iteration failed in SHGEQZ\n* =N+2: after reordering, roundoff changed values of\n* some complex eigenvalues so that leading\n* eigenvalues in the Generalized Schur form no\n* longer satisfy SELCTG=.TRUE. This could also\n* be caused due to scaling.\n* =N+3: reordering failed in STGSEN.\n*\n\n* Further Details\n* ===============\n*\n* An approximate (asymptotic) bound on the average absolute error of\n* the selected eigenvalues is\n*\n* EPS * norm((A, B)) / RCONDE( 1 ).\n*\n* An approximate (asymptotic) bound on the maximum angular error in\n* the computed deflating subspaces is\n*\n* EPS * norm((A, B)) / RCONDV( 2 ).\n*\n* See LAPACK User's Guide, section 4.11 for more information.\n*\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n sdim, alphar, alphai, beta, vsl, vsr, rconde, rcondv, work, info, a, b = NumRu::Lapack.sggesx( jobvsl, jobvsr, sort, sense, a, b, [:lwork => lwork, :liwork => liwork, :usage => usage, :help => help]){|a,b,c| ... }\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 6 && argc != 8)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 6)", argc);
rblapack_jobvsl = argv[0];
rblapack_jobvsr = argv[1];
rblapack_sort = argv[2];
rblapack_sense = argv[3];
rblapack_a = argv[4];
rblapack_b = argv[5];
if (argc == 8) {
rblapack_lwork = argv[6];
rblapack_liwork = argv[7];
} else if (rblapack_options != Qnil) {
rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
rblapack_liwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("liwork")));
} else {
rblapack_lwork = Qnil;
rblapack_liwork = Qnil;
}
jobvsl = StringValueCStr(rblapack_jobvsl)[0];
sort = StringValueCStr(rblapack_sort)[0];
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (5th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (5th argument) must be %d", 2);
lda = NA_SHAPE0(rblapack_a);
n = NA_SHAPE1(rblapack_a);
if (NA_TYPE(rblapack_a) != NA_SFLOAT)
rblapack_a = na_change_type(rblapack_a, NA_SFLOAT);
a = NA_PTR_TYPE(rblapack_a, real*);
jobvsr = StringValueCStr(rblapack_jobvsr)[0];
if (!NA_IsNArray(rblapack_b))
rb_raise(rb_eArgError, "b (6th argument) must be NArray");
if (NA_RANK(rblapack_b) != 2)
rb_raise(rb_eArgError, "rank of b (6th argument) must be %d", 2);
ldb = NA_SHAPE0(rblapack_b);
if (NA_SHAPE1(rblapack_b) != n)
rb_raise(rb_eRuntimeError, "shape 1 of b must be the same as shape 1 of a");
if (NA_TYPE(rblapack_b) != NA_SFLOAT)
rblapack_b = na_change_type(rblapack_b, NA_SFLOAT);
b = NA_PTR_TYPE(rblapack_b, real*);
ldvsl = lsame_(&jobvsl,"V") ? n : 1;
sense = StringValueCStr(rblapack_sense)[0];
if (rblapack_liwork == Qnil)
liwork = (lsame_(&sense,"N")||n==0) ? 1 : n+6;
else {
liwork = NUM2INT(rblapack_liwork);
}
if (rblapack_lwork == Qnil)
lwork = n==0 ? 1 : (lsame_(&sense,"E")||lsame_(&sense,"V")||lsame_(&sense,"B")) ? MAX(MAX(8*n,6*n+16),n*n/2) : MAX(8*n,6*n+16);
else {
lwork = NUM2INT(rblapack_lwork);
}
ldvsr = lsame_(&jobvsr,"V") ? n : 1;
{
na_shape_t shape[1];
shape[0] = n;
rblapack_alphar = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
alphar = NA_PTR_TYPE(rblapack_alphar, real*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_alphai = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
alphai = NA_PTR_TYPE(rblapack_alphai, real*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_beta = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
beta = NA_PTR_TYPE(rblapack_beta, real*);
{
na_shape_t shape[2];
shape[0] = ldvsl;
shape[1] = n;
rblapack_vsl = na_make_object(NA_SFLOAT, 2, shape, cNArray);
}
vsl = NA_PTR_TYPE(rblapack_vsl, real*);
{
na_shape_t shape[2];
shape[0] = ldvsr;
shape[1] = n;
rblapack_vsr = na_make_object(NA_SFLOAT, 2, shape, cNArray);
}
vsr = NA_PTR_TYPE(rblapack_vsr, real*);
{
na_shape_t shape[1];
shape[0] = 2;
rblapack_rconde = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
rconde = NA_PTR_TYPE(rblapack_rconde, real*);
{
na_shape_t shape[1];
shape[0] = 2;
rblapack_rcondv = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
rcondv = NA_PTR_TYPE(rblapack_rcondv, real*);
{
na_shape_t shape[1];
shape[0] = MAX(1,lwork);
rblapack_work = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
work = NA_PTR_TYPE(rblapack_work, real*);
{
na_shape_t shape[2];
shape[0] = lda;
shape[1] = n;
rblapack_a_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
}
a_out__ = NA_PTR_TYPE(rblapack_a_out__, real*);
MEMCPY(a_out__, a, real, NA_TOTAL(rblapack_a));
rblapack_a = rblapack_a_out__;
a = a_out__;
{
na_shape_t shape[2];
shape[0] = ldb;
shape[1] = n;
rblapack_b_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
}
b_out__ = NA_PTR_TYPE(rblapack_b_out__, real*);
MEMCPY(b_out__, b, real, NA_TOTAL(rblapack_b));
rblapack_b = rblapack_b_out__;
b = b_out__;
iwork = ALLOC_N(integer, (MAX(1,liwork)));
bwork = ALLOC_N(logical, (lsame_(&sort,"N") ? 0 : n));
sggesx_(&jobvsl, &jobvsr, &sort, rblapack_selctg, &sense, &n, a, &lda, b, &ldb, &sdim, alphar, alphai, beta, vsl, &ldvsl, vsr, &ldvsr, rconde, rcondv, work, &lwork, iwork, &liwork, bwork, &info);
free(iwork);
free(bwork);
rblapack_sdim = INT2NUM(sdim);
rblapack_info = INT2NUM(info);
return rb_ary_new3(12, rblapack_sdim, rblapack_alphar, rblapack_alphai, rblapack_beta, rblapack_vsl, rblapack_vsr, rblapack_rconde, rblapack_rcondv, rblapack_work, rblapack_info, rblapack_a, rblapack_b);
}
void
init_lapack_sggesx(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "sggesx", rblapack_sggesx, -1);
}
|
