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
|
#include "rb_lapack.h"
extern VOID sstevx_(char* jobz, char* range, integer* n, real* d, real* e, real* vl, real* vu, integer* il, integer* iu, real* abstol, integer* m, real* w, real* z, integer* ldz, real* work, integer* iwork, integer* ifail, integer* info);
static VALUE
rblapack_sstevx(int argc, VALUE *argv, VALUE self){
VALUE rblapack_jobz;
char jobz;
VALUE rblapack_range;
char range;
VALUE rblapack_d;
real *d;
VALUE rblapack_e;
real *e;
VALUE rblapack_vl;
real vl;
VALUE rblapack_vu;
real vu;
VALUE rblapack_il;
integer il;
VALUE rblapack_iu;
integer iu;
VALUE rblapack_abstol;
real abstol;
VALUE rblapack_m;
integer m;
VALUE rblapack_w;
real *w;
VALUE rblapack_z;
real *z;
VALUE rblapack_ifail;
integer *ifail;
VALUE rblapack_info;
integer info;
VALUE rblapack_d_out__;
real *d_out__;
VALUE rblapack_e_out__;
real *e_out__;
real *work;
integer *iwork;
integer n;
integer ldz;
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 m, w, z, ifail, info, d, e = NumRu::Lapack.sstevx( jobz, range, d, e, vl, vu, il, iu, abstol, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE SSTEVX( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, IFAIL, INFO )\n\n* Purpose\n* =======\n*\n* SSTEVX computes selected eigenvalues and, optionally, eigenvectors\n* of a real symmetric tridiagonal matrix A. Eigenvalues and\n* eigenvectors can be selected by specifying either a range of values\n* or a range of indices for the desired eigenvalues.\n*\n\n* Arguments\n* =========\n*\n* JOBZ (input) CHARACTER*1\n* = 'N': Compute eigenvalues only;\n* = 'V': Compute eigenvalues and eigenvectors.\n*\n* RANGE (input) CHARACTER*1\n* = 'A': all eigenvalues will be found.\n* = 'V': all eigenvalues in the half-open interval (VL,VU]\n* will be found.\n* = 'I': the IL-th through IU-th eigenvalues will be found.\n*\n* N (input) INTEGER\n* The order of the matrix. N >= 0.\n*\n* D (input/output) REAL array, dimension (N)\n* On entry, the n diagonal elements of the tridiagonal matrix\n* A.\n* On exit, D may be multiplied by a constant factor chosen\n* to avoid over/underflow in computing the eigenvalues.\n*\n* E (input/output) REAL array, dimension (max(1,N-1))\n* On entry, the (n-1) subdiagonal elements of the tridiagonal\n* matrix A in elements 1 to N-1 of E.\n* On exit, E may be multiplied by a constant factor chosen\n* to avoid over/underflow in computing the eigenvalues.\n*\n* VL (input) REAL\n* VU (input) REAL\n* If RANGE='V', the lower and upper bounds of the interval to\n* be searched for eigenvalues. VL < VU.\n* Not referenced if RANGE = 'A' or 'I'.\n*\n* IL (input) INTEGER\n* IU (input) INTEGER\n* If RANGE='I', the indices (in ascending order) of the\n* smallest and largest eigenvalues to be returned.\n* 1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0.\n* Not referenced if RANGE = 'A' or 'V'.\n*\n* ABSTOL (input) REAL\n* The absolute error tolerance for the eigenvalues.\n* An approximate eigenvalue is accepted as converged\n* when it is determined to lie in an interval [a,b]\n* of width less than or equal to\n*\n* ABSTOL + EPS * max( |a|,|b| ) ,\n*\n* where EPS is the machine precision. If ABSTOL is less\n* than or equal to zero, then EPS*|T| will be used in\n* its place, where |T| is the 1-norm of the tridiagonal\n* matrix.\n*\n* Eigenvalues will be computed most accurately when ABSTOL is\n* set to twice the underflow threshold 2*SLAMCH('S'), not zero.\n* If this routine returns with INFO>0, indicating that some\n* eigenvectors did not converge, try setting ABSTOL to\n* 2*SLAMCH('S').\n*\n* See \"Computing Small Singular Values of Bidiagonal Matrices\n* with Guaranteed High Relative Accuracy,\" by Demmel and\n* Kahan, LAPACK Working Note #3.\n*\n* M (output) INTEGER\n* The total number of eigenvalues found. 0 <= M <= N.\n* If RANGE = 'A', M = N, and if RANGE = 'I', M = IU-IL+1.\n*\n* W (output) REAL array, dimension (N)\n* The first M elements contain the selected eigenvalues in\n* ascending order.\n*\n* Z (output) REAL array, dimension (LDZ, max(1,M) )\n* If JOBZ = 'V', then if INFO = 0, the first M columns of Z\n* contain the orthonormal eigenvectors of the matrix A\n* corresponding to the selected eigenvalues, with the i-th\n* column of Z holding the eigenvector associated with W(i).\n* If an eigenvector fails to converge (INFO > 0), then that\n* column of Z contains the latest approximation to the\n* eigenvector, and the index of the eigenvector is returned\n* in IFAIL. If JOBZ = 'N', then Z is not referenced.\n* Note: the user must ensure that at least max(1,M) columns are\n* supplied in the array Z; if RANGE = 'V', the exact value of M\n* is not known in advance and an upper bound must be used.\n*\n* LDZ (input) INTEGER\n* The leading dimension of the array Z. LDZ >= 1, and if\n* JOBZ = 'V', LDZ >= max(1,N).\n*\n* WORK (workspace) REAL array, dimension (5*N)\n*\n* IWORK (workspace) INTEGER array, dimension (5*N)\n*\n* IFAIL (output) INTEGER array, dimension (N)\n* If JOBZ = 'V', then if INFO = 0, the first M elements of\n* IFAIL are zero. If INFO > 0, then IFAIL contains the\n* indices of the eigenvectors that failed to converge.\n* If JOBZ = 'N', then IFAIL is not referenced.\n*\n* INFO (output) INTEGER\n* = 0: successful exit\n* < 0: if INFO = -i, the i-th argument had an illegal value\n* > 0: if INFO = i, then i eigenvectors failed to converge.\n* Their indices are stored in array IFAIL.\n*\n\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n m, w, z, ifail, info, d, e = NumRu::Lapack.sstevx( jobz, range, d, e, vl, vu, il, iu, abstol, [:usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 9 && argc != 9)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 9)", argc);
rblapack_jobz = argv[0];
rblapack_range = argv[1];
rblapack_d = argv[2];
rblapack_e = argv[3];
rblapack_vl = argv[4];
rblapack_vu = argv[5];
rblapack_il = argv[6];
rblapack_iu = argv[7];
rblapack_abstol = argv[8];
if (argc == 9) {
} else if (rblapack_options != Qnil) {
} else {
}
jobz = StringValueCStr(rblapack_jobz)[0];
if (!NA_IsNArray(rblapack_d))
rb_raise(rb_eArgError, "d (3th argument) must be NArray");
if (NA_RANK(rblapack_d) != 1)
rb_raise(rb_eArgError, "rank of d (3th argument) must be %d", 1);
n = NA_SHAPE0(rblapack_d);
if (NA_TYPE(rblapack_d) != NA_SFLOAT)
rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
d = NA_PTR_TYPE(rblapack_d, real*);
vl = (real)NUM2DBL(rblapack_vl);
il = NUM2INT(rblapack_il);
abstol = (real)NUM2DBL(rblapack_abstol);
m = n;
range = StringValueCStr(rblapack_range)[0];
vu = (real)NUM2DBL(rblapack_vu);
ldz = lsame_(&jobz,"V") ? MAX(1,n) : 1;
if (!NA_IsNArray(rblapack_e))
rb_raise(rb_eArgError, "e (4th argument) must be NArray");
if (NA_RANK(rblapack_e) != 1)
rb_raise(rb_eArgError, "rank of e (4th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_e) != (MAX(1,n-1)))
rb_raise(rb_eRuntimeError, "shape 0 of e must be %d", MAX(1,n-1));
if (NA_TYPE(rblapack_e) != NA_SFLOAT)
rblapack_e = na_change_type(rblapack_e, NA_SFLOAT);
e = NA_PTR_TYPE(rblapack_e, real*);
iu = NUM2INT(rblapack_iu);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_w = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
w = NA_PTR_TYPE(rblapack_w, real*);
{
na_shape_t shape[2];
shape[0] = ldz;
shape[1] = MAX(1,m);
rblapack_z = na_make_object(NA_SFLOAT, 2, shape, cNArray);
}
z = NA_PTR_TYPE(rblapack_z, real*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_ifail = na_make_object(NA_LINT, 1, shape, cNArray);
}
ifail = NA_PTR_TYPE(rblapack_ifail, integer*);
{
na_shape_t shape[1];
shape[0] = n;
rblapack_d_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
d_out__ = NA_PTR_TYPE(rblapack_d_out__, real*);
MEMCPY(d_out__, d, real, NA_TOTAL(rblapack_d));
rblapack_d = rblapack_d_out__;
d = d_out__;
{
na_shape_t shape[1];
shape[0] = MAX(1,n-1);
rblapack_e_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
e_out__ = NA_PTR_TYPE(rblapack_e_out__, real*);
MEMCPY(e_out__, e, real, NA_TOTAL(rblapack_e));
rblapack_e = rblapack_e_out__;
e = e_out__;
work = ALLOC_N(real, (5*n));
iwork = ALLOC_N(integer, (5*n));
sstevx_(&jobz, &range, &n, d, e, &vl, &vu, &il, &iu, &abstol, &m, w, z, &ldz, work, iwork, ifail, &info);
free(work);
free(iwork);
rblapack_m = INT2NUM(m);
rblapack_info = INT2NUM(info);
return rb_ary_new3(7, rblapack_m, rblapack_w, rblapack_z, rblapack_ifail, rblapack_info, rblapack_d, rblapack_e);
}
void
init_lapack_sstevx(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "sstevx", rblapack_sstevx, -1);
}
|
