gsl 1.12.108

Sign up to get free protection for your applications and to get access to all the features.
Files changed (158) hide show
  1. data/README.rdoc +29 -0
  2. data/Rakefile +54 -0
  3. data/VERSION +2 -0
  4. data/ext/MANIFEST +119 -0
  5. data/ext/alf.c +206 -0
  6. data/ext/array.c +666 -0
  7. data/ext/array_complex.c +247 -0
  8. data/ext/blas.c +29 -0
  9. data/ext/blas1.c +731 -0
  10. data/ext/blas2.c +1093 -0
  11. data/ext/blas3.c +881 -0
  12. data/ext/block.c +44 -0
  13. data/ext/block_source.c +886 -0
  14. data/ext/bspline.c +130 -0
  15. data/ext/bundle.c +3 -0
  16. data/ext/cdf.c +754 -0
  17. data/ext/cheb.c +542 -0
  18. data/ext/combination.c +283 -0
  19. data/ext/common.c +325 -0
  20. data/ext/complex.c +1004 -0
  21. data/ext/const.c +673 -0
  22. data/ext/const_additional.c +120 -0
  23. data/ext/cqp.c +283 -0
  24. data/ext/deriv.c +195 -0
  25. data/ext/dht.c +361 -0
  26. data/ext/diff.c +166 -0
  27. data/ext/dirac.c +395 -0
  28. data/ext/eigen.c +2373 -0
  29. data/ext/error.c +194 -0
  30. data/ext/extconf.rb +281 -0
  31. data/ext/fcmp.c +66 -0
  32. data/ext/fft.c +1092 -0
  33. data/ext/fit.c +205 -0
  34. data/ext/fresnel.c +312 -0
  35. data/ext/function.c +524 -0
  36. data/ext/geometry.c +139 -0
  37. data/ext/graph.c +1638 -0
  38. data/ext/gsl.c +271 -0
  39. data/ext/gsl_narray.c +653 -0
  40. data/ext/histogram.c +1995 -0
  41. data/ext/histogram2d.c +1068 -0
  42. data/ext/histogram3d.c +884 -0
  43. data/ext/histogram3d_source.c +750 -0
  44. data/ext/histogram_find.c +101 -0
  45. data/ext/histogram_oper.c +159 -0
  46. data/ext/ieee.c +98 -0
  47. data/ext/integration.c +1138 -0
  48. data/ext/interp.c +512 -0
  49. data/ext/jacobi.c +739 -0
  50. data/ext/linalg.c +4047 -0
  51. data/ext/linalg_complex.c +741 -0
  52. data/ext/math.c +725 -0
  53. data/ext/matrix.c +39 -0
  54. data/ext/matrix_complex.c +1732 -0
  55. data/ext/matrix_double.c +560 -0
  56. data/ext/matrix_int.c +256 -0
  57. data/ext/matrix_source.c +2733 -0
  58. data/ext/min.c +250 -0
  59. data/ext/monte.c +992 -0
  60. data/ext/multifit.c +1879 -0
  61. data/ext/multimin.c +808 -0
  62. data/ext/multimin_fsdf.c +156 -0
  63. data/ext/multiroots.c +955 -0
  64. data/ext/ndlinear.c +321 -0
  65. data/ext/nmf.c +167 -0
  66. data/ext/nmf_wrap.c +72 -0
  67. data/ext/ntuple.c +469 -0
  68. data/ext/odeiv.c +959 -0
  69. data/ext/ool.c +879 -0
  70. data/ext/oper_complex_source.c +253 -0
  71. data/ext/permutation.c +596 -0
  72. data/ext/poly.c +42 -0
  73. data/ext/poly2.c +265 -0
  74. data/ext/poly_source.c +1885 -0
  75. data/ext/qrng.c +171 -0
  76. data/ext/randist.c +1873 -0
  77. data/ext/rational.c +480 -0
  78. data/ext/rng.c +612 -0
  79. data/ext/root.c +408 -0
  80. data/ext/sf.c +1494 -0
  81. data/ext/sf_airy.c +200 -0
  82. data/ext/sf_bessel.c +867 -0
  83. data/ext/sf_clausen.c +28 -0
  84. data/ext/sf_coulomb.c +206 -0
  85. data/ext/sf_coupling.c +118 -0
  86. data/ext/sf_dawson.c +29 -0
  87. data/ext/sf_debye.c +157 -0
  88. data/ext/sf_dilog.c +42 -0
  89. data/ext/sf_elementary.c +44 -0
  90. data/ext/sf_ellint.c +206 -0
  91. data/ext/sf_elljac.c +29 -0
  92. data/ext/sf_erfc.c +93 -0
  93. data/ext/sf_exp.c +164 -0
  94. data/ext/sf_expint.c +211 -0
  95. data/ext/sf_fermi_dirac.c +148 -0
  96. data/ext/sf_gamma.c +344 -0
  97. data/ext/sf_gegenbauer.c +96 -0
  98. data/ext/sf_hyperg.c +197 -0
  99. data/ext/sf_laguerre.c +112 -0
  100. data/ext/sf_lambert.c +47 -0
  101. data/ext/sf_legendre.c +367 -0
  102. data/ext/sf_log.c +104 -0
  103. data/ext/sf_mathieu.c +238 -0
  104. data/ext/sf_power.c +46 -0
  105. data/ext/sf_psi.c +98 -0
  106. data/ext/sf_synchrotron.c +48 -0
  107. data/ext/sf_transport.c +76 -0
  108. data/ext/sf_trigonometric.c +207 -0
  109. data/ext/sf_zeta.c +119 -0
  110. data/ext/signal.c +310 -0
  111. data/ext/siman.c +718 -0
  112. data/ext/sort.c +208 -0
  113. data/ext/spline.c +395 -0
  114. data/ext/stats.c +799 -0
  115. data/ext/sum.c +168 -0
  116. data/ext/tamu_anova.c +56 -0
  117. data/ext/tensor.c +38 -0
  118. data/ext/tensor_source.c +1123 -0
  119. data/ext/vector.c +38 -0
  120. data/ext/vector_complex.c +2236 -0
  121. data/ext/vector_double.c +1433 -0
  122. data/ext/vector_int.c +204 -0
  123. data/ext/vector_source.c +3329 -0
  124. data/ext/wavelet.c +937 -0
  125. data/include/rb_gsl.h +151 -0
  126. data/include/rb_gsl_array.h +238 -0
  127. data/include/rb_gsl_cheb.h +21 -0
  128. data/include/rb_gsl_common.h +343 -0
  129. data/include/rb_gsl_complex.h +25 -0
  130. data/include/rb_gsl_const.h +29 -0
  131. data/include/rb_gsl_dirac.h +13 -0
  132. data/include/rb_gsl_eigen.h +17 -0
  133. data/include/rb_gsl_fft.h +62 -0
  134. data/include/rb_gsl_fit.h +25 -0
  135. data/include/rb_gsl_function.h +27 -0
  136. data/include/rb_gsl_graph.h +70 -0
  137. data/include/rb_gsl_histogram.h +63 -0
  138. data/include/rb_gsl_histogram3d.h +97 -0
  139. data/include/rb_gsl_integration.h +17 -0
  140. data/include/rb_gsl_interp.h +46 -0
  141. data/include/rb_gsl_linalg.h +25 -0
  142. data/include/rb_gsl_math.h +26 -0
  143. data/include/rb_gsl_odeiv.h +21 -0
  144. data/include/rb_gsl_poly.h +71 -0
  145. data/include/rb_gsl_rational.h +37 -0
  146. data/include/rb_gsl_rng.h +21 -0
  147. data/include/rb_gsl_root.h +22 -0
  148. data/include/rb_gsl_sf.h +119 -0
  149. data/include/rb_gsl_statistics.h +17 -0
  150. data/include/rb_gsl_tensor.h +45 -0
  151. data/include/rb_gsl_with_narray.h +22 -0
  152. data/include/templates_off.h +87 -0
  153. data/include/templates_on.h +241 -0
  154. data/lib/gsl/gnuplot.rb +41 -0
  155. data/lib/gsl/oper.rb +68 -0
  156. data/lib/ool.rb +22 -0
  157. data/lib/ool/conmin.rb +30 -0
  158. metadata +224 -0
