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
|
#include "rb_lapack.h"
extern VOID sgsvj0_(char* jobv, integer* m, integer* n, real* a, integer* lda, real* d, real* sva, integer* mv, real* v, integer* ldv, integer* eps, integer* sfmin, real* tol, integer* nsweep, real* work, integer* lwork, integer* info);
static VALUE
rblapack_sgsvj0(int argc, VALUE *argv, VALUE self){
VALUE rblapack_jobv;
char jobv;
VALUE rblapack_m;
integer m;
VALUE rblapack_a;
real *a;
VALUE rblapack_d;
real *d;
VALUE rblapack_sva;
real *sva;
VALUE rblapack_mv;
integer mv;
VALUE rblapack_v;
real *v;
VALUE rblapack_eps;
integer eps;
VALUE rblapack_sfmin;
integer sfmin;
VALUE rblapack_tol;
real tol;
VALUE rblapack_nsweep;
integer nsweep;
VALUE rblapack_lwork;
integer lwork;
VALUE rblapack_info;
integer info;
VALUE rblapack_a_out__;
real *a_out__;
VALUE rblapack_d_out__;
real *d_out__;
VALUE rblapack_sva_out__;
real *sva_out__;
VALUE rblapack_v_out__;
real *v_out__;
real *work;
integer lda;
integer n;
integer ldv;
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 info, a, d, sva, v = NumRu::Lapack.sgsvj0( jobv, m, a, d, sva, mv, v, eps, sfmin, tol, nsweep, [:lwork => lwork, :usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )\n\n* Purpose\n* =======\n*\n* SGSVJ0 is called from SGESVJ as a pre-processor and that is its main\n* purpose. It applies Jacobi rotations in the same way as SGESVJ does, but\n* it does not check convergence (stopping criterion). Few tuning\n* parameters (marked by [TP]) are available for the implementer.\n*\n* Further Details\n* ~~~~~~~~~~~~~~~\n* SGSVJ0 is used just to enable SGESVJ to call a simplified version of\n* itself to work on a submatrix of the original matrix.\n*\n* Contributors\n* ~~~~~~~~~~~~\n* Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)\n*\n* Bugs, Examples and Comments\n* ~~~~~~~~~~~~~~~~~~~~~~~~~~~\n* Please report all bugs and send interesting test examples and comments to\n* drmac@math.hr. Thank you.\n*\n\n* Arguments\n* =========\n*\n* JOBV (input) CHARACTER*1\n* Specifies whether the output from this procedure is used\n* to compute the matrix V:\n* = 'V': the product of the Jacobi rotations is accumulated\n* by postmulyiplying the N-by-N array V.\n* (See the description of V.)\n* = 'A': the product of the Jacobi rotations is accumulated\n* by postmulyiplying the MV-by-N array V.\n* (See the descriptions of MV and V.)\n* = 'N': the Jacobi rotations are not accumulated.\n*\n* M (input) INTEGER\n* The number of rows of the input matrix A. M >= 0.\n*\n* N (input) INTEGER\n* The number of columns of the input matrix A.\n* M >= N >= 0.\n*\n* A (input/output) REAL array, dimension (LDA,N)\n* On entry, M-by-N matrix A, such that A*diag(D) represents\n* the input matrix.\n* On exit,\n* A_onexit * D_onexit represents the input matrix A*diag(D)\n* post-multiplied by a sequence of Jacobi rotations, where the\n* rotation threshold and the total number of sweeps are given in\n* TOL and NSWEEP, respectively.\n* (See the descriptions of D, TOL and NSWEEP.)\n*\n* LDA (input) INTEGER\n* The leading dimension of the array A. LDA >= max(1,M).\n*\n* D (input/workspace/output) REAL array, dimension (N)\n* The array D accumulates the scaling factors from the fast scaled\n* Jacobi rotations.\n* On entry, A*diag(D) represents the input matrix.\n* On exit, A_onexit*diag(D_onexit) represents the input matrix\n* post-multiplied by a sequence of Jacobi rotations, where the\n* rotation threshold and the total number of sweeps are given in\n* TOL and NSWEEP, respectively.\n* (See the descriptions of A, TOL and NSWEEP.)\n*\n* SVA (input/workspace/output) REAL array, dimension (N)\n* On entry, SVA contains the Euclidean norms of the columns of\n* the matrix A*diag(D).\n* On exit, SVA contains the Euclidean norms of the columns of\n* the matrix onexit*diag(D_onexit).\n*\n* MV (input) INTEGER\n* If JOBV .EQ. 'A', then MV rows of V are post-multipled by a\n* sequence of Jacobi rotations.\n* If JOBV = 'N', then MV is not referenced.\n*\n* V (input/output) REAL array, dimension (LDV,N)\n* If JOBV .EQ. 'V' then N rows of V are post-multipled by a\n* sequence of Jacobi rotations.\n* If JOBV .EQ. 'A' then MV rows of V are post-multipled by a\n* sequence of Jacobi rotations.\n* If JOBV = 'N', then V is not referenced.\n*\n* LDV (input) INTEGER\n* The leading dimension of the array V, LDV >= 1.\n* If JOBV = 'V', LDV .GE. N.\n* If JOBV = 'A', LDV .GE. MV.\n*\n* EPS (input) INTEGER\n* EPS = SLAMCH('Epsilon')\n*\n* SFMIN (input) INTEGER\n* SFMIN = SLAMCH('Safe Minimum')\n*\n* TOL (input) REAL\n* TOL is the threshold for Jacobi rotations. For a pair\n* A(:,p), A(:,q) of pivot columns, the Jacobi rotation is\n* applied only if ABS(COS(angle(A(:,p),A(:,q)))) .GT. TOL.\n*\n* NSWEEP (input) INTEGER\n* NSWEEP is the number of sweeps of Jacobi rotations to be\n* performed.\n*\n* WORK (workspace) REAL array, dimension LWORK.\n*\n* LWORK (input) INTEGER\n* LWORK is the dimension of WORK. LWORK .GE. M.\n*\n* INFO (output) INTEGER\n* = 0 : successful exit.\n* < 0 : if INFO = -i, then the i-th argument had an illegal value\n*\n\n* =====================================================================\n*\n* .. Local Parameters ..\n REAL ZERO, HALF, ONE, TWO\n PARAMETER ( ZERO = 0.0E0, HALF = 0.5E0, ONE = 1.0E0,\n + TWO = 2.0E0 )\n* ..\n* .. Local Scalars ..\n REAL AAPP, AAPP0, AAPQ, AAQQ, APOAQ, AQOAP, BIG,\n + BIGTHETA, CS, MXAAPQ, MXSINJ, ROOTBIG, ROOTEPS,\n + ROOTSFMIN, ROOTTOL, SMALL, SN, T, TEMP1, THETA,\n + THSIGN\n INTEGER BLSKIP, EMPTSW, i, ibr, IERR, igl, IJBLSK, ir1,\n + ISWROT, jbc, jgl, KBL, LKAHEAD, MVL, NBL,\n + NOTROT, p, PSKIPPED, q, ROWSKIP, SWBAND\n LOGICAL APPLV, ROTOK, RSVEC\n* ..\n* .. Local Arrays ..\n REAL FASTR( 5 )\n* ..\n* .. Intrinsic Functions ..\n INTRINSIC ABS, AMAX1, AMIN1, FLOAT, MIN0, SIGN, SQRT\n* ..\n* .. External Functions ..\n REAL SDOT, SNRM2\n INTEGER ISAMAX\n LOGICAL LSAME\n EXTERNAL ISAMAX, LSAME, SDOT, SNRM2\n* ..\n* .. External Subroutines ..\n EXTERNAL SAXPY, SCOPY, SLASCL, SLASSQ, SROTM, SSWAP\n* ..\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n info, a, d, sva, v = NumRu::Lapack.sgsvj0( jobv, m, a, d, sva, mv, v, eps, sfmin, tol, nsweep, [:lwork => lwork, :usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 11 && argc != 12)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 11)", argc);
rblapack_jobv = argv[0];
rblapack_m = argv[1];
rblapack_a = argv[2];
rblapack_d = argv[3];
rblapack_sva = argv[4];
rblapack_mv = argv[5];
rblapack_v = argv[6];
rblapack_eps = argv[7];
rblapack_sfmin = argv[8];
rblapack_tol = argv[9];
rblapack_nsweep = argv[10];
if (argc == 12) {
rblapack_lwork = argv[11];
} else if (rblapack_options != Qnil) {
rblapack_lwork = rb_hash_aref(rblapack_options, ID2SYM(rb_intern("lwork")));
} else {
rblapack_lwork = Qnil;
}
jobv = StringValueCStr(rblapack_jobv)[0];
if (!NA_IsNArray(rblapack_a))
rb_raise(rb_eArgError, "a (3th argument) must be NArray");
if (NA_RANK(rblapack_a) != 2)
rb_raise(rb_eArgError, "rank of a (3th 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*);
if (!NA_IsNArray(rblapack_sva))
rb_raise(rb_eArgError, "sva (5th argument) must be NArray");
if (NA_RANK(rblapack_sva) != 1)
rb_raise(rb_eArgError, "rank of sva (5th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_sva) != n)
rb_raise(rb_eRuntimeError, "shape 0 of sva must be the same as shape 1 of a");
if (NA_TYPE(rblapack_sva) != NA_SFLOAT)
rblapack_sva = na_change_type(rblapack_sva, NA_SFLOAT);
sva = NA_PTR_TYPE(rblapack_sva, real*);
if (!NA_IsNArray(rblapack_v))
rb_raise(rb_eArgError, "v (7th argument) must be NArray");
if (NA_RANK(rblapack_v) != 2)
rb_raise(rb_eArgError, "rank of v (7th argument) must be %d", 2);
ldv = NA_SHAPE0(rblapack_v);
if (NA_SHAPE1(rblapack_v) != n)
rb_raise(rb_eRuntimeError, "shape 1 of v must be the same as shape 1 of a");
if (NA_TYPE(rblapack_v) != NA_SFLOAT)
rblapack_v = na_change_type(rblapack_v, NA_SFLOAT);
v = NA_PTR_TYPE(rblapack_v, real*);
sfmin = NUM2INT(rblapack_sfmin);
nsweep = NUM2INT(rblapack_nsweep);
m = NUM2INT(rblapack_m);
mv = NUM2INT(rblapack_mv);
tol = (real)NUM2DBL(rblapack_tol);
if (!NA_IsNArray(rblapack_d))
rb_raise(rb_eArgError, "d (4th argument) must be NArray");
if (NA_RANK(rblapack_d) != 1)
rb_raise(rb_eArgError, "rank of d (4th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_d) != n)
rb_raise(rb_eRuntimeError, "shape 0 of d must be the same as shape 1 of a");
if (NA_TYPE(rblapack_d) != NA_SFLOAT)
rblapack_d = na_change_type(rblapack_d, NA_SFLOAT);
d = NA_PTR_TYPE(rblapack_d, real*);
lwork = m;
eps = NUM2INT(rblapack_eps);
{
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[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] = n;
rblapack_sva_out__ = na_make_object(NA_SFLOAT, 1, shape, cNArray);
}
sva_out__ = NA_PTR_TYPE(rblapack_sva_out__, real*);
MEMCPY(sva_out__, sva, real, NA_TOTAL(rblapack_sva));
rblapack_sva = rblapack_sva_out__;
sva = sva_out__;
{
na_shape_t shape[2];
shape[0] = ldv;
shape[1] = n;
rblapack_v_out__ = na_make_object(NA_SFLOAT, 2, shape, cNArray);
}
v_out__ = NA_PTR_TYPE(rblapack_v_out__, real*);
MEMCPY(v_out__, v, real, NA_TOTAL(rblapack_v));
rblapack_v = rblapack_v_out__;
v = v_out__;
work = ALLOC_N(real, (lwork));
sgsvj0_(&jobv, &m, &n, a, &lda, d, sva, &mv, v, &ldv, &eps, &sfmin, &tol, &nsweep, work, &lwork, &info);
free(work);
rblapack_info = INT2NUM(info);
return rb_ary_new3(5, rblapack_info, rblapack_a, rblapack_d, rblapack_sva, rblapack_v);
}
void
init_lapack_sgsvj0(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "sgsvj0", rblapack_sgsvj0, -1);
}
|