@@ -0,0 +1,42 @@
1
+ /*
2
+ poly.c
3
+ Ruby/GSL: Ruby extension library for GSL (GNU Scientific Library)
4
+ (C) Copyright 2001-2006 by Yoshiki Tsunesada
5
+
6
+ Ruby/GSL is free software: you can redistribute it and/or modify it
7
+ under the terms of the GNU General Public License.
8
+ This library is distributed in the hope that it will be useful, but
9
+ WITHOUT ANY WARRANTY.
10
+ */
11
+ #include "rb_gsl_config.h"
12
+ #include "rb_gsl_poly.h"
13
+ #include "rb_gsl_array.h"
14
+ #include "rb_gsl_common.h"
15
+ #ifdef HAVE_NARARY_H
16
+ #include "narray.h"
17
+ #endif
18
+
19
+ void Init_gsl_poly_init(VALUE module);
20
+ void Init_gsl_poly_int_init(VALUE module);
21
+ void Init_gsl_poly2(VALUE module);
22
+
23
+ #define BASE_DOUBLE
24
+ #include "templates_on.h"
25
+ #include "poly_source.c"
26
+ #include "templates_off.h"
27
+ void Init_gsl_poly(VALUE module)
28
+ {
29
+ Init_gsl_poly_init(module);
30
+ }
31
+
32
+ #undef BASE_DOUBLE
33
+
34
+ #define BASE_INT
35
+ #include "templates_on.h"
36
+ #include "poly_source.c"
37
+ #include "templates_off.h"
38
+ void Init_gsl_poly_int(VALUE module)
39
+ {
40
+ Init_gsl_poly_int_init(module);
41
+ }
42
+ #undef BASE_INT
@@ -0,0 +1,265 @@
1
+ /*
2
+ poly2.c
3
+ Ruby/GSL: Ruby extension library for GSL (GNU Scientific Library)
4
+ (C) Copyright 2004 by Yoshiki Tsunesada
5
+
6
+ Ruby/GSL is free software: you can redistribute it and/or modify it
7
+ under the terms of the GNU General Public License.
8
+ This library is distributed in the hope that it will be useful, but
9
+ WITHOUT ANY WARRANTY.
10
+ */
11
+ #include "rb_gsl_config.h"
12
+ #include "rb_gsl_poly.h"
13
+ #include "rb_gsl_math.h"
14
+ #include "rb_gsl_array.h"
15
+ #include <gsl/gsl_sf_gamma.h>
16
+
17
+ static gsl_poly_int* mygsl_poly_hermite(int n1)
18
+ {
19
+ size_t n;
20
+ gsl_vector_int *p1, *p2, *p0;
21
+ int coef1[2] = {0, 2};
22
+ int coef2[3] = {-2, 0, 4};
23
+ if (n1 < 0) rb_raise(rb_eArgError, "order must be >= 0");
24
+ p0 = gsl_vector_int_calloc(n1 + 1);
25
+ switch (n1) {
26
+ case 0:
27
+ gsl_vector_int_set(p0, 0, 1);
28
+ break;
29
+ case 1:
30
+ memcpy(p0->data, coef1, 2*sizeof(int));
31
+ break;
32
+ case 2:
33
+ memcpy(p0->data, coef2, 3*sizeof(int));
34
+ break;
35
+ default:
36
+ p1 = gsl_vector_int_calloc(n1 + 1);
37
+ p2 = gsl_vector_int_calloc(n1 + 1);
38
+ memcpy(p1->data, coef2, 3*sizeof(int));
39
+ memcpy(p2->data, coef1, 2*sizeof(int));
40
+ for (n = 2; n < n1; n++) {
41
+ gsl_vector_int_memcpy(p0, p1);
42
+ mygsl_vector_int_shift_scale2(p0, n);
43
+ gsl_vector_int_scale(p2, 2*n);
44
+
45
+ gsl_vector_int_sub(p0, p2);
46
+ /* save for the next iteration */
47
+ gsl_vector_int_memcpy(p2, p1);
48
+ gsl_vector_int_memcpy(p1, p0);
49
+ }
50
+ gsl_vector_int_free(p2);
51
+ gsl_vector_int_free(p1);
52
+ break;
53
+ }
54
+ return p0;
55
+ }
56
+
57
+ static gsl_poly_int* mygsl_poly_cheb(int n1)
58
+ {
59
+ size_t n;
60
+ gsl_vector_int *p1, *p2, *p0;
61
+ int coef1[2] = {0, 1};
62
+ int coef2[3] = {-1, 0, 2};
63
+ if (n1 < 0) rb_raise(rb_eArgError, "order must be >= 0");
64
+ p0 = gsl_vector_int_calloc(n1 + 1);
65
+ switch (n1) {
66
+ case 0:
67
+ gsl_vector_int_set(p0, 0, 1);
68
+ break;
69
+ case 1:
70
+ memcpy(p0->data, coef1, 2*sizeof(int));
71
+ break;
72
+ case 2:
73
+ memcpy(p0->data, coef2, 3*sizeof(int));
74
+ break;
75
+ default:
76
+ p1 = gsl_vector_int_calloc(n1 + 1);
77
+ p2 = gsl_vector_int_calloc(n1 + 1);
78
+ memcpy(p1->data, coef2, 3*sizeof(int));
79
+ memcpy(p2->data, coef1, 2*sizeof(int));
80
+ for (n = 2; n < n1; n++) {
81
+ gsl_vector_int_memcpy(p0, p1);
82
+ mygsl_vector_int_shift_scale2(p0, n);
83
+
84
+ gsl_vector_int_sub(p0, p2);
85
+ /* save for the next iteration */
86
+ gsl_vector_int_memcpy(p2, p1);
87
+ gsl_vector_int_memcpy(p1, p0);
88
+ }
89
+ gsl_vector_int_free(p2);
90
+ gsl_vector_int_free(p1);
91
+ break;
92
+ }
93
+ return p0;
94
+ }
95
+
96
+ static gsl_poly_int* mygsl_poly_chebII(int n1)
97
+ {
98
+ size_t n;
99
+ gsl_vector_int *p1, *p2, *p0;
100
+ int coef1[2] = {0, 2};
101
+ int coef2[3] = {-1, 0, 4};
102
+ if (n1 < 0) rb_raise(rb_eArgError, "order must be >= 0");
103
+ p0 = gsl_vector_int_calloc(n1 + 1);
104
+ switch (n1) {
105
+ case 0:
106
+ gsl_vector_int_set(p0, 0, 1);
107
+ break;
108
+ case 1:
109
+ memcpy(p0->data, coef1, 2*sizeof(int));
110
+ break;
111
+ case 2:
112
+ memcpy(p0->data, coef2, 3*sizeof(int));
113
+ break;
114
+ default:
115
+ p1 = gsl_vector_int_calloc(n1 + 1);
116
+ p2 = gsl_vector_int_calloc(n1 + 1);
117
+ memcpy(p1->data, coef2, 3*sizeof(int));
118
+ memcpy(p2->data, coef1, 2*sizeof(int));
119
+ for (n = 2; n < n1; n++) {
120
+ gsl_vector_int_memcpy(p0, p1);
121
+ mygsl_vector_int_shift_scale2(p0, n);
122
+ gsl_vector_int_sub(p0, p2);
123
+ /* save for the next iteration */
124
+ gsl_vector_int_memcpy(p2, p1);
125
+ gsl_vector_int_memcpy(p1, p0);
126
+ }
127
+ gsl_vector_int_free(p2);
128
+ gsl_vector_int_free(p1);
129
+ break;
130
+ }
131
+ return p0;
132
+ }
133
+
134
+ static gsl_poly_int* mygsl_poly_laguerre(int n)
135
+ {
136
+ size_t m, k;
137
+ int val;
138
+ gsl_vector_int *p0;
139
+ if (n < 0) rb_raise(rb_eArgError, "order must be >= 0");
140
+ p0 = gsl_vector_int_calloc(n + 1);
141
+ switch (n) {
142
+ case 0:
143
+ gsl_vector_int_set(p0, 0, 1);
144
+ break;
145
+ case 1:
146
+ gsl_vector_int_set(p0, 0, 1);
147
+ gsl_vector_int_set(p0, 1, -1);
148
+ break;
149
+ default:
150
+ k = gsl_sf_fact(n);
151
+ for (m = 0; m <= n; m++) {
152
+ val = k*k/gsl_sf_fact(n-m)/gsl_pow_2(gsl_sf_fact(m));
153
+ if (m%2 == 1) val *= -1;
154
+ gsl_vector_int_set(p0, m, val);
155
+ }
156
+ break;
157
+ }
158
+ return p0;
159
+ }
160
+
161
+ static gsl_poly_int* mygsl_poly_bessel(int n)
162
+ {
163
+ size_t k;
164
+ gsl_vector_int *p0;
165
+ if (n < 0) rb_raise(rb_eArgError, "order must be >= 0");
166
+ p0 = gsl_vector_int_calloc(n + 1);
167
+ for (k = 0; k <= n; k++) {
168
+ gsl_vector_int_set(p0, k, gsl_sf_fact(n+k)/gsl_sf_fact(n-k)/gsl_sf_fact(k)/((int) pow(2, k)));
169
+ }
170
+ return p0;
171
+ }
172
+
173
+ static gsl_poly_int* mygsl_poly_bell(int n1)
174
+ {
175
+ size_t n, j;
176
+ gsl_vector_int *p1, *p0;
177
+ int coef1[2] = {0, 1};
178
+ int coef2[3] = {0, 1, 1};
179
+ if (n1 < 0) rb_raise(rb_eArgError, "order must be >= 0");
180
+ p0 = gsl_vector_int_calloc(n1 + 1);
181
+ switch (n1) {
182
+ case 0:
183
+ gsl_vector_int_set(p0, 0, 1);
184
+ break;
185
+ case 1:
186
+ memcpy(p0->data, coef1, 2*sizeof(int));
187
+ break;
188
+ case 2:
189
+ memcpy(p0->data, coef2, 3*sizeof(int));
190
+ break;
191
+ default:
192
+ p1 = gsl_vector_int_calloc(n1 + 1);
193
+ memcpy(p1->data, coef2, 3*sizeof(int));
194
+ for (n = 2; n < n1; n++) {
195
+ gsl_vector_int_memcpy(p0, p1);
196
+ mygsl_vector_int_shift(p0, n);
197
+ for (j = 0; j < n; j++) {
198
+ gsl_vector_int_set(p1, j, gsl_vector_int_get(p1, j+1)*(j+1));
199
+ }
200
+ gsl_vector_int_set(p1, n, 0);
201
+ mygsl_vector_int_shift(p1, n);
202
+ gsl_vector_int_add(p0, p1);
203
+ /* save for the next iteration */
204
+ gsl_vector_int_memcpy(p1, p0);
205
+ }
206
+ gsl_vector_int_free(p1);
207
+ break;
208
+ }
209
+ return p0;
210
+ }
211
+
212
+ static VALUE rb_gsl_poly_define_poly(VALUE klass, VALUE order,
213
+ gsl_poly_int* (*f)(int n1)) {
214
+ int n1;
215
+ gsl_poly_int *pnew = NULL;
216
+ CHECK_FIXNUM(order);
217
+ n1 = FIX2INT(order);
218
+ if (n1 < 0) rb_raise(rb_eArgError, "order must be >= 0");
219
+ pnew = (*f)(n1);
220
+ return Data_Wrap_Struct(cgsl_poly_int, 0, gsl_vector_int_free, pnew);
221
+ }
222
+
223
+ static VALUE rb_gsl_poly_hermite(VALUE klass, VALUE order)
224
+ {
225
+ return rb_gsl_poly_define_poly(klass, order, mygsl_poly_hermite);
226
+ }
227
+
228
+ static VALUE rb_gsl_poly_cheb(VALUE klass, VALUE order)
229
+ {
230
+ return rb_gsl_poly_define_poly(klass, order, mygsl_poly_cheb);
231
+ }
232
+
233
+ static VALUE rb_gsl_poly_chebII(VALUE klass, VALUE order)
234
+ {
235
+ return rb_gsl_poly_define_poly(klass, order, mygsl_poly_chebII);
236
+ }
237
+
238
+ static VALUE rb_gsl_poly_laguerre(VALUE klass, VALUE order)
239
+ {
240
+ return rb_gsl_poly_define_poly(klass, order, mygsl_poly_laguerre);
241
+ }
242
+
243
+ static VALUE rb_gsl_poly_bessel(VALUE klass, VALUE order)
244
+ {
245
+ return rb_gsl_poly_define_poly(klass, order, mygsl_poly_bessel);
246
+ }
247
+
248
+ static VALUE rb_gsl_poly_bell(VALUE klass, VALUE order)
249
+ {
250
+ return rb_gsl_poly_define_poly(klass, order, mygsl_poly_bell);
251
+ }
252
+
253
+ void Init_gsl_poly2(VALUE module)
254
+ {
255
+ rb_define_singleton_method(cgsl_poly, "hermite", rb_gsl_poly_hermite, 1);
256
+ rb_define_singleton_method(cgsl_poly, "cheb", rb_gsl_poly_cheb, 1);
257
+ rb_define_singleton_method(cgsl_poly, "chebyshev", rb_gsl_poly_cheb, 1);
258
+ rb_define_singleton_method(cgsl_poly, "cheb_I", rb_gsl_poly_cheb, 1);
259
+ rb_define_singleton_method(cgsl_poly, "chebyshev_I", rb_gsl_poly_cheb, 1);
260
+ rb_define_singleton_method(cgsl_poly, "cheb_II", rb_gsl_poly_chebII, 1);
261
+ rb_define_singleton_method(cgsl_poly, "chebyshev_II", rb_gsl_poly_chebII, 1);
262
+ rb_define_singleton_method(cgsl_poly, "bessel", rb_gsl_poly_bessel, 1);
263
+ rb_define_singleton_method(cgsl_poly, "bell", rb_gsl_poly_bell, 1);
264
+ rb_define_singleton_method(cgsl_poly, "laguerre", rb_gsl_poly_laguerre, 1);
265
+ }
@@ -0,0 +1,1885 @@
1
+ /*
2
+ poly_source.c
3
+ Ruby/GSL: Ruby extension library for GSL (GNU Scientific Library)
4
+ (C) Copyright 2001-2006 by Yoshiki Tsunesada
5
+
6
+ Ruby/GSL is free software: you can redistribute it and/or modify it
7
+ under the terms of the GNU General Public License.
8
+ This library is distributed in the hope that it will be useful, but
9
+ WITHOUT ANY WARRANTY.
10
+ */
11
+
12
+ #ifdef BASE_DOUBLE
13
+ #define NUMCONV(x) NUM2DBL(x)
14
+ #define NUMCONV2(x) NUM2DBL(x)
15
+ #define MAT_ROW_COL MATRIX_ROW_COL
16
+ #define MAT_P MATRIX_P
17
+ #define MAT_ROW_P MATRIX_ROW_P
18
+ #define MAT_COL_P MATRIX_COL_P
19
+ #define C_TO_VALUE rb_float_new
20
+ #define C_TO_VALUE2 rb_float_new
21
+ #define CHECK_MAT CHECK_MATRIX
22
+ #define MAT_VIEW_P MATRIX_VIEW_P
23
+ #define PRINTF_FORMAT "%4.3e "
24
+ #define VEC_ROW_COL VECTOR_ROW_COL
25
+ #define VEC_P VECTOR_P
26
+ #define VEC_ROW_P VECTOR_ROW_P
27
+ #define VEC_COL_P VECTOR_COL_P
28
+ #define CHECK_VEC CHECK_VECTOR
29
+ #define VEC_VIEW_P VECTOR_VIEW_P
30
+ #elif defined(BASE_INT)
31
+ #define NUMCONV(x) NUM2DBL(x)
32
+ #define NUMCONV2(x) NUM2INT(x)
33
+ #define PRINTF_FORMAT "%d "
34
+ #define MAT_ROW_COL MATRIX_INT_ROW_COL
35
+ #define MAT_P MATRIX_INT_P
36
+ #define C_TO_VALUE INT2FIX
37
+ #define C_TO_VALUE2 INT2NUM
38
+ #define MAT_ROW_P MATRIX_INT_ROW_P
39
+ #define MAT_COL_P MATRIX_INT_COL_P
40
+ #define CHECK_MAT CHECK_MATRIX_INT
41
+ #define MAT_VIEW_P MATRIX_INT_VIEW_P
42
+ #define VEC_ROW_COL VECTOR_INT_ROW_COL
43
+ #define VEC_P VECTOR_INT_P
44
+ #define VEC_ROW_P VECTOR_INT_ROW_P
45
+ #define VEC_COL_P VECTOR_INT_COL_P
46
+ #define CHECK_VEC CHECK_VECTOR_INT
47
+ #define VEC_VIEW_P VECTOR_INT_VIEW_P
48
+ #endif
49
+
50
+ #ifdef BASE_DOUBLE
51
+ VALUE cgsl_poly, cgsl_poly_int;
52
+ VALUE cgsl_poly_workspace;
53
+ VALUE cgsl_poly_complex_workspace;
54
+ #ifdef GSL_1_1_LATER
55
+ VALUE cgsl_poly_dd;
56
+ VALUE cgsl_poly_taylor;
57
+ #endif
58
+ #endif
59
+
60
+ #ifdef BASE_INT
61
+ double gsl_poly_int_eval(const BASE c[], const int len, const double x)
62
+ {
63
+ int i;
64
+ double ans = (double) c[len-1];
65
+ for(i=len-1; i>0; i--) ans = (double) c[i-1] + x * ans;
66
+ return ans;
67
+ }
68
+ #endif
69
+ #ifdef BASE_DOUBLE
70
+ #ifdef HAVE_NARRAY_H
71
+ #include "rb_gsl_with_narray.h"
72
+ #endif
73
+ #ifdef GSL_1_11_LATER
74
+ static VALUE rb_gsl_complex_poly_complex_eval(VALUE a, VALUE b);
75
+ #endif
76
+ static VALUE rb_gsl_poly_eval_singleton(VALUE klass, VALUE a, VALUE x)
77
+ {
78
+ gsl_vector *v = NULL, *vx, *vnew;
79
+ gsl_matrix *mx, *mnew;
80
+ double rslt;
81
+ int flag = 0;
82
+ size_t i, N, n;
83
+ VALUE val;
84
+ double *ptr0;
85
+ double *ptr1, *ptr2;
86
+ #ifdef HAVE_NARRAY_H
87
+ int shape[1];
88
+ #endif
89
+ #ifdef GSL_1_11_LATER
90
+ gsl_complex *z, zz;
91
+ gsl_vector_complex *vz, *vznew;
92
+ if (rb_obj_is_kind_of(a, cgsl_vector_complex))
93
+ return rb_gsl_complex_poly_complex_eval(a, x);
94
+ #endif
95
+ switch (TYPE(a)) {
96
+ case T_ARRAY:
97
+ #ifdef GSL_1_11_LATER
98
+ if (rb_obj_is_kind_of(rb_ary_entry(a, 0), cgsl_complex))
99
+ return rb_gsl_complex_poly_complex_eval(a, x);
100
+ #endif
101
+ v = make_cvector_from_rarray(a);
102
+ N = v->size;
103
+ ptr0 = v->data;
104
+ flag = 1;
105
+ break;
106
+ default:
107
+ if (rb_obj_is_kind_of(a, cgsl_vector)) {
108
+ Data_Get_Struct(a, gsl_vector, v);
109
+ N = v->size;
110
+ ptr0 = v->data;
111
+ #ifdef HAVE_NARRAY_H
112
+ } else if (NA_IsNArray(a)) {
113
+ N = NA_TOTAL(a);
114
+ ptr0 = NA_PTR_TYPE(a, double*);
115
+ #endif
116
+ } else {
117
+ rb_raise(rb_eTypeError, "Wrong argument type %s (Array, GSL::Vector or NArray expected)",
118
+ rb_class2name(CLASS_OF(a)));
119
+ }
120
+ }
121
+ switch (TYPE(x)) {
122
+ case T_FIXNUM:
123
+ case T_BIGNUM:
124
+ case T_FLOAT:
125
+ val = rb_float_new(gsl_poly_eval(ptr0, N, NUM2DBL(x)));
126
+ break;
127
+ case T_ARRAY:
128
+ n = RARRAY_LEN(x);
129
+ val = rb_ary_new2(n);
130
+ for (i = 0; i < n; i++) {
131
+ rslt = gsl_poly_eval(ptr0, N, NUM2DBL(rb_ary_entry(x, i)));
132
+ rb_ary_store(val, i, rb_float_new(rslt));
133
+ }
134
+ break;
135
+ default:
136
+ if (rb_obj_is_kind_of(x, cgsl_vector)) {
137
+ Data_Get_Struct(x, gsl_vector, vx);
138
+ vnew = gsl_vector_alloc(vx->size);
139
+ val = Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, vnew);
140
+ n = vx->size;
141
+ ptr1 = vx->data;
142
+ ptr2 = vnew->data;
143
+ } else if (rb_obj_is_kind_of(x, cgsl_matrix)) {
144
+ Data_Get_Struct(x, gsl_matrix, mx);
145
+ mnew = gsl_matrix_alloc(mx->size1, mx->size2);
146
+ val = Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mnew);
147
+ n = mx->size1*mx->size2;
148
+ ptr1 = mx->data;
149
+ ptr2 = mnew->data;
150
+ #ifdef HAVE_NARRAY_H
151
+ } else if (NA_IsNArray(x)) {
152
+ shape[0] = NA_TOTAL(x);
153
+ n = shape[0];
154
+ val = na_make_object(NA_DFLOAT, 1, shape, CLASS_OF(x));
155
+ ptr1 = NA_PTR_TYPE(x, double*);
156
+ ptr2 = NA_PTR_TYPE(val, double*);
157
+ #endif
158
+ #ifdef GSL_1_11_LATER
159
+ } else if (rb_obj_is_kind_of(x, cgsl_complex)) {
160
+ Data_Get_Struct(x, gsl_complex, z);
161
+ zz = gsl_poly_complex_eval(ptr0, N, *z);
162
+ z = make_complex(GSL_REAL(zz), GSL_IMAG(zz));
163
+ if (flag == 1) gsl_vector_free(v);
164
+ return Data_Wrap_Struct(cgsl_complex, 0, free, z);
165
+ } else if (rb_obj_is_kind_of(x, cgsl_vector_complex)) {
166
+ Data_Get_Struct(x, gsl_vector_complex, vz);
167
+ vznew = gsl_vector_complex_alloc(vz->size);
168
+ for (i = 0; i < vz->size; i++) {
169
+ zz = gsl_poly_complex_eval(ptr0, N, gsl_vector_complex_get(vz, i));
170
+ gsl_vector_complex_set(vznew, i, zz);
171
+ }
172
+ if (flag == 1) gsl_vector_free(v);
173
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, vznew);
174
+ #endif
175
+ } else {
176
+ rb_raise(rb_eTypeError, "Wrong argument type %s (A number, Array, GSL::Vector or NArray expected)",
177
+ rb_class2name(CLASS_OF(a)));
178
+ }
179
+ for (i = 0; i < n; i++) {
180
+ ptr2[i] = gsl_poly_eval(ptr0, N, ptr1[i]);
181
+ }
182
+ }
183
+ if (flag == 1) gsl_vector_free(v);
184
+ return val;
185
+ }
186
+ #ifdef GSL_1_11_LATER
187
+ static VALUE rb_gsl_complex_poly_complex_eval(VALUE a, VALUE b)
188
+ {
189
+ gsl_vector_complex *coef, *zb, *vnew;
190
+ gsl_complex *zc;
191
+ gsl_complex z, *zx, *res;
192
+ VALUE ret;
193
+ size_t i, N;
194
+ int flag = 0;
195
+ if (rb_obj_is_kind_of(a, cgsl_vector_complex)) {
196
+ Data_Get_Struct(a, gsl_vector_complex, coef);
197
+ N = coef->size;
198
+ zc = (gsl_complex*) coef->data;
199
+ } else if (TYPE(a) == T_ARRAY) {
200
+ N = RARRAY_LEN(a);
201
+ zc = (gsl_complex*) malloc(sizeof(gsl_complex));
202
+ flag = 1;
203
+ for (i = 0; i < N; i++) {
204
+ Data_Get_Struct(rb_ary_entry(a, i), gsl_complex, zx);
205
+ zc[i] = *zx;
206
+ }
207
+ } else {
208
+ rb_raise(rb_eTypeError, "rb_gsl_complex_poly_complex_solve: wrong argument type %s (GSL::Vector::Complex or Array expected)\n", rb_class2name(CLASS_OF(a)));
209
+ }
210
+
211
+ switch (TYPE(b)) {
212
+ case T_FIXNUM:
213
+ case T_BIGNUM:
214
+ case T_FLOAT:
215
+ res = (gsl_complex*) malloc(sizeof(gsl_complex));
216
+ ret = Data_Wrap_Struct(cgsl_complex, 0, free, res);
217
+ GSL_SET_REAL(&z, NUM2DBL(b));
218
+ GSL_SET_IMAG(&z, 0.0);
219
+ *res = gsl_complex_poly_complex_eval(zc, coef->size, z);
220
+ break;
221
+ case T_ARRAY:
222
+ ret = rb_ary_new2(RARRAY_LEN(b));
223
+ for (i = 0; i < RARRAY_LEN(b); i++) {
224
+ Data_Get_Struct(rb_ary_entry(b, i), gsl_complex, zx);
225
+ res = (gsl_complex*) malloc(sizeof(gsl_complex));
226
+ *res = gsl_complex_poly_complex_eval(zc, N, *zx);
227
+ rb_ary_store(ret, i, Data_Wrap_Struct(cgsl_complex, 0, free, res));
228
+ }
229
+ break;
230
+ default:
231
+ if (rb_obj_is_kind_of(b, cgsl_complex)) {
232
+ res = (gsl_complex*) malloc(sizeof(gsl_complex));
233
+ ret = Data_Wrap_Struct(cgsl_complex, 0, free, res);
234
+ Data_Get_Struct(b, gsl_complex, zx);
235
+ *res = gsl_complex_poly_complex_eval(zc, N, *zx);
236
+ } else if (rb_obj_is_kind_of(b, cgsl_vector_complex)) {
237
+ Data_Get_Struct(b, gsl_vector_complex, zb);
238
+ vnew = gsl_vector_complex_alloc(zb->size);
239
+ ret = Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, vnew);
240
+ for (i = 0; i < zb->size; i++) {
241
+ z = gsl_vector_complex_get(zb, i);
242
+ gsl_vector_complex_set(vnew, i, gsl_complex_poly_complex_eval(zc, N, z));
243
+ }
244
+ } else {
245
+ rb_raise(rb_eTypeError, "Wrong argument type %s.\n", rb_class2name(CLASS_OF(b)));
246
+ }
247
+ }
248
+ if (flag == 1) free(zc);
249
+ return ret;
250
+ }
251
+ #endif
252
+ #endif
253
+
254
+ static VALUE FUNCTION(rb_gsl_poly,eval)(VALUE obj, VALUE xx)
255
+ {
256
+ GSL_TYPE(gsl_poly) *p = NULL;
257
+ GSL_TYPE(gsl_vector) *v = NULL;
258
+ GSL_TYPE(gsl_matrix) *m = NULL;
259
+ gsl_vector *vnew = NULL;
260
+ gsl_matrix *mnew = NULL;
261
+ VALUE x, ary;
262
+ size_t i, j;
263
+ #ifdef BASE_DOUBLE
264
+ #ifdef HAVE_NARRAY_H
265
+ struct NARRAY *na;
266
+ double *ptr1, *ptr2;
267
+ size_t n;
268
+ #endif
269
+ #ifdef GSL_1_11_LATER
270
+ gsl_complex *z, zz;
271
+ gsl_vector_complex *vz, *vznew;
272
+ #endif
273
+ #endif
274
+
275
+ Data_Get_Struct(obj, GSL_TYPE(gsl_poly), p);
276
+ if (CLASS_OF(xx) == rb_cRange) xx = rb_gsl_range2ary(xx);
277
+ switch (TYPE(xx)) {
278
+ case T_FIXNUM:
279
+ case T_BIGNUM:
280
+ case T_FLOAT:
281
+ return rb_float_new(FUNCTION(gsl_poly,eval)(p->data, p->size, NUM2DBL(xx)));
282
+ break;
283
+ case T_ARRAY:
284
+ ary = rb_ary_new2(RARRAY_LEN(xx));
285
+ for (i = 0; i < RARRAY_LEN(xx); i++) {
286
+ x = rb_ary_entry(xx, i);
287
+ Need_Float(x);
288
+ rb_ary_store(ary, i, rb_float_new(FUNCTION(gsl_poly,eval)(p->data, p->size, NUM2DBL(x))));
289
+ }
290
+ return ary;
291
+ break;
292
+ default:
293
+ #ifdef BASE_DOUBLE
294
+ #ifdef HAVE_NARRAY_H
295
+ if (NA_IsNArray(xx)) {
296
+ GetNArray(xx, na);
297
+ ptr1 = (double*) na->ptr;
298
+ n = na->total;
299
+ ary = na_make_object(NA_DFLOAT, na->rank, na->shape, CLASS_OF(xx));
300
+ ptr2 = NA_PTR_TYPE(ary,double*);
301
+ for (i = 0; i < n; i++) ptr2[i] = FUNCTION(gsl_poly,eval)(p->data,p->size,ptr1[i]);
302
+ return ary;
303
+ }
304
+ #endif
305
+ #endif
306
+ if (VEC_P(xx)) {
307
+ Data_Get_Struct(xx, GSL_TYPE(gsl_vector), v);
308
+ vnew = gsl_vector_alloc(v->size);
309
+ for (i = 0; i < v->size; i++) {
310
+ gsl_vector_set(vnew, i, FUNCTION(gsl_poly,eval)(p->data, p->size, FUNCTION(gsl_vector,get)(v, i)));
311
+ }
312
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, vnew);
313
+ } else if (MAT_P(xx)) {
314
+ Data_Get_Struct(xx, GSL_TYPE(gsl_matrix), m);
315
+ mnew = gsl_matrix_alloc(m->size1, m->size2);
316
+ for (i = 0; i < m->size1; i++) {
317
+ for (j = 0; j < m->size2; j++) {
318
+ gsl_matrix_set(mnew, i, j,
319
+ FUNCTION(gsl_poly,eval)(p->data, p->size, FUNCTION(gsl_matrix,get)(m, i, j)));
320
+ }
321
+ }
322
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mnew);
323
+ #ifdef BASE_DOUBLE
324
+ #ifdef GSL_1_11_LATER
325
+ } else if (rb_obj_is_kind_of(xx, cgsl_complex)) {
326
+ Data_Get_Struct(xx, gsl_complex, z);
327
+ zz = gsl_poly_complex_eval(p->data, p->size, *z);
328
+ z = make_complex(GSL_REAL(zz), GSL_IMAG(zz));
329
+ return Data_Wrap_Struct(cgsl_complex, 0, free, z);
330
+ } else if (rb_obj_is_kind_of(xx, cgsl_vector_complex)) {
331
+ Data_Get_Struct(xx, gsl_vector_complex, vz);
332
+ vznew = gsl_vector_complex_alloc(vz->size);
333
+ for (i = 0; i < vz->size; i++) {
334
+ zz = gsl_poly_complex_eval(p->data, p->size, gsl_vector_complex_get(vz, i));
335
+ gsl_vector_complex_set(vznew, i, zz);
336
+ }
337
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, vznew);
338
+ #endif
339
+ #endif
340
+ } else {
341
+ rb_raise(rb_eTypeError, "wrong argument type");
342
+ }
343
+ break;
344
+ }
345
+ return Qnil; /* never reach here */
346
+ }
347
+
348
+ /* singleton method */
349
+ static VALUE FUNCTION(rb_gsl_poly,eval2)(int argc, VALUE *argv, VALUE obj)
350
+ {
351
+ GSL_TYPE(gsl_poly) *p = NULL;
352
+ GSL_TYPE(gsl_vector) *v = NULL;
353
+ GSL_TYPE(gsl_matrix) *m = NULL;
354
+ gsl_vector *vnew = NULL;
355
+ gsl_matrix *mnew = NULL;
356
+ VALUE xx, x, ary;
357
+ size_t i, j, size;
358
+ #ifdef BASE_DOUBLE
359
+ #ifdef HAVE_NARRAY_H
360
+ struct NARRAY *na;
361
+ double *ptr1, *ptr2;
362
+ #endif
363
+ #endif
364
+ switch (argc) {
365
+ case 2:
366
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_poly), p);
367
+ size = p->size;
368
+ xx = argv[1];
369
+ break;
370
+ case 3:
371
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_poly), p);
372
+ size = FIX2INT(argv[1]);
373
+ xx = argv[2];
374
+ break;
375
+ default:
376
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 2 or 3)", argc);
377
+ break;
378
+ }
379
+ if (CLASS_OF(xx) == rb_cRange) xx = rb_gsl_range2ary(xx);
380
+ switch (TYPE(xx)) {
381
+ case T_FIXNUM:
382
+ case T_BIGNUM:
383
+ case T_FLOAT:
384
+ return rb_float_new(FUNCTION(gsl_poly,eval)(p->data, size, NUM2DBL(xx)));
385
+ break;
386
+ case T_ARRAY:
387
+ ary = rb_ary_new2(RARRAY_LEN(xx));
388
+ for (i = 0; i < RARRAY_LEN(xx); i++) {
389
+ x = rb_ary_entry(xx, i);
390
+ Need_Float(x);
391
+ rb_ary_store(ary, i, rb_float_new(FUNCTION(gsl_poly,eval)(p->data, size, NUM2DBL(x))));
392
+ }
393
+ return ary;
394
+ break;
395
+ default:
396
+ #ifdef BASE_DOUBLE
397
+ #ifdef HAVE_NARRAY_H
398
+ if (NA_IsNArray(xx)) {
399
+ GetNArray(xx, na);
400
+ ptr1 = (double*) na->ptr;
401
+ size = na->total;
402
+ ary = na_make_object(NA_DFLOAT, na->rank, na->shape, CLASS_OF(xx));
403
+ ptr2 = NA_PTR_TYPE(ary,double*);
404
+ for (i = 0; i < size; i++) ptr2[i] = FUNCTION(gsl_poly,eval)(p->data,p->size,ptr1[i]);
405
+ return ary;
406
+ }
407
+ #endif
408
+ #endif
409
+ if (VEC_P(xx)) {
410
+ Data_Get_Struct(xx, GSL_TYPE(gsl_vector), v);
411
+ vnew = gsl_vector_alloc(v->size);
412
+ for (i = 0; i < v->size; i++) {
413
+ gsl_vector_set(vnew, i, FUNCTION(gsl_poly,eval)(p->data, size, FUNCTION(gsl_vector,get)(v, i)));
414
+ }
415
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, vnew);
416
+ } else if (MAT_P(xx)) {
417
+ Data_Get_Struct(xx, GSL_TYPE(gsl_matrix), m);
418
+ mnew = gsl_matrix_alloc(m->size1, m->size2);
419
+ for (i = 0; i < m->size1; i++) {
420
+ for (j = 0; j < m->size2; j++) {
421
+ gsl_matrix_set(mnew, i, j,
422
+ FUNCTION(gsl_poly,eval)(p->data, size, FUNCTION(gsl_matrix,get)(m, i, j)));
423
+ }
424
+ }
425
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mnew);
426
+ } else {
427
+ rb_raise(rb_eTypeError, "wrong argument type");
428
+ }
429
+ break;
430
+ }
431
+ return Qnil; /* never reach here */
432
+ }
433
+
434
+ /* ax*x + bx + c = 0 */
435
+ static VALUE FUNCTION(rb_gsl_poly,solve_quadratic)(int argc, VALUE *argv, VALUE obj)
436
+ {
437
+ double x0, x1;
438
+ GSL_TYPE(gsl_poly) *v = NULL;
439
+ gsl_vector *r;
440
+ int n;
441
+ switch (argc) {
442
+ case 3:
443
+ n = gsl_poly_solve_quadratic(NUMCONV2(argv[0]), NUMCONV2(argv[1]), NUMCONV2(argv[2]),
444
+ &x0, &x1);
445
+ break;
446
+ case 1:
447
+ switch (TYPE(argv[0])) {
448
+ case T_ARRAY:
449
+ n = gsl_poly_solve_quadratic(NUMCONV2(rb_ary_entry(argv[0], 0)),
450
+ NUMCONV2(rb_ary_entry(argv[0], 1)),
451
+ NUMCONV2(rb_ary_entry(argv[0], 2)),
452
+ &x0, &x1);
453
+ break;
454
+ default:
455
+ CHECK_VEC(argv[0]);
456
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_poly), v);
457
+ n = gsl_poly_solve_quadratic(FUNCTION(gsl_vector,get)(v, 0),
458
+ FUNCTION(gsl_vector,get)(v, 1),
459
+ FUNCTION(gsl_vector,get)(v, 2),
460
+ &x0, &x1);
461
+ break;
462
+ }
463
+ break;
464
+ default:
465
+ rb_raise(rb_eArgError,
466
+ "wrong number of arguments (3 numbers or 1 array or 1 vector)");
467
+ break;
468
+ }
469
+ r = gsl_vector_alloc(2);
470
+ gsl_vector_set(r, 0, x0);
471
+ gsl_vector_set(r, 1, x1);
472
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, r);
473
+ }
474
+
475
+ static VALUE FUNCTION(rb_gsl_poly,complex_solve_quadratic)(int argc, VALUE *argv, VALUE obj)
476
+ {
477
+ gsl_complex z0, z1;
478
+ GSL_TYPE(gsl_vector) *v = NULL;
479
+ gsl_vector_complex *r = NULL;
480
+ int n;
481
+ switch (argc) {
482
+ case 3:
483
+ n = gsl_poly_complex_solve_quadratic(NUMCONV2(argv[0]),
484
+ NUMCONV2(argv[1]), NUMCONV2(argv[2]),
485
+ &z0, &z1);
486
+ break;
487
+ case 1:
488
+ switch (TYPE(argv[0])) {
489
+ case T_ARRAY:
490
+ n = gsl_poly_complex_solve_quadratic(NUMCONV2(rb_ary_entry(argv[0], 0)),
491
+ NUMCONV2(rb_ary_entry(argv[0], 1)),
492
+ NUMCONV2(rb_ary_entry(argv[0], 2)),
493
+ &z0, &z1);
494
+ break;
495
+ default:
496
+ CHECK_VEC(argv[0]);
497
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_vector), v);
498
+ n = gsl_poly_complex_solve_quadratic(FUNCTION(gsl_vector,get)(v, 0),
499
+ FUNCTION(gsl_vector,get)(v, 1),
500
+ FUNCTION(gsl_vector,get)(v, 2),
501
+ &z0, &z1);
502
+ break;
503
+ }
504
+ break;
505
+ default:
506
+ rb_raise(rb_eArgError,
507
+ "wrong number of arguments (3 numbers or 1 array or 1 vector)");
508
+ break;
509
+ }
510
+ r = gsl_vector_complex_alloc(2);
511
+ gsl_vector_complex_set(r, 0, z0);
512
+ gsl_vector_complex_set(r, 1, z1);
513
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
514
+ }
515
+
516
+ static VALUE FUNCTION(rb_gsl_poly,solve_cubic)(int argc, VALUE *argv, VALUE obj)
517
+ {
518
+ double x0, x1, x2;
519
+ GSL_TYPE(gsl_vector) *v = NULL;
520
+ gsl_vector *r = NULL;
521
+ int n;
522
+ switch (argc) {
523
+ case 3:
524
+ n = gsl_poly_solve_cubic(NUMCONV2(argv[0]), NUMCONV2(argv[1]), NUMCONV2(argv[2]),
525
+ &x0, &x1, &x2);
526
+ break;
527
+ case 1:
528
+ switch (TYPE(argv[0])) {
529
+ case T_ARRAY:
530
+ n = gsl_poly_solve_cubic(NUMCONV2(rb_ary_entry(argv[0], 0)),
531
+ NUMCONV2(rb_ary_entry(argv[0], 1)),
532
+ NUMCONV2(rb_ary_entry(argv[0], 2)),
533
+ &x0, &x1, &x2);
534
+ break;
535
+ default:
536
+ CHECK_VEC(argv[0]);
537
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_vector), v);
538
+ n = gsl_poly_solve_cubic(FUNCTION(gsl_vector,get)(v, 0),
539
+ FUNCTION(gsl_vector,get)(v, 1),
540
+ FUNCTION(gsl_vector,get)(v, 2),
541
+ &x0, &x1, &x2);
542
+ break;
543
+ }
544
+ break;
545
+ default:
546
+ rb_raise(rb_eArgError,
547
+ "wrong number of arguments (3 numbers or 1 array or 1 vector)");
548
+ break;
549
+ }
550
+ r = gsl_vector_alloc(3);
551
+ gsl_vector_set(r, 0, x0);
552
+ gsl_vector_set(r, 1, x1);
553
+ gsl_vector_set(r, 2, x2);
554
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, r);
555
+ }
556
+
557
+ static VALUE FUNCTION(rb_gsl_poly,complex_solve_cubic)(int argc, VALUE *argv, VALUE obj)
558
+ {
559
+ gsl_complex z0, z1, z2;
560
+ GSL_TYPE(gsl_vector) *v = NULL;
561
+ gsl_vector_complex *r = NULL;
562
+ int n;
563
+ switch (argc) {
564
+ case 3:
565
+ n = gsl_poly_complex_solve_cubic(NUMCONV2(argv[0]), NUMCONV2(argv[1]), NUMCONV2(argv[2]),
566
+ &z0, &z1, &z2);
567
+ break;
568
+ case 1:
569
+ switch (TYPE(argv[0])) {
570
+ case T_ARRAY:
571
+ n = gsl_poly_complex_solve_cubic(NUMCONV2(rb_ary_entry(argv[0], 0)),
572
+ NUMCONV2(rb_ary_entry(argv[0], 1)),
573
+ NUMCONV2(rb_ary_entry(argv[0], 2)),
574
+ &z0, &z1, &z2);
575
+ break;
576
+ default:
577
+ CHECK_VEC(argv[0]);
578
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_vector), v);
579
+ n = gsl_poly_complex_solve_cubic(FUNCTION(gsl_vector,get)(v, 0),
580
+ FUNCTION(gsl_vector,get)(v, 1),
581
+ FUNCTION(gsl_vector,get)(v, 2),
582
+ &z0, &z1, &z2);
583
+ break;
584
+ }
585
+ break;
586
+ default:
587
+ rb_raise(rb_eArgError,
588
+ "wrong number of arguments (3 numbers or 1 array or 1 vector)");
589
+ break;
590
+ }
591
+ r = gsl_vector_complex_alloc(3);
592
+ gsl_vector_complex_set(r, 0, z0);
593
+ gsl_vector_complex_set(r, 1, z1);
594
+ gsl_vector_complex_set(r, 2, z2);
595
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
596
+ }
597
+
598
+ #ifdef HAVE_POLY_SOLVE_QUARTIC
599
+ static VALUE FUNCTION(rb_gsl_poly,solve_quartic)(int argc, VALUE *argv, VALUE obj)
600
+ {
601
+ double x0, x1, x2, x3;
602
+ GSL_TYPE(gsl_vector) *v = NULL;
603
+ gsl_vector *r = NULL;
604
+ int n;
605
+ switch (argc) {
606
+ case 4:
607
+ n = gsl_poly_solve_quartic(NUMCONV2(argv[0]), NUMCONV2(argv[1]), NUMCONV2(argv[2]),
608
+ NUMCONV2(argv[3]),
609
+ &x0, &x1, &x2, &x3);
610
+ break;
611
+ case 1:
612
+ switch (TYPE(argv[0])) {
613
+ case T_ARRAY:
614
+ n = gsl_poly_solve_quartic(NUMCONV2(rb_ary_entry(argv[0], 0)),
615
+ NUMCONV2(rb_ary_entry(argv[0], 1)),
616
+ NUMCONV2(rb_ary_entry(argv[0], 2)),
617
+ NUMCONV2(rb_ary_entry(argv[0], 3)),
618
+ &x0, &x1, &x2, &x3);
619
+ break;
620
+ default:
621
+ CHECK_VEC(argv[0]);
622
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_vector), v);
623
+ n = gsl_poly_solve_quartic(FUNCTION(gsl_vector,get)(v, 0),
624
+ FUNCTION(gsl_vector,get)(v, 1),
625
+ FUNCTION(gsl_vector,get)(v, 2),
626
+ FUNCTION(gsl_vector,get)(v, 3),
627
+ &x0, &x1, &x2, &x3);
628
+ break;
629
+ }
630
+ break;
631
+ default:
632
+ rb_raise(rb_eArgError,
633
+ "wrong number of arguments (3 numbers or 1 array or 1 vector)");
634
+ break;
635
+ }
636
+ r = gsl_vector_alloc(4);
637
+ gsl_vector_set(r, 0, x0);
638
+ gsl_vector_set(r, 1, x1);
639
+ gsl_vector_set(r, 2, x2);
640
+ gsl_vector_set(r, 3, x3);
641
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, r);
642
+ }
643
+
644
+ static VALUE FUNCTION(rb_gsl_poly,complex_solve_quartic)(int argc, VALUE *argv, VALUE obj)
645
+ {
646
+ gsl_complex z0, z1, z2, z3;
647
+ GSL_TYPE(gsl_vector) *v = NULL;
648
+ gsl_vector_complex *r = NULL;
649
+ int n;
650
+ switch (argc) {
651
+ case 4:
652
+ n = gsl_poly_complex_solve_quartic(NUMCONV2(argv[0]), NUMCONV2(argv[1]),
653
+ NUMCONV2(argv[2]), NUMCONV2(argv[3]),
654
+ &z0, &z1, &z2, &z3);
655
+ break;
656
+ case 1:
657
+ switch (TYPE(argv[0])) {
658
+ case T_ARRAY:
659
+ n = gsl_poly_complex_solve_quartic(NUMCONV2(rb_ary_entry(argv[0], 0)),
660
+ NUMCONV2(rb_ary_entry(argv[0], 1)),
661
+ NUMCONV2(rb_ary_entry(argv[0], 2)),
662
+ NUMCONV2(rb_ary_entry(argv[0], 3)),
663
+ &z0, &z1, &z2, &z3);
664
+ break;
665
+ default:
666
+ CHECK_VEC(argv[0]);
667
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_vector), v);
668
+ n = gsl_poly_complex_solve_quartic(FUNCTION(gsl_vector,get)(v, 0),
669
+ FUNCTION(gsl_vector,get)(v, 1),
670
+ FUNCTION(gsl_vector,get)(v, 2),
671
+ FUNCTION(gsl_vector,get)(v, 3),
672
+ &z0, &z1, &z2, &z3);
673
+ break;
674
+ }
675
+ break;
676
+ default:
677
+ rb_raise(rb_eArgError,
678
+ "wrong number of arguments (3 numbers or 1 array or 1 vector)");
679
+ break;
680
+ }
681
+ r = gsl_vector_complex_alloc(4);
682
+ gsl_vector_complex_set(r, 0, z0);
683
+ gsl_vector_complex_set(r, 1, z1);
684
+ gsl_vector_complex_set(r, 2, z2);
685
+ gsl_vector_complex_set(r, 3, z3);
686
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
687
+ }
688
+
689
+ #endif
690
+ /* singleton method */
691
+ VALUE FUNCTION(rb_gsl_poly,complex_solve)(int argc, VALUE *argv, VALUE obj)
692
+ {
693
+ int size = -1, size2;
694
+ gsl_poly_complex_workspace *w = NULL;
695
+ GSL_TYPE(gsl_vector) *v = NULL;
696
+ gsl_vector *a = NULL, *z = NULL;
697
+ gsl_complex c;
698
+ gsl_vector_complex *r = NULL;
699
+ int status, i, flag = 0;
700
+
701
+ switch (argc) {
702
+ case 1:
703
+ break;
704
+ case 2:
705
+ if (TYPE(argv[1]) == T_FIXNUM) size = FIX2INT(argv[1]);
706
+ break;
707
+ case 3:
708
+ if (TYPE(argv[1]) == T_FIXNUM) size = FIX2INT(argv[1]);
709
+ break;
710
+ default:
711
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 1-3)", argc);
712
+ break;
713
+ }
714
+
715
+ switch (TYPE(argv[0])) {
716
+ case T_ARRAY:
717
+ if (size < 0) size = RARRAY_LEN(argv[0]);
718
+ a = gsl_vector_alloc(size);
719
+ for (i = 0; i < size; i++) gsl_vector_set(a, i, NUMCONV2(rb_ary_entry(argv[0], i)));
720
+ break;
721
+ case T_FIXNUM:
722
+ case T_BIGNUM:
723
+ case T_FLOAT:
724
+ if (rb_obj_is_kind_of(argv[argc-1], cgsl_poly_workspace)) size = argc - 1;
725
+ else size = argc;
726
+ a = gsl_vector_alloc(size);
727
+ for (i = 0; i < size; i++) gsl_vector_set(a, i, NUMCONV2(argv[i]));
728
+ break;
729
+ default:
730
+ if (rb_obj_is_kind_of(argv[0], GSL_TYPE(cgsl_vector))) {
731
+ Data_Get_Struct(argv[0], GSL_TYPE(gsl_vector), v);
732
+ if (size < 0) size = v->size;
733
+ } else {
734
+ rb_raise(rb_eTypeError, "wrong argument type (Array, Vector, or Numeric expected");
735
+ }
736
+ a = gsl_vector_alloc(v->size);
737
+ for (i = 0; i < size; i++) gsl_vector_set(a, i, FUNCTION(gsl_vector,get)(v, i));
738
+ break;
739
+ }
740
+ size2 = 2*(size - 1);
741
+ z = gsl_vector_alloc(size2);
742
+ if (rb_obj_is_kind_of(argv[argc-1], cgsl_poly_workspace)
743
+ || rb_obj_is_kind_of(argv[argc-1], cgsl_poly_complex_workspace)) {
744
+ Data_Get_Struct(argv[argc-1], gsl_poly_complex_workspace, w);
745
+ flag = 0;
746
+ } else {
747
+ w = gsl_poly_complex_workspace_alloc(size);
748
+ flag = 1;
749
+ }
750
+ status = gsl_poly_complex_solve(a->data, size, w, z->data);
751
+
752
+ if (flag == 1) gsl_poly_complex_workspace_free(w);
753
+ gsl_vector_free(a);
754
+ r = gsl_vector_complex_alloc(size - 1);
755
+ for (i = 0; i < size - 1; i++) {
756
+ c.dat[0] = gsl_vector_get(z, i*2);
757
+ c.dat[1] = gsl_vector_get(z, i*2+1);
758
+ gsl_vector_complex_set(r, i, c);
759
+ }
760
+ gsl_vector_free(z);
761
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
762
+ }
763
+
764
+
765
+ /* a2 x*x + a1 x + a0 = 0 */
766
+ static VALUE FUNCTION(rb_gsl_poly,solve_quadratic2)(VALUE obj)
767
+ {
768
+ GSL_TYPE(gsl_vector) *v = NULL;
769
+ gsl_vector *r = NULL;
770
+ gsl_vector_complex *r2 = NULL;
771
+ double a2, a1, a0;
772
+ double d; /* determinant */
773
+ double x0, x1;
774
+ int n;
775
+ gsl_complex z0, z1;
776
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
777
+ if (v->size < 3) {
778
+ rb_raise(rb_eArgError, "the order of the object is less than 3.");
779
+ }
780
+ a2 = FUNCTION(gsl_vector,get)(v, 2); /* coefficients */
781
+ a1 = FUNCTION(gsl_vector,get)(v, 1);
782
+ a0 = FUNCTION(gsl_vector,get)(v, 0);
783
+ d = a1*a1 - 4.0*a2*a0; /* determinant */
784
+ if (d >= 0.0) {
785
+ n = gsl_poly_solve_quadratic(a2, a1, a0, &x0, &x1);
786
+ r = gsl_vector_alloc(2);
787
+ gsl_vector_set(r, 0, x0);
788
+ gsl_vector_set(r, 1, x1);
789
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, r);
790
+ } else {
791
+ n = gsl_poly_complex_solve_quadratic(a2, a1, a0, &z0, &z1);
792
+ r2 = gsl_vector_complex_alloc(2);
793
+ gsl_vector_complex_set(r2, 0, z0);
794
+ gsl_vector_complex_set(r2, 1, z1);
795
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r2);
796
+ }
797
+
798
+ }
799
+
800
+
801
+ static VALUE FUNCTION(rb_gsl_poly,complex_solve_quadratic2)(VALUE obj)
802
+ {
803
+ GSL_TYPE(gsl_vector) *v = NULL;
804
+ gsl_vector_complex *r = NULL;
805
+ double a2, a1, a0;
806
+ double d; /* determinant */
807
+ int n;
808
+ gsl_complex z0, z1;
809
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
810
+ if (v->size < 3) {
811
+ rb_raise(rb_eArgError, "the order of the object is less than 3.");
812
+ }
813
+ a2 = FUNCTION(gsl_vector,get)(v, 2); /* coefficients */
814
+ a1 = FUNCTION(gsl_vector,get)(v, 1);
815
+ a0 = FUNCTION(gsl_vector,get)(v, 0);
816
+ d = a1*a1 - 4.0*a2*a0; /* determinant */
817
+ n = gsl_poly_complex_solve_quadratic(a2, a1, a0, &z0, &z1);
818
+ r = gsl_vector_complex_alloc(2);
819
+ gsl_vector_complex_set(r, 0, z0);
820
+ gsl_vector_complex_set(r, 1, z1);
821
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
822
+ }
823
+
824
+ /* x**3 + a2 x**2 + a1 x + a0 = 0 */
825
+ static VALUE FUNCTION(rb_gsl_poly,solve_cubic2)(VALUE obj)
826
+ {
827
+ GSL_TYPE(gsl_vector) *v = NULL;
828
+ gsl_vector *r = NULL;
829
+ double a3, a2, a1, a0;
830
+ double x0, x1, x2;
831
+ int n;
832
+
833
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
834
+ if (v->size < 4) {
835
+ rb_raise(rb_eArgError, "the order of the object is less than 4.");
836
+ }
837
+ a3 = FUNCTION(gsl_vector,get)(v, 3);
838
+ a2 = FUNCTION(gsl_vector,get)(v, 2)/a3; /* coefficients */
839
+ a1 = FUNCTION(gsl_vector,get)(v, 1)/a3;
840
+ a0 = FUNCTION(gsl_vector,get)(v, 0)/a3;
841
+ n = gsl_poly_solve_cubic(a2, a1, a0, &x0, &x1, &x2);
842
+ r = gsl_vector_alloc(3);
843
+ gsl_vector_set(r, 0, x0);
844
+ gsl_vector_set(r, 1, x1);
845
+ gsl_vector_set(r, 2, x2);
846
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, r);
847
+ }
848
+
849
+ static VALUE FUNCTION(rb_gsl_poly,complex_solve_cubic2)(VALUE obj)
850
+ {
851
+ GSL_TYPE(gsl_vector) *v = NULL;
852
+ gsl_vector_complex *r = NULL;
853
+ double a3, a2, a1, a0;
854
+ int n;
855
+ gsl_complex z0, z1, z2;
856
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
857
+ if (v->size < 4) {
858
+ rb_raise(rb_eArgError, "the order of the object is less than 4.");
859
+ }
860
+ a3 = FUNCTION(gsl_vector,get)(v, 3);
861
+ a2 = FUNCTION(gsl_vector,get)(v, 2)/a3; /* coefficients */
862
+ a1 = FUNCTION(gsl_vector,get)(v, 1)/a3;
863
+ a0 = FUNCTION(gsl_vector,get)(v, 0)/a3;
864
+ n = gsl_poly_complex_solve_cubic(a2, a1, a0, &z0, &z1, &z2);
865
+ r = gsl_vector_complex_alloc(3);
866
+ gsl_vector_complex_set(r, 0, z0);
867
+ gsl_vector_complex_set(r, 1, z1);
868
+ gsl_vector_complex_set(r, 2, z2);
869
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
870
+ }
871
+
872
+ #ifdef HAVE_POLY_SOLVE_QUARTIC
873
+ /* a4 x**4 + a3 x**3 + a2 x**2 + a1 x + a0 = 0 */
874
+ static VALUE FUNCTION(rb_gsl_poly,solve_quartic2)(VALUE obj)
875
+ {
876
+ GSL_TYPE(gsl_vector) *v = NULL;
877
+ gsl_vector *r = NULL;
878
+ double a4, a3, a2, a1, a0;
879
+ double x0, x1, x2, x3;
880
+ int n;
881
+
882
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
883
+ if (v->size < 5) {
884
+ rb_raise(rb_eArgError, "the order of the object is less than 4.");
885
+ }
886
+ a4 = FUNCTION(gsl_vector,get)(v, 4);
887
+ a3 = FUNCTION(gsl_vector,get)(v, 3)/a4;
888
+ a2 = FUNCTION(gsl_vector,get)(v, 2)/a4; /* coefficients */
889
+ a1 = FUNCTION(gsl_vector,get)(v, 1)/a4;
890
+ a0 = FUNCTION(gsl_vector,get)(v, 0)/a4;
891
+ n = gsl_poly_solve_quartic(a3, a2, a1, a0, &x0, &x1, &x2, &x3);
892
+ r = gsl_vector_alloc(3);
893
+ r = gsl_vector_alloc(4);
894
+ gsl_vector_set(r, 0, x0);
895
+ gsl_vector_set(r, 1, x1);
896
+ gsl_vector_set(r, 2, x2);
897
+ gsl_vector_set(r, 3, x3);
898
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, r);
899
+ }
900
+
901
+ static VALUE FUNCTION(rb_gsl_poly,complex_solve_quartic2)(VALUE obj)
902
+ {
903
+ GSL_TYPE(gsl_vector) *v = NULL;
904
+ gsl_vector_complex *r = NULL;
905
+ double a4, a3, a2, a1, a0;
906
+ int n;
907
+ gsl_complex z0, z1, z2, z3;
908
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
909
+ if (v->size < 5) {
910
+ rb_raise(rb_eArgError, "the order of the object is less than 4.");
911
+ }
912
+ a4 = FUNCTION(gsl_vector,get)(v, 4);
913
+ a3 = FUNCTION(gsl_vector,get)(v, 3)/a4;
914
+ a2 = FUNCTION(gsl_vector,get)(v, 2)/a4; /* coefficients */
915
+ a1 = FUNCTION(gsl_vector,get)(v, 1)/a4;
916
+ a0 = FUNCTION(gsl_vector,get)(v, 0)/a4;
917
+ n = gsl_poly_complex_solve_quartic(a3, a2, a1, a0, &z0, &z1, &z2, &z3);
918
+ r = gsl_vector_complex_alloc(4);
919
+ gsl_vector_complex_set(r, 0, z0);
920
+ gsl_vector_complex_set(r, 1, z1);
921
+ gsl_vector_complex_set(r, 2, z2);
922
+ gsl_vector_complex_set(r, 3, z3);
923
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
924
+ }
925
+
926
+ #endif
927
+
928
+ /* method */
929
+ VALUE FUNCTION(rb_gsl_poly,complex_solve2)(int argc, VALUE *argv, VALUE obj)
930
+ {
931
+ GSL_TYPE(gsl_vector) *v = NULL;
932
+ gsl_vector *a = NULL, *z = NULL;
933
+ size_t size, size2, i;
934
+ gsl_poly_complex_workspace *w = NULL;
935
+ gsl_complex c;
936
+ gsl_vector_complex *r = NULL;
937
+ int n, flag = 0;
938
+
939
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
940
+ size = v->size;
941
+ size2 = 2*(size - 1);
942
+ z = gsl_vector_alloc(size2);
943
+ a = gsl_vector_alloc(v->size);
944
+ for (i = 0; i < v->size; i++) {
945
+ gsl_vector_set(a, i, FUNCTION(gsl_vector,get)(v, i));
946
+ }
947
+
948
+ if (argc == 1 && rb_obj_is_kind_of(argv[0], cgsl_poly_workspace)) {
949
+ Data_Get_Struct(argv[0], gsl_poly_complex_workspace, w);
950
+ flag = 0;
951
+ } else {
952
+ w = gsl_poly_complex_workspace_alloc(size);
953
+ flag = 1;
954
+ }
955
+
956
+ n = gsl_poly_complex_solve(a->data, size, w, z->data);
957
+
958
+ r = gsl_vector_complex_alloc(size - 1);
959
+ for (i = 0; i < size - 1; i++) {
960
+ c.dat[0] = gsl_vector_get(z, i*2);
961
+ c.dat[1] = gsl_vector_get(z, i*2+1);
962
+ gsl_vector_complex_set(r, i, c);
963
+ }
964
+ gsl_vector_free(a);
965
+ gsl_vector_free(z);
966
+ if (flag == 1) gsl_poly_complex_workspace_free(w);
967
+ return Data_Wrap_Struct(cgsl_vector_complex, 0, gsl_vector_complex_free, r);
968
+ }
969
+
970
+ #ifdef BASE_INT
971
+ static VALUE rb_gsl_poly_int_to_f(VALUE obj)
972
+ {
973
+ gsl_vector *v;
974
+ gsl_vector_int *vi;
975
+ size_t i;
976
+ Data_Get_Struct(obj, gsl_vector_int, vi);
977
+ v = gsl_vector_alloc(vi->size);
978
+ for (i = 0; i < v->size; i++)
979
+ gsl_vector_set(v, i, (double) gsl_vector_int_get(vi, i));
980
+ return Data_Wrap_Struct(cgsl_poly, 0, gsl_vector_free, v);
981
+ }
982
+ #endif
983
+
984
+ #ifdef BASE_DOUBLE
985
+ static VALUE rb_gsl_poly_to_i(VALUE obj)
986
+ {
987
+ gsl_vector *v;
988
+ gsl_vector_int *vi;
989
+ size_t i;
990
+ Data_Get_Struct(obj, gsl_vector, v);
991
+ vi = gsl_vector_int_alloc(v->size);
992
+ for (i = 0; i < v->size; i++)
993
+ gsl_vector_int_set(vi, i, (int) gsl_vector_get(v, i));
994
+ return Data_Wrap_Struct(cgsl_poly_int, 0, gsl_vector_int_free, vi);
995
+ }
996
+
997
+ static VALUE FUNCTION(rb_gsl_poly,workspace_new)(VALUE klass, VALUE n)
998
+ {
999
+ gsl_poly_complex_workspace *w = NULL;
1000
+ w = gsl_poly_complex_workspace_alloc(FIX2INT(n));
1001
+ return Data_Wrap_Struct(klass, 0, gsl_poly_complex_workspace_free, w);
1002
+ }
1003
+
1004
+ #ifdef GSL_1_1_LATER
1005
+
1006
+ /* singleton method of the class Poly */
1007
+ static VALUE rb_gsl_poly_dd_init(VALUE obj, VALUE vxa, VALUE vya)
1008
+ {
1009
+ gsl_vector *xa = NULL, *ya = NULL;
1010
+ gsl_poly *dd = NULL;
1011
+ Data_Get_Struct(vxa, gsl_vector, xa);
1012
+ Data_Get_Struct(vya, gsl_vector, ya);
1013
+ dd = gsl_vector_alloc(xa->size);
1014
+ gsl_poly_dd_init(dd->data, xa->data, ya->data, xa->size);
1015
+ return Data_Wrap_Struct(cgsl_poly_dd, 0, gsl_vector_free, dd);
1016
+ }
1017
+
1018
+ static VALUE rb_gsl_poly_dd_eval(VALUE obj, VALUE xxa, VALUE xx)
1019
+ {
1020
+ gsl_vector *v = NULL;
1021
+ gsl_matrix *m = NULL;
1022
+ gsl_vector *dd = NULL, *xa, *vnew = NULL;
1023
+ gsl_matrix *mnew = NULL;
1024
+ VALUE x, ary;
1025
+ size_t size, i, j;
1026
+ Data_Get_Struct(obj, gsl_vector, dd);
1027
+ CHECK_VECTOR(xxa);
1028
+ Data_Get_Struct(xxa, gsl_vector, xa);
1029
+ switch (TYPE(xx)) {
1030
+ case T_FIXNUM:
1031
+ case T_BIGNUM:
1032
+ case T_FLOAT:
1033
+ return rb_float_new(gsl_poly_dd_eval(dd->data, xa->data, dd->size,
1034
+ NUM2DBL(xx)));
1035
+ break;
1036
+ case T_ARRAY:
1037
+ size = RARRAY_LEN(xx);
1038
+ ary = rb_ary_new2(size);
1039
+ for (i = 0; i < size; i++) {
1040
+ x = rb_ary_entry(xx, i);
1041
+ Need_Float(x);
1042
+ rb_ary_store(ary, i,
1043
+ rb_float_new(gsl_poly_dd_eval(dd->data, xa->data,
1044
+ dd->size, NUM2DBL(x))));
1045
+ }
1046
+ return ary;
1047
+ break;
1048
+ default:
1049
+ if (VEC_P(xx)) {
1050
+ Data_Get_Struct(xx, GSL_TYPE(gsl_vector), v);
1051
+ size = v->size;
1052
+ vnew = gsl_vector_alloc(v->size);
1053
+ for (i = 0; i < size; i++) {
1054
+ gsl_vector_set(vnew, i,
1055
+ gsl_poly_dd_eval(dd->data, xa->data,
1056
+ dd->size, FUNCTION(gsl_vector,get)(v, i)));
1057
+ }
1058
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, vnew);
1059
+ } else if (MAT_P(xx)) {
1060
+ Data_Get_Struct(xx, GSL_TYPE(gsl_matrix), m);
1061
+ size = m->size1;
1062
+ mnew = gsl_matrix_alloc(m->size1, m->size2);
1063
+ for (i = 0; i < m->size1; i++) {
1064
+ for (j = 0; j < m->size2; j++) {
1065
+ gsl_matrix_set(mnew, i, j,
1066
+ gsl_poly_dd_eval(dd->data, xa->data,
1067
+ dd->size, gsl_matrix_get(m, i, j)));
1068
+ }
1069
+ }
1070
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mnew);
1071
+ } else {
1072
+ rb_raise(rb_eTypeError, "wrong argument type");
1073
+ }
1074
+ break;
1075
+ }
1076
+ return Qnil; /* never reach here */
1077
+ }
1078
+
1079
+ static VALUE rb_gsl_poly_dd_taylor(int argc, VALUE *argv, VALUE obj)
1080
+ {
1081
+ gsl_vector *dd = NULL;
1082
+ gsl_vector *xa, *c = NULL, *w = NULL;
1083
+ double xp;
1084
+ size_t size;
1085
+ int flag = 0;
1086
+ Data_Get_Struct(obj, gsl_vector, dd);
1087
+ switch (argc) {
1088
+ case 2:
1089
+ size = dd->size;
1090
+ xp = NUM2DBL(argv[0]);
1091
+ CHECK_VECTOR(argv[1]);
1092
+ Data_Get_Struct(argv[1], gsl_vector, xa);
1093
+ w = gsl_vector_alloc(size);
1094
+ flag = 1;
1095
+ break;
1096
+ case 3:
1097
+ xp = NUM2DBL(argv[0]);
1098
+ CHECK_VECTOR(argv[1]);
1099
+ Data_Get_Struct(argv[1], gsl_vector, xa);
1100
+ if (TYPE(argv[2]) == T_FIXNUM) {
1101
+ size = FIX2INT(argv[2]);
1102
+ w = gsl_vector_alloc(size);
1103
+ flag = 1;
1104
+ } else {
1105
+ CHECK_VEC(argv[2]);
1106
+ Data_Get_Struct(argv[2], GSL_TYPE(gsl_vector), w);
1107
+ size = dd->size;
1108
+ }
1109
+ break;
1110
+ case 4:
1111
+ Need_Float(argv[0]);
1112
+ CHECK_VECTOR(argv[1]);
1113
+ CHECK_FIXNUM(argv[2]);
1114
+ CHECK_VECTOR(argv[3]);
1115
+ xp = NUM2DBL(argv[0]);
1116
+ Data_Get_Struct(argv[1], gsl_vector, xa);
1117
+ size = FIX2INT(argv[2]);
1118
+ Data_Get_Struct(argv[3], GSL_TYPE(gsl_vector), w);
1119
+ break;
1120
+ default:
1121
+ rb_raise(rb_eArgError, "wrong number of arguments");
1122
+ }
1123
+ c = gsl_vector_alloc(size);
1124
+ gsl_poly_dd_taylor(c->data, xp, dd->data, xa->data, size, w->data);
1125
+ if (flag == 1) gsl_vector_free(w);
1126
+ return Data_Wrap_Struct(cgsl_poly_taylor, 0, gsl_vector_free, c);
1127
+ }
1128
+
1129
+ #endif
1130
+ #endif
1131
+
1132
+ static VALUE FUNCTION(rb_gsl_poly,order)(VALUE obj)
1133
+ {
1134
+ GSL_TYPE(gsl_vector) *v = NULL;
1135
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1136
+ return INT2FIX(v->size - 1);
1137
+ }
1138
+
1139
+ int FUNCTION(gsl_poly,conv)(const BASE *a, size_t na, const BASE *b, size_t nb,
1140
+ BASE *c, size_t *nc)
1141
+ {
1142
+ BASE x;
1143
+ size_t i, j;
1144
+ *nc = na + nb - 1;
1145
+ for (i = 0; i < *nc; i++) c[i] = 0;
1146
+ for (i = 0; i < *nc; i++) {
1147
+ if (i >= na) break;
1148
+ x = a[i];
1149
+ for (j = 0; j < *nc; j++) {
1150
+ if (j >= nb) break;
1151
+ else c[i+j] += x*b[j];
1152
+ }
1153
+ }
1154
+ return 0;
1155
+ }
1156
+
1157
+ GSL_TYPE(gsl_vector)* FUNCTION(gsl_poly,conv_vector)(const GSL_TYPE(gsl_vector) *v1, const GSL_TYPE(gsl_vector) *v2)
1158
+ {
1159
+ GSL_TYPE(gsl_vector) *vnew = NULL;
1160
+ size_t n, tmp;
1161
+ if (v1->size == 1) {
1162
+ vnew = FUNCTION(make_vector,clone)(v2);
1163
+ FUNCTION(gsl_vector,scale)(vnew, FUNCTION(gsl_vector,get)(v1, 0));
1164
+ return vnew;
1165
+ } else if (v2->size == 1) {
1166
+ vnew = FUNCTION(make_vector,clone)(v1);
1167
+ FUNCTION(gsl_vector,scale)(vnew, FUNCTION(gsl_vector,get)(v2, 0));
1168
+ return vnew;
1169
+ } else {
1170
+ n = v1->size + v2->size - 1;
1171
+ vnew = FUNCTION(gsl_vector,calloc)(n);
1172
+ FUNCTION(gsl_poly,conv)(v1->data, v1->size, v2->data, v2->size, vnew->data, &tmp);
1173
+ return vnew;
1174
+ }
1175
+ }
1176
+
1177
+ GSL_TYPE(gsl_vector)* FUNCTION(gsl_poly,reduce)(const GSL_TYPE(gsl_vector) *v)
1178
+ {
1179
+ size_t i, nn = v->size;
1180
+ GSL_TYPE(gsl_vector) *vnew = NULL;
1181
+ for (i = v->size-1; 0 <= (int) i; i--) {
1182
+ if (!gsl_fcmp(FUNCTION(gsl_vector,get)(v, i), 0.0, 1e-10)) {
1183
+ nn = i;
1184
+ break;
1185
+ }
1186
+ }
1187
+ if (nn == 0) nn = v->size;
1188
+ vnew = FUNCTION(gsl_vector,alloc)(nn);
1189
+ for (i = 0; i < nn; i++) {
1190
+ FUNCTION(gsl_vector,set)(vnew, i, FUNCTION(gsl_vector,get)(v, i));
1191
+ }
1192
+ return vnew;
1193
+ }
1194
+
1195
+ GSL_TYPE(gsl_vector)* FUNCTION(gsl_poly,deriv)(const GSL_TYPE(gsl_vector) *v)
1196
+ {
1197
+ GSL_TYPE(gsl_vector) *vnew = NULL;
1198
+ size_t i;
1199
+ vnew = FUNCTION(gsl_vector,alloc)(v->size - 1);
1200
+ for (i = 0; i < v->size - 1; i++) {
1201
+ FUNCTION(gsl_vector,set)(vnew, i, FUNCTION(gsl_vector,get)(v, i+1)*(i+1));
1202
+ }
1203
+ return vnew;
1204
+ }
1205
+
1206
+ GSL_TYPE(gsl_vector)* FUNCTION(gsl_poly,integ)(const GSL_TYPE(gsl_vector) *v)
1207
+ {
1208
+ GSL_TYPE(gsl_vector) *vnew = NULL;
1209
+ size_t i;
1210
+ vnew = FUNCTION(gsl_vector,alloc)(v->size + 1);
1211
+ FUNCTION(gsl_vector,set)(vnew, 0, 0.0);
1212
+ for (i = 1; i < v->size + 1; i++) {
1213
+ FUNCTION(gsl_vector,set)(vnew, i, FUNCTION(gsl_vector,get)(v, i-1)/i);
1214
+ }
1215
+ return vnew;
1216
+ }
1217
+
1218
+ GSL_TYPE(gsl_vector)* FUNCTION(gsl_poly,deconv_vector)(const GSL_TYPE(gsl_vector) *c, const GSL_TYPE(gsl_vector) *a,
1219
+ GSL_TYPE(gsl_vector) **r)
1220
+ {
1221
+ GSL_TYPE(gsl_vector) *vnew = NULL, *a2 = NULL, *c2 = NULL, *vtmp = NULL;
1222
+ GSL_TYPE(gsl_vector) *rtmp = NULL;
1223
+ BASE x, y, z, aa;
1224
+ size_t n, i, j, k, jj;
1225
+ c2 = FUNCTION(gsl_poly,reduce)(c);
1226
+ a2 = FUNCTION(gsl_poly,reduce)(a);
1227
+ n = c2->size - a2->size + 1;
1228
+ vnew = FUNCTION(gsl_vector,calloc)(n);
1229
+ rtmp = FUNCTION(gsl_vector,alloc)(c2->size - 1);
1230
+ aa = FUNCTION(gsl_vector,get)(a2, a2->size - 1);
1231
+ FUNCTION(gsl_vector,set)(vnew, n-1, FUNCTION(gsl_vector,get)(c2, c2->size-1)/aa);
1232
+ for (i = n - 2, k = 1; k < n; i--, k++) {
1233
+ x = FUNCTION(gsl_vector,get)(c2, c2->size-1-k);
1234
+ for (j = n-1; j >= 0; j--) {
1235
+ z = FUNCTION(gsl_vector,get)(vnew, j);
1236
+ jj = c2->size-1-k-j;
1237
+ if (jj > k || jj < 0) continue;
1238
+ y = FUNCTION(gsl_vector,get)(a2, jj);
1239
+ x -= y*z;
1240
+ }
1241
+ FUNCTION(gsl_vector,set)(vnew, i, x/aa);
1242
+ }
1243
+ vtmp = FUNCTION(gsl_poly,conv_vector)(vnew, a2);
1244
+ for (i = 0; i < rtmp->size; i++) {
1245
+ x = FUNCTION(gsl_vector,get)(c2, i);
1246
+ y = FUNCTION(gsl_vector,get)(vtmp, i);
1247
+ FUNCTION(gsl_vector,set)(rtmp, i, x - y);
1248
+ }
1249
+ *r = FUNCTION(gsl_poly,reduce)(rtmp);
1250
+ FUNCTION(gsl_vector,free)(rtmp);
1251
+ FUNCTION(gsl_vector,free)(vtmp);
1252
+ FUNCTION(gsl_vector,free)(c2);
1253
+ FUNCTION(gsl_vector,free)(a2);
1254
+ return vnew;
1255
+ }
1256
+
1257
+ GSL_TYPE(gsl_poly)* FUNCTION(get_poly,get)(VALUE obj, int *flag)
1258
+ {
1259
+ GSL_TYPE(gsl_poly) *p = NULL;
1260
+ size_t i;
1261
+ switch (TYPE(obj)) {
1262
+ case T_ARRAY:
1263
+ p = FUNCTION(gsl_vector,alloc)(RARRAY_LEN(obj));
1264
+ for (i = 0; i < p->size; i++) FUNCTION(gsl_vector,set)(p, i, (BASE) NUM2DBL(rb_ary_entry(obj, i)));
1265
+ *flag = 1;
1266
+ break;
1267
+ case T_FLOAT:
1268
+ case T_FIXNUM:
1269
+ p = FUNCTION(gsl_vector,alloc)(1);
1270
+ FUNCTION(gsl_vector,set)(p, 0, (BASE) NUM2DBL(obj));
1271
+ *flag = 1;
1272
+ break;
1273
+ default:
1274
+ CHECK_VEC(obj);
1275
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), p);
1276
+ *flag = 0;
1277
+ break;
1278
+ }
1279
+ return p;
1280
+ }
1281
+
1282
+ static VALUE FUNCTION(rb_gsl_poly,conv)(VALUE obj, VALUE bb)
1283
+ {
1284
+ GSL_TYPE(gsl_vector) *v = NULL, *v2 = NULL, *vnew = NULL;
1285
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1286
+ switch (TYPE(bb)) {
1287
+ case T_FIXNUM:
1288
+ case T_FLOAT:
1289
+ vnew = FUNCTION(gsl_vector,alloc)(v->size);
1290
+ FUNCTION(gsl_vector,memcpy)(vnew, v);
1291
+ FUNCTION(gsl_vector,scale)(vnew, (BASE) NUM2DBL(bb));
1292
+ break;
1293
+ default:
1294
+ CHECK_VEC(bb);
1295
+ Data_Get_Struct(bb, GSL_TYPE(gsl_vector), v2);
1296
+ vnew = FUNCTION(gsl_poly,conv_vector)(v, v2);
1297
+ break;
1298
+ }
1299
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1300
+ }
1301
+
1302
+ VALUE FUNCTION(rb_gsl_poly,deconv)(VALUE obj, VALUE bb)
1303
+ {
1304
+ GSL_TYPE(gsl_poly) *v = NULL, *v2 = NULL, *vnew = NULL, *r = NULL;
1305
+ int flag = 0;
1306
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1307
+ switch (TYPE(bb)) {
1308
+ case T_ARRAY:
1309
+ v2 = FUNCTION(get_poly,get)(bb, &flag);
1310
+ break;
1311
+ case T_FLOAT:
1312
+ case T_FIXNUM:
1313
+ v2 = FUNCTION(gsl_vector,alloc)(1);
1314
+ FUNCTION(gsl_vector,set)(v2, 0, (BASE) NUM2DBL(bb));
1315
+ break;
1316
+ default:
1317
+ CHECK_VEC(bb);
1318
+ Data_Get_Struct(bb, GSL_TYPE(gsl_vector), v2);
1319
+ break;
1320
+ }
1321
+ vnew = FUNCTION(gsl_poly,deconv_vector)(v, v2, &r);
1322
+ if (flag == 1) FUNCTION(gsl_vector,free)(v2);
1323
+ if (FUNCTION(gsl_vector,isnull)(r))
1324
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1325
+ else
1326
+ return rb_ary_new3(2, Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew),
1327
+ Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), r));
1328
+ }
1329
+
1330
+ static VALUE FUNCTION(rb_gsl_poly,reduce)(VALUE obj)
1331
+ {
1332
+ GSL_TYPE(gsl_vector) *v = NULL, *vnew = NULL;
1333
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1334
+ vnew = FUNCTION(gsl_poly,reduce)(v);
1335
+ if (vnew == NULL) {
1336
+ return Qnil;
1337
+ } else if (vnew->size == 0) {
1338
+ return Qnil;
1339
+ } else if (FUNCTION(gsl_vector,isnull)(vnew)) {
1340
+ return INT2FIX(0);
1341
+ } else if (vnew->size == 1) {
1342
+ return rb_float_new(FUNCTION(gsl_vector,get)(vnew, 0));
1343
+ } else {
1344
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1345
+ }
1346
+ return Qnil; /* never reach here */
1347
+ }
1348
+
1349
+ static VALUE FUNCTION(rb_gsl_poly,deriv)(VALUE obj)
1350
+ {
1351
+ GSL_TYPE(gsl_vector) *v = NULL, *vnew = NULL;
1352
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1353
+ vnew = FUNCTION(gsl_poly,deriv)(v);
1354
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1355
+ }
1356
+
1357
+ static VALUE FUNCTION(rb_gsl_poly,integ)(VALUE obj)
1358
+ {
1359
+ GSL_TYPE(gsl_vector) *v = NULL, *vnew = NULL;
1360
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1361
+ vnew = FUNCTION(gsl_poly,integ)(v);
1362
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1363
+ }
1364
+
1365
+ static VALUE FUNCTION(rb_gsl_poly,conv2)(VALUE klass, VALUE v1, VALUE v2)
1366
+ {
1367
+ GSL_TYPE(gsl_poly) *p1 = NULL, *p2 = NULL, *p3 = NULL;
1368
+ int flag1 = 0, flag2 = 0;
1369
+ size_t i;
1370
+ VALUE ary;
1371
+ p1 = FUNCTION(get_poly,get)(v1, &flag1);
1372
+ p2 = FUNCTION(get_poly,get)(v2, &flag2);
1373
+ p3 = FUNCTION(gsl_poly,conv_vector)(p1, p2);
1374
+ if (flag1 == 1) FUNCTION(gsl_vector,free)(p1);
1375
+ if (flag2 == 1) FUNCTION(gsl_vector,free)(p2);
1376
+ if (flag1 == 1 && flag2 == 1) {
1377
+ ary = rb_ary_new2(p3->size);
1378
+ for (i = 0; i < p3->size; i++)
1379
+ rb_ary_store(ary, i, C_TO_VALUE2(FUNCTION(gsl_vector,get)(p3, i)));
1380
+ FUNCTION(gsl_vector,free)(p3);
1381
+ return ary;
1382
+ } else {
1383
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), p3);
1384
+ }
1385
+ }
1386
+
1387
+ static VALUE FUNCTION(rb_gsl_poly,deconv2)(VALUE klass, VALUE v1, VALUE v2)
1388
+ {
1389
+ GSL_TYPE(gsl_poly) *p1 = NULL, *p2 = NULL;
1390
+ GSL_TYPE(gsl_poly) *r = NULL, *vnew = NULL;
1391
+ int flag1 = 0, flag2 = 0;
1392
+ p1 = FUNCTION(get_poly,get)(v1, &flag1);
1393
+ p2 = FUNCTION(get_poly,get)(v2, &flag2);
1394
+ vnew = FUNCTION(gsl_poly,deconv_vector)(p1, p2, &r);
1395
+ if (flag1 == 1) FUNCTION(gsl_vector,free)(p1);
1396
+ if (flag2 == 1) FUNCTION(gsl_vector,free)(p2);
1397
+ if (FUNCTION(gsl_vector,isnull)(r))
1398
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1399
+ else
1400
+ return rb_ary_new3(2, Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew),
1401
+ Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), r));
1402
+ }
1403
+
1404
+ GSL_TYPE(gsl_poly)* FUNCTION(gsl_poly,add)(const GSL_TYPE(gsl_poly) *a,
1405
+ const GSL_TYPE(gsl_poly) *b)
1406
+ {
1407
+ GSL_TYPE(gsl_poly) *c = NULL;
1408
+ const GSL_TYPE(gsl_poly) *longer;
1409
+ size_t i, n;
1410
+ if (a->size > b->size) {
1411
+ c = FUNCTION(gsl_vector,alloc)(a->size);
1412
+ longer = a;
1413
+ } else {
1414
+ c = FUNCTION(gsl_vector,alloc)(b->size);
1415
+ longer = b;
1416
+ }
1417
+ n = GSL_MIN(a->size, b->size);
1418
+ for (i = 0; i < n; i++) {
1419
+ FUNCTION(gsl_vector,set)(c, i, FUNCTION(gsl_vector,get)(a, i) + FUNCTION(gsl_vector,get)(b, i));
1420
+ }
1421
+ for (i = n; i < c->size; i++)
1422
+ FUNCTION(gsl_vector,set)(c, i, FUNCTION(gsl_vector,get)(longer, i));
1423
+ return c;
1424
+ }
1425
+
1426
+ static VALUE FUNCTION(rb_gsl_poly,add)(VALUE obj, VALUE bb)
1427
+ {
1428
+ GSL_TYPE(gsl_vector) *v = NULL, *vnew = NULL, *vb = NULL;
1429
+ BASE b;
1430
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1431
+ switch (TYPE(bb)) {
1432
+ case T_FLOAT:
1433
+ case T_FIXNUM:
1434
+ b = (BASE) NUM2DBL(bb);
1435
+ vnew = FUNCTION(gsl_vector,alloc)(v->size);
1436
+ FUNCTION(gsl_vector,memcpy)(vnew, v);
1437
+ FUNCTION(gsl_vector,set)(vnew, 0, FUNCTION(gsl_vector,get)(v, 0) + b);
1438
+ break;
1439
+ default:
1440
+ CHECK_VEC(bb);
1441
+ Data_Get_Struct(bb, GSL_TYPE(gsl_vector), vb);
1442
+ vnew = FUNCTION(gsl_poly,add)(v, vb);
1443
+ }
1444
+ return Data_Wrap_Struct(CLASS_OF(obj), 0, FUNCTION(gsl_vector,free), vnew);
1445
+ }
1446
+
1447
+ static VALUE rb_gsl_poly_uminus(VALUE obj);
1448
+ static VALUE rb_gsl_poly_int_uminus(VALUE obj);
1449
+ static VALUE FUNCTION(rb_gsl_poly,sub)(VALUE obj, VALUE bb)
1450
+ {
1451
+ switch (TYPE(bb)) {
1452
+ case T_FLOAT:
1453
+ case T_FIXNUM:
1454
+ return FUNCTION(rb_gsl_poly,add)(obj, C_TO_VALUE2(-(BASE)NUM2DBL(bb)));
1455
+ break;
1456
+ default:
1457
+ CHECK_VEC(bb);
1458
+ return FUNCTION(rb_gsl_poly,add)(obj, FUNCTION(rb_gsl_poly,uminus)(bb));
1459
+ break;
1460
+ }
1461
+ }
1462
+
1463
+ static VALUE FUNCTION(rb_gsl_poly,uminus)(VALUE obj)
1464
+ {
1465
+ GSL_TYPE(gsl_poly) *p = NULL, *pnew = NULL;
1466
+ size_t i;
1467
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), p);
1468
+ pnew = FUNCTION(gsl_vector,alloc)(p->size);
1469
+ for (i = 0; i < pnew->size; i++) FUNCTION(gsl_vector,set)(pnew, i, -FUNCTION(gsl_vector,get)(p, i));
1470
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), pnew);
1471
+ }
1472
+
1473
+ static VALUE FUNCTION(rb_gsl_poly,uplus)(VALUE obj)
1474
+ {
1475
+ return obj;
1476
+ }
1477
+
1478
+ static VALUE FUNCTION(rb_gsl_poly,coerce)(VALUE obj, VALUE other)
1479
+ {
1480
+ GSL_TYPE(gsl_vector) *vb;
1481
+ switch (TYPE(other)) {
1482
+ case T_FLOAT:
1483
+ case T_FIXNUM:
1484
+ vb = FUNCTION(gsl_vector,calloc)(1);
1485
+ FUNCTION(gsl_vector,set)(vb, 0, (BASE) NUM2DBL(other));
1486
+ return rb_ary_new3(2, Data_Wrap_Struct(CLASS_OF(obj), 0, FUNCTION(gsl_vector,free), vb),
1487
+ obj);
1488
+ break;
1489
+ default:
1490
+ CHECK_VEC(other);
1491
+ return rb_ary_new3(3, other, obj);
1492
+ break;
1493
+ }
1494
+ }
1495
+
1496
+ static VALUE FUNCTION(rb_gsl_poly,to_gv)(VALUE obj)
1497
+ {
1498
+ GSL_TYPE(gsl_vector) *v, *vnew = NULL;
1499
+ Data_Get_Struct(obj, GSL_TYPE(gsl_vector), v);
1500
+ vnew = FUNCTION(make_vector,clone)(v);
1501
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_poly), 0, FUNCTION(gsl_vector,free), vnew);
1502
+ }
1503
+
1504
+ static VALUE FUNCTION(rb_gsl_poly,companion_matrix)(VALUE obj)
1505
+ {
1506
+ GSL_TYPE(gsl_poly) *p = NULL;
1507
+ BASE z;
1508
+ gsl_matrix *m;
1509
+ size_t i, j, size;
1510
+ Data_Get_Struct(obj, GSL_TYPE(gsl_poly), p);
1511
+ size = p->size - 1;
1512
+ m = gsl_matrix_calloc(size, size);
1513
+ z = FUNCTION(gsl_vector,get)(p, size);
1514
+ for (j = 0; j < size; j++)
1515
+ gsl_matrix_set(m, 0, size-j-1, -FUNCTION(gsl_vector,get)(p, j)/z);
1516
+ for (i = 1; i < size; i++) {
1517
+ gsl_matrix_set(m, i, i-1, 1.0);
1518
+ }
1519
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, m);
1520
+ }
1521
+
1522
+ static VALUE FUNCTION(rb_gsl_poly,info)(VALUE obj)
1523
+ {
1524
+ GSL_TYPE(gsl_poly) *v;
1525
+ char buf[256];
1526
+ Data_Get_Struct(obj, GSL_TYPE(gsl_poly), v);
1527
+ sprintf(buf, "Class: %s\n", rb_class2name(CLASS_OF(obj)));
1528
+ #ifdef RUBY_1_9_LATER
1529
+ sprintf(buf, "%sSuperClass: %s\n", buf, rb_class2name(RCLASS_SUPER(CLASS_OF(obj))));
1530
+ #else
1531
+ sprintf(buf, "%sSuperClass: %s\n", buf, rb_class2name(RCLASS(CLASS_OF(obj))->super));
1532
+ #endif
1533
+ sprintf(buf, "%sOrder: %d\n", buf, (int) v->size-1);
1534
+ return rb_str_new2(buf);
1535
+ }
1536
+
1537
+ #ifdef BASE_DOUBLE
1538
+ #include "rb_gsl_fit.h"
1539
+ /* singleton */
1540
+ static VALUE rb_gsl_poly_fit(int argc, VALUE *argv, VALUE obj)
1541
+ {
1542
+ gsl_multifit_linear_workspace *space = NULL;
1543
+ gsl_matrix *X = NULL, *cov = NULL;
1544
+ gsl_vector *x, *y = NULL, *c = NULL;
1545
+ gsl_vector_view xx, yy;
1546
+ size_t order, i, j;
1547
+ double chisq, val;
1548
+ int status, flag = 0;
1549
+ VALUE vc, vcov;
1550
+ if (argc != 3 && argc != 4)
1551
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 3 or 4)", argc);
1552
+ x = &xx.vector;
1553
+ y = &yy.vector;
1554
+ Data_Get_Vector(argv[0], x);
1555
+ Data_Get_Vector(argv[1], y);
1556
+ order = NUM2INT(argv[2]);
1557
+ if (argc == 4) {
1558
+ Data_Get_Struct(argv[3], gsl_multifit_linear_workspace, space);
1559
+ } else {
1560
+ space = gsl_multifit_linear_alloc(x->size, order + 1);
1561
+ flag = 1;
1562
+ }
1563
+ cov = gsl_matrix_alloc(order + 1, order + 1);
1564
+ c = gsl_vector_alloc(order + 1);
1565
+ X = gsl_matrix_alloc(x->size, order + 1);
1566
+ for (i = 0; i < x->size; i++) {
1567
+ val = 1.0;
1568
+ gsl_matrix_set(X, i, 0, val);
1569
+ for (j = 1; j <= order; j++) {
1570
+ val *= gsl_vector_get(x, i);
1571
+ gsl_matrix_set(X, i, j, val);
1572
+ }
1573
+ }
1574
+ status = gsl_multifit_linear(X, y, c, cov, &chisq, space);
1575
+ if (flag == 1) gsl_multifit_linear_free(space);
1576
+ vc = Data_Wrap_Struct(cgsl_poly, 0, gsl_vector_free, c);
1577
+ vcov = Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, cov);
1578
+ gsl_matrix_free(X);
1579
+ return rb_ary_new3(4, vc, vcov, rb_float_new(chisq), INT2FIX(status));
1580
+ }
1581
+
1582
+ static VALUE rb_gsl_poly_wfit(int argc, VALUE *argv, VALUE obj)
1583
+ {
1584
+ gsl_multifit_linear_workspace *space = NULL;
1585
+ gsl_matrix *X = NULL, *cov = NULL;
1586
+ gsl_vector *x, *y = NULL, *w, *c = NULL;
1587
+ gsl_vector_view xx, yy, ww;
1588
+ size_t order, i, j;
1589
+ double chisq, val;
1590
+ int status, flag = 0;
1591
+ VALUE vc, vcov;
1592
+ if (argc != 4 && argc != 5)
1593
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 4 or 5)", argc);
1594
+ x = &xx.vector;
1595
+ w = &ww.vector;
1596
+ y = &yy.vector;
1597
+ Data_Get_Vector(argv[0], x);
1598
+ Data_Get_Vector(argv[1], w);
1599
+ Data_Get_Vector(argv[2], y);
1600
+ order = NUM2INT(argv[3]);
1601
+ if (argc == 5) {
1602
+ Data_Get_Struct(argv[4], gsl_multifit_linear_workspace, space);
1603
+ } else {
1604
+ space = gsl_multifit_linear_alloc(x->size, order + 1);
1605
+ flag = 1;
1606
+ }
1607
+ cov = gsl_matrix_alloc(order + 1, order + 1);
1608
+ c = gsl_vector_alloc(order + 1);
1609
+ X = gsl_matrix_alloc(x->size, order + 1);
1610
+ for (i = 0; i < x->size; i++) {
1611
+ val = 1.0;
1612
+ gsl_matrix_set(X, i, 0, val);
1613
+ for (j = 1; j <= order; j++) {
1614
+ val *= gsl_vector_get(x, i);
1615
+ gsl_matrix_set(X, i, j, val);
1616
+ }
1617
+ }
1618
+ status = gsl_multifit_linear(X, y, c, cov, &chisq, space);
1619
+ if (flag == 1) gsl_multifit_linear_free(space);
1620
+ vc = Data_Wrap_Struct(cgsl_poly, 0, gsl_vector_free, c);
1621
+ vcov = Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, cov);
1622
+ gsl_matrix_free(X);
1623
+ return rb_ary_new3(4, vc, vcov, rb_float_new(chisq), INT2FIX(status));
1624
+ }
1625
+ #endif
1626
+
1627
+ #ifdef BASE_DOUBLE
1628
+ #ifdef GSL_1_13_LATER
1629
+ static VALUE rb_gsl_poly_eval_derivs_singleton(int argc, VALUE *argv, VALUE klass)
1630
+ {
1631
+ VALUE ary;
1632
+ gsl_vector *v = NULL, *v2 = NULL;
1633
+ size_t i, lenc, lenres;
1634
+ #ifdef HAVE_NARRAY_H
1635
+ struct NARRAY *na;
1636
+ double *ptr1, *ptr2;
1637
+ int shape[1];
1638
+ #endif
1639
+
1640
+ if (argc < 2) rb_raise(rb_eArgError, "Wrong number of arguments (%d for >= 2)", argc);
1641
+ if (rb_obj_is_kind_of(argv[0], rb_cArray)) {
1642
+ v = gsl_vector_alloc(RARRAY_LEN(argv[0]));
1643
+ lenc = v->size;
1644
+ for (i = 0; i < lenc; i++) {
1645
+ gsl_vector_set(v, i, NUM2DBL(rb_ary_entry(argv[0], i)));
1646
+ }
1647
+ if (argc == 2) lenres = lenc + 1;
1648
+ else lenres = FIX2INT(argv[2]);
1649
+ v2 = gsl_vector_alloc(lenres);
1650
+ gsl_poly_eval_derivs(v->data, lenc, NUM2DBL(argv[1]), v2->data, lenres);
1651
+ ary = rb_ary_new2(lenres);
1652
+ for (i = 0; i < lenres; i++) {
1653
+ rb_ary_store(ary, i, rb_float_new(gsl_vector_get(v2, i)));
1654
+ }
1655
+ gsl_vector_free(v2);
1656
+ gsl_vector_free(v);
1657
+ return ary;
1658
+ }
1659
+ if (rb_obj_is_kind_of(argv[0], cgsl_vector)) {
1660
+ Data_Get_Struct(argv[0], gsl_vector, v);
1661
+ lenc = v->size;
1662
+ if (argc == 2) lenres = lenc + 1;
1663
+ else lenres = FIX2INT(argv[2]);
1664
+ v2 = gsl_vector_alloc(lenres);
1665
+ gsl_poly_eval_derivs(v->data, lenc, NUM2DBL(argv[1]), v2->data, lenres);
1666
+ return Data_Wrap_Struct(cgsl_poly, 0, gsl_vector_free, v2);
1667
+ }
1668
+ #ifdef HAVE_NARRAY_H
1669
+ if (NA_IsNArray(argv[0])) {
1670
+ GetNArray(argv[0], na);
1671
+ ptr1 = (double*) na->ptr;
1672
+ lenc = na->total;
1673
+ if (argc == 2) lenres = lenc + 1;
1674
+ else lenres = FIX2INT(argv[2]);
1675
+ shape[0] = lenres;
1676
+ ary = na_make_object(NA_DFLOAT, na->rank, shape, CLASS_OF(argv[0]));
1677
+ ptr2 = NA_PTR_TYPE(ary,double*);
1678
+ gsl_poly_eval_derivs(ptr1, lenc, NUM2DBL(argv[1]), ptr2, lenres);
1679
+ return ary;
1680
+ }
1681
+ #endif
1682
+ return Qnil; // Never comes here
1683
+ }
1684
+ static VALUE rb_gsl_poly_eval_derivs(int argc, VALUE *argv, VALUE obj)
1685
+ {
1686
+ gsl_vector *v, *v2;
1687
+ size_t lenc, lenres;
1688
+ Data_Get_Struct(obj, gsl_vector, v);
1689
+ lenc = v->size;
1690
+ switch (argc) {
1691
+ case 1:
1692
+ lenres = lenc + 1;
1693
+ break;
1694
+ case 2:
1695
+ lenres = FIX2INT(argv[1]);
1696
+ break;
1697
+ default:
1698
+ rb_raise(rb_eArgError, "Wrong number of arguments (%d for > 1)", argc);
1699
+ }
1700
+ v2 = gsl_vector_alloc(lenres);
1701
+ gsl_poly_eval_derivs(v->data, lenc, NUM2DBL(argv[0]), v2->data, lenres);
1702
+ return Data_Wrap_Struct(cgsl_poly, 0, gsl_vector_free, v2);
1703
+ }
1704
+ #endif
1705
+ #endif
1706
+
1707
+ void FUNCTION(Init_gsl_poly,init)(VALUE module)
1708
+ {
1709
+ #ifdef BASE_DOUBLE
1710
+ VALUE mgsl_poly_complex;
1711
+ cgsl_poly = rb_define_class_under(module, "Poly", cgsl_vector);
1712
+ cgsl_poly_int = rb_define_class_under(cgsl_poly, "Int", cgsl_vector_int);
1713
+
1714
+ cgsl_poly_workspace = rb_define_class_under(cgsl_poly, "Workspace", cGSL_Object);
1715
+ mgsl_poly_complex = rb_define_module_under(cgsl_poly, "Complex");
1716
+ cgsl_poly_complex_workspace = rb_define_class_under(mgsl_poly_complex,
1717
+ "Workspace", cGSL_Object);
1718
+ rb_define_singleton_method(cgsl_poly_workspace, "alloc",
1719
+ rb_gsl_poly_workspace_new, 1);
1720
+ rb_define_singleton_method(cgsl_poly_complex_workspace, "alloc",
1721
+ rb_gsl_poly_workspace_new, 1);
1722
+
1723
+ rb_define_singleton_method(mgsl_poly_complex, "solve_quadratic",
1724
+ FUNCTION(rb_gsl_poly,complex_solve_quadratic), -1);
1725
+ rb_define_singleton_method(mgsl_poly_complex, "solve_cubic",
1726
+ FUNCTION(rb_gsl_poly,complex_solve_cubic), -1);
1727
+ #ifdef HAVE_POLY_SOLVE_QUARTIC
1728
+ rb_define_singleton_method(mgsl_poly_complex, "solve_quartic",
1729
+ FUNCTION(rb_gsl_poly,complex_solve_quartic), -1);
1730
+ #endif
1731
+
1732
+ rb_define_singleton_method(mgsl_poly_complex, "solve",
1733
+ FUNCTION(rb_gsl_poly,complex_solve), -1);
1734
+ rb_define_singleton_method(mgsl_poly_complex, "roots",
1735
+ FUNCTION(rb_gsl_poly,complex_solve), -1);
1736
+ #endif
1737
+
1738
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "solve_quadratic",
1739
+ FUNCTION(rb_gsl_poly,solve_quadratic), -1);
1740
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "solve_cubic",
1741
+ FUNCTION(rb_gsl_poly,solve_cubic), -1);
1742
+
1743
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "complex_solve_quadratic",
1744
+ FUNCTION(rb_gsl_poly,complex_solve_quadratic), -1);
1745
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "complex_solve_cubic",
1746
+ FUNCTION(rb_gsl_poly,complex_solve_cubic), -1);
1747
+ #ifdef HAVE_POLY_SOLVE_QUARTIC
1748
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "solve_quartic",
1749
+ FUNCTION(rb_gsl_poly,solve_quartic), -1);
1750
+
1751
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "complex_solve_quartic",
1752
+ FUNCTION(rb_gsl_poly,complex_solve_quartic), -1);
1753
+ #endif
1754
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "complex_solve",
1755
+ FUNCTION(rb_gsl_poly,complex_solve), -1);
1756
+
1757
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "solve",
1758
+ FUNCTION(rb_gsl_poly,complex_solve), -1);
1759
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "roots",
1760
+ FUNCTION(rb_gsl_poly,complex_solve), -1);
1761
+
1762
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "eval",
1763
+ FUNCTION(rb_gsl_poly,eval2), -1);
1764
+
1765
+ rb_define_method(GSL_TYPE(cgsl_poly), "eval",
1766
+ FUNCTION(rb_gsl_poly,eval), 1);
1767
+ rb_define_alias(GSL_TYPE(cgsl_poly), "at", "eval");
1768
+
1769
+ rb_define_method(GSL_TYPE(cgsl_poly), "solve_quadratic",
1770
+ FUNCTION(rb_gsl_poly,solve_quadratic2), 0);
1771
+ rb_define_method(GSL_TYPE(cgsl_poly), "complex_solve_quadratic",
1772
+ FUNCTION(rb_gsl_poly,complex_solve_quadratic2), 0);
1773
+
1774
+ rb_define_method(GSL_TYPE(cgsl_poly), "solve_cubic",
1775
+ FUNCTION(rb_gsl_poly,solve_cubic2), 0);
1776
+ rb_define_method(GSL_TYPE(cgsl_poly), "complex_solve_cubic",
1777
+ FUNCTION(rb_gsl_poly,complex_solve_cubic2), 0);
1778
+
1779
+ #ifdef HAVE_POLY_SOLVE_QUARTIC
1780
+ rb_define_method(GSL_TYPE(cgsl_poly), "solve_quartic",
1781
+ FUNCTION(rb_gsl_poly,solve_quartic2), 0);
1782
+ rb_define_method(GSL_TYPE(cgsl_poly), "complex_solve_quartic",
1783
+ FUNCTION(rb_gsl_poly,complex_solve_quartic2), 0);
1784
+ #endif
1785
+
1786
+ rb_define_method(GSL_TYPE(cgsl_poly), "complex_solve",
1787
+ FUNCTION(rb_gsl_poly,complex_solve2), -1);
1788
+ rb_define_alias(GSL_TYPE(cgsl_poly), "solve", "complex_solve");
1789
+ rb_define_alias(GSL_TYPE(cgsl_poly), "roots", "complex_solve");
1790
+
1791
+ #ifdef BASE_INT
1792
+ rb_define_method(cgsl_poly_int, "to_f", rb_gsl_poly_int_to_f, 0);
1793
+ #endif
1794
+
1795
+ #ifdef BASE_DOUBLE
1796
+ // rb_define_singleton_method(cgsl_poly, "eval", rb_gsl_poly_eval_singleton, 2);
1797
+ rb_define_method(cgsl_poly, "to_i", rb_gsl_poly_to_i, 0);
1798
+ #ifdef GSL_1_11_LATER
1799
+ rb_define_singleton_method(cgsl_poly, "complex_eval", rb_gsl_poly_eval_singleton, 2);
1800
+ rb_define_method(cgsl_vector_complex, "eval", rb_gsl_complex_poly_complex_eval, 1);
1801
+ #endif
1802
+ #ifdef GSL_1_1_LATER
1803
+ cgsl_poly_dd = rb_define_class_under(cgsl_poly, "DividedDifference", cgsl_poly);
1804
+ cgsl_poly_taylor = rb_define_class_under(cgsl_poly, "Taylor", cgsl_poly);
1805
+ rb_define_singleton_method(cgsl_poly, "dd_init", rb_gsl_poly_dd_init, 2);
1806
+
1807
+ rb_define_method(cgsl_poly_dd, "eval",rb_gsl_poly_dd_eval, 2);
1808
+ rb_define_method(cgsl_poly_dd, "taylor", rb_gsl_poly_dd_taylor, -1);
1809
+ #endif
1810
+ #endif
1811
+
1812
+ rb_define_method(GSL_TYPE(cgsl_poly), "order", FUNCTION(rb_gsl_poly,order), 0);
1813
+
1814
+ /*****/
1815
+ rb_define_method(GSL_TYPE(cgsl_poly), "conv", FUNCTION(rb_gsl_poly,conv), 1);
1816
+ rb_define_alias(GSL_TYPE(cgsl_poly), "*", "conv");
1817
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "conv",
1818
+ FUNCTION(rb_gsl_poly,conv2), 2);
1819
+
1820
+ rb_define_method(GSL_TYPE(cgsl_poly), "deconv",
1821
+ FUNCTION(rb_gsl_poly,deconv), 1);
1822
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "deconv",
1823
+ FUNCTION(rb_gsl_poly,deconv2), 2);
1824
+
1825
+ rb_define_method(GSL_TYPE(cgsl_poly), "reduce",
1826
+ FUNCTION(rb_gsl_poly,reduce), 1);
1827
+ rb_define_method(GSL_TYPE(cgsl_poly), "deriv", FUNCTION(rb_gsl_poly,deriv), 1);
1828
+ rb_define_method(GSL_TYPE(cgsl_poly), "integ", FUNCTION(rb_gsl_poly,integ), 1);
1829
+
1830
+ /*****/
1831
+
1832
+ rb_define_method(GSL_TYPE(cgsl_poly), "add", FUNCTION(rb_gsl_poly,add), 1);
1833
+ rb_define_alias(GSL_TYPE(cgsl_poly), "+", "add");
1834
+ rb_define_method(GSL_TYPE(cgsl_poly), "sub", FUNCTION(rb_gsl_poly,sub), 1);
1835
+ rb_define_alias(GSL_TYPE(cgsl_poly), "-", "sub");
1836
+
1837
+ rb_define_method(GSL_TYPE(cgsl_poly), "-@", FUNCTION(rb_gsl_poly,uminus), 0);
1838
+ rb_define_method(GSL_TYPE(cgsl_poly), "+@", FUNCTION(rb_gsl_poly,uplus), 0);
1839
+
1840
+ rb_define_method(GSL_TYPE(cgsl_poly), "coerce",
1841
+ FUNCTION(rb_gsl_poly,coerce), 1);
1842
+ rb_define_method(GSL_TYPE(cgsl_poly), "to_gv", FUNCTION(rb_gsl_poly,to_gv), 0);
1843
+ rb_define_alias(GSL_TYPE(cgsl_poly), "to_v", "to_gv");
1844
+
1845
+ rb_define_method(GSL_TYPE(cgsl_poly), "companion_matrix",
1846
+ FUNCTION(rb_gsl_poly,companion_matrix), 0);
1847
+ rb_define_alias(GSL_TYPE(cgsl_poly), "compan", "companion_matrix");
1848
+
1849
+ /*****/
1850
+ rb_define_method(GSL_TYPE(cgsl_poly), "info",
1851
+ FUNCTION(rb_gsl_poly,info), 0);
1852
+
1853
+ #ifdef BASE_DOUBLE
1854
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "fit",
1855
+ FUNCTION(rb_gsl_poly,fit), -1);
1856
+ rb_define_singleton_method(GSL_TYPE(cgsl_poly), "wfit",
1857
+ FUNCTION(rb_gsl_poly,wfit), -1);
1858
+
1859
+ #ifdef GSL_1_13_LATER
1860
+ rb_define_singleton_method(cgsl_poly, "eval_derivs", rb_gsl_poly_eval_derivs_singleton, -1);
1861
+ rb_define_method(cgsl_vector, "eval_derivs", rb_gsl_poly_eval_derivs, -1);
1862
+ #endif
1863
+
1864
+ #endif
1865
+ }
1866
+
1867
+ #undef NUMCONV
1868
+ #undef NUMCONV2
1869
+ #undef PRINTF_FORMAT
1870
+ #undef VEC_ROW_COL
1871
+ #undef VEC_P
1872
+ #undef C_TO_VALUE
1873
+ #undef C_TO_VALUE2
1874
+ #undef VEC_COL_P
1875
+ #undef VEC_ROW_P
1876
+ #undef CHECK_VEC
1877
+ #undef VEC_VIEW_P
1878
+
1879
+ #undef MAT_ROW_COL
1880
+ #undef MAT_P
1881
+ #undef C_TO_VALUE
1882
+ #undef MAT_COL_P
1883
+ #undef MAT_ROW_P
1884
+ #undef CHECK_MAT
1885
+ #undef MAT_VIEW_P