gsl 1.15.3 → 1.16.0.6

Sign up to get free protection for your applications and to get access to all the features.
Files changed (446) hide show
  1. checksums.yaml +7 -0
  2. data/.gitignore +12 -0
  3. data/.travis.yml +24 -0
  4. data/AUTHORS +10 -2
  5. data/COPYING +341 -339
  6. data/ChangeLog +612 -554
  7. data/Gemfile +4 -0
  8. data/README.md +77 -0
  9. data/Rakefile +14 -93
  10. data/THANKS +1 -1
  11. data/examples/blas/blas.rb +1 -1
  12. data/examples/bspline.rb +3 -3
  13. data/examples/complex/functions.rb +4 -4
  14. data/examples/complex/mul.rb +1 -1
  15. data/examples/const/physconst.rb +4 -4
  16. data/examples/const/travel.rb +4 -4
  17. data/examples/eigen/nonsymmv.rb +1 -1
  18. data/examples/eigen/qhoscillator.rb +3 -3
  19. data/examples/fft/radix2.rb +1 -1
  20. data/examples/fft/real-halfcomplex.rb +3 -3
  21. data/examples/fft/real-halfcomplex2.rb +3 -3
  22. data/examples/fit/expfit.rb +1 -1
  23. data/examples/fit/multifit.rb +1 -1
  24. data/examples/fit/ndlinear.rb +44 -44
  25. data/examples/fit/nonlinearfit.rb +1 -1
  26. data/examples/fit/wlinear.rb +3 -3
  27. data/examples/function/function.rb +1 -1
  28. data/examples/function/min.rb +1 -1
  29. data/examples/function/synchrotron.rb +2 -2
  30. data/examples/gallery/koch.rb +1 -1
  31. data/examples/histogram/cauchy.rb +2 -2
  32. data/examples/histogram/exponential.rb +1 -1
  33. data/examples/histogram/histo3d.rb +1 -1
  34. data/examples/histogram/histogram-pdf.rb +2 -2
  35. data/examples/histogram/xexp.rb +1 -1
  36. data/examples/integration/ahmed.rb +2 -2
  37. data/examples/integration/cosmology.rb +7 -7
  38. data/examples/integration/friedmann.rb +4 -4
  39. data/examples/integration/qng.rb +1 -1
  40. data/examples/interp/demo.rb +2 -2
  41. data/examples/linalg/LQ_solve.rb +1 -1
  42. data/examples/linalg/LU.rb +1 -1
  43. data/examples/linalg/LU2.rb +1 -1
  44. data/examples/linalg/LU_narray.rb +1 -1
  45. data/examples/linalg/PTLQ.rb +1 -1
  46. data/examples/linalg/QRPT.rb +1 -1
  47. data/examples/linalg/chol.rb +1 -1
  48. data/examples/linalg/chol_narray.rb +1 -1
  49. data/examples/linalg/complex.rb +1 -1
  50. data/examples/math/elementary.rb +1 -1
  51. data/examples/math/functions.rb +1 -1
  52. data/examples/math/inf_nan.rb +1 -1
  53. data/examples/math/minmax.rb +1 -1
  54. data/examples/math/power.rb +1 -1
  55. data/examples/math/test.rb +1 -1
  56. data/examples/min.rb +1 -1
  57. data/examples/multimin/bundle.rb +1 -1
  58. data/examples/multimin/cqp.rb +17 -17
  59. data/examples/multiroot/fsolver3.rb +1 -1
  60. data/examples/odeiv/binarysystem.rb +12 -12
  61. data/examples/odeiv/demo.rb +3 -3
  62. data/examples/odeiv/frei1.rb +7 -7
  63. data/examples/odeiv/frei2.rb +4 -4
  64. data/examples/odeiv/oscillator.rb +1 -1
  65. data/examples/odeiv/sedov.rb +3 -3
  66. data/examples/odeiv/whitedwarf.rb +11 -11
  67. data/examples/permutation/ex1.rb +2 -2
  68. data/examples/permutation/permutation.rb +1 -1
  69. data/examples/poly/demo.rb +1 -1
  70. data/examples/random/diffusion.rb +1 -1
  71. data/examples/random/generator.rb +2 -2
  72. data/examples/random/randomwalk.rb +3 -3
  73. data/examples/random/rng.rb +1 -1
  74. data/examples/roots/bisection.rb +1 -1
  75. data/examples/roots/brent.rb +1 -1
  76. data/examples/roots/demo.rb +1 -1
  77. data/examples/roots/newton.rb +2 -2
  78. data/examples/roots/recombination.gp +0 -1
  79. data/examples/sf/hyperg.rb +1 -1
  80. data/examples/sf/sphbessel.rb +1 -1
  81. data/examples/sort/sort.rb +1 -1
  82. data/examples/tamu_anova.rb +4 -4
  83. data/examples/vector/add.rb +1 -1
  84. data/examples/vector/decimate.rb +1 -1
  85. data/examples/vector/gnuplot.rb +8 -8
  86. data/examples/vector/vector.rb +2 -2
  87. data/examples/wavelet/wavelet1.rb +1 -1
  88. data/ext/{alf.c → gsl_native/alf.c} +10 -10
  89. data/ext/{array.c → gsl_native/array.c} +70 -159
  90. data/ext/{array_complex.c → gsl_native/array_complex.c} +63 -66
  91. data/ext/{blas.c → gsl_native/blas.c} +2 -3
  92. data/ext/{blas1.c → gsl_native/blas1.c} +35 -36
  93. data/ext/{blas2.c → gsl_native/blas2.c} +57 -62
  94. data/ext/{blas3.c → gsl_native/blas3.c} +57 -58
  95. data/ext/{block.c → gsl_native/block.c} +14 -18
  96. data/ext/{block_source.c → gsl_native/block_source.h} +110 -112
  97. data/ext/gsl_native/bspline.c +122 -0
  98. data/ext/{bundle.c → gsl_native/bundle.c} +0 -0
  99. data/ext/{cdf.c → gsl_native/cdf.c} +79 -93
  100. data/ext/{cheb.c → gsl_native/cheb.c} +78 -89
  101. data/ext/{combination.c → gsl_native/combination.c} +11 -19
  102. data/ext/{common.c → gsl_native/common.c} +9 -41
  103. data/ext/{complex.c → gsl_native/complex.c} +116 -118
  104. data/ext/gsl_native/const.c +331 -0
  105. data/ext/{const_additional.c → gsl_native/const_additional.c} +13 -34
  106. data/ext/gsl_native/cqp.c +283 -0
  107. data/ext/{deriv.c → gsl_native/deriv.c} +25 -33
  108. data/ext/{dht.c → gsl_native/dht.c} +23 -31
  109. data/ext/{diff.c → gsl_native/diff.c} +26 -28
  110. data/ext/{dirac.c → gsl_native/dirac.c} +45 -46
  111. data/ext/{eigen.c → gsl_native/eigen.c} +1044 -1095
  112. data/ext/{error.c → gsl_native/error.c} +18 -18
  113. data/ext/gsl_native/extconf.rb +118 -0
  114. data/ext/{fft.c → gsl_native/fft.c} +197 -204
  115. data/ext/{fit.c → gsl_native/fit.c} +17 -18
  116. data/ext/gsl_native/fresnel.c +312 -0
  117. data/ext/{function.c → gsl_native/function.c} +37 -43
  118. data/ext/{geometry.c → gsl_native/geometry.c} +16 -16
  119. data/ext/{graph.c → gsl_native/graph.c} +39 -89
  120. data/ext/{gsl.c → gsl_native/gsl.c} +12 -33
  121. data/ext/{gsl_narray.c → gsl_native/gsl_narray.c} +20 -30
  122. data/ext/{histogram.c → gsl_native/histogram.c} +133 -160
  123. data/ext/{histogram2d.c → gsl_native/histogram2d.c} +78 -104
  124. data/ext/{histogram3d.c → gsl_native/histogram3d.c} +76 -76
  125. data/ext/{histogram3d_source.c → gsl_native/histogram3d_source.c} +196 -197
  126. data/ext/{histogram_find.c → gsl_native/histogram_find.c} +32 -34
  127. data/ext/{histogram_oper.c → gsl_native/histogram_oper.c} +43 -52
  128. data/ext/{ieee.c → gsl_native/ieee.c} +9 -21
  129. data/{include → ext/gsl_native/include}/rb_gsl.h +4 -26
  130. data/{include → ext/gsl_native/include}/rb_gsl_array.h +15 -39
  131. data/{include → ext/gsl_native/include}/rb_gsl_cheb.h +0 -2
  132. data/{include → ext/gsl_native/include}/rb_gsl_common.h +61 -61
  133. data/{include → ext/gsl_native/include}/rb_gsl_complex.h +1 -1
  134. data/{include → ext/gsl_native/include}/rb_gsl_const.h +0 -6
  135. data/ext/gsl_native/include/rb_gsl_dirac.h +6 -0
  136. data/{include → ext/gsl_native/include}/rb_gsl_eigen.h +1 -1
  137. data/{include → ext/gsl_native/include}/rb_gsl_fft.h +0 -13
  138. data/{include → ext/gsl_native/include}/rb_gsl_fit.h +0 -2
  139. data/{include → ext/gsl_native/include}/rb_gsl_function.h +0 -4
  140. data/{include → ext/gsl_native/include}/rb_gsl_graph.h +2 -4
  141. data/{include → ext/gsl_native/include}/rb_gsl_histogram.h +8 -8
  142. data/{include → ext/gsl_native/include}/rb_gsl_histogram3d.h +50 -50
  143. data/{include → ext/gsl_native/include}/rb_gsl_integration.h +1 -1
  144. data/{include → ext/gsl_native/include}/rb_gsl_interp.h +0 -5
  145. data/{include → ext/gsl_native/include}/rb_gsl_linalg.h +2 -6
  146. data/{include → ext/gsl_native/include}/rb_gsl_math.h +0 -6
  147. data/{include → ext/gsl_native/include}/rb_gsl_odeiv.h +0 -3
  148. data/{include → ext/gsl_native/include}/rb_gsl_poly.h +3 -7
  149. data/{include → ext/gsl_native/include}/rb_gsl_rational.h +1 -8
  150. data/{include → ext/gsl_native/include}/rb_gsl_rng.h +0 -1
  151. data/{include → ext/gsl_native/include}/rb_gsl_root.h +1 -1
  152. data/{include → ext/gsl_native/include}/rb_gsl_sf.h +39 -48
  153. data/{include → ext/gsl_native/include}/rb_gsl_statistics.h +1 -1
  154. data/{include → ext/gsl_native/include}/rb_gsl_tensor.h +0 -2
  155. data/{include → ext/gsl_native/include}/rb_gsl_with_narray.h +3 -1
  156. data/{include → ext/gsl_native/include}/templates_off.h +0 -0
  157. data/{include → ext/gsl_native/include}/templates_on.h +1 -1
  158. data/ext/{integration.c → gsl_native/integration.c} +164 -189
  159. data/ext/{interp.c → gsl_native/interp.c} +25 -38
  160. data/ext/gsl_native/jacobi.c +733 -0
  161. data/ext/{linalg.c → gsl_native/linalg.c} +462 -589
  162. data/ext/{linalg_complex.c → gsl_native/linalg_complex.c} +93 -106
  163. data/ext/{math.c → gsl_native/math.c} +48 -67
  164. data/ext/{matrix.c → gsl_native/matrix.c} +13 -16
  165. data/ext/{matrix_complex.c → gsl_native/matrix_complex.c} +119 -123
  166. data/ext/{matrix_double.c → gsl_native/matrix_double.c} +79 -82
  167. data/ext/{matrix_int.c → gsl_native/matrix_int.c} +53 -54
  168. data/ext/{matrix_source.c → gsl_native/matrix_source.h} +292 -318
  169. data/ext/{min.c → gsl_native/min.c} +45 -76
  170. data/ext/{monte.c → gsl_native/monte.c} +50 -64
  171. data/ext/{multifit.c → gsl_native/multifit.c} +142 -151
  172. data/ext/{multimin.c → gsl_native/multimin.c} +64 -92
  173. data/ext/{multimin_fsdf.c → gsl_native/multimin_fsdf.c} +16 -16
  174. data/ext/{multiroots.c → gsl_native/multiroots.c} +73 -76
  175. data/ext/{multiset.c → gsl_native/multiset.c} +4 -8
  176. data/ext/{ndlinear.c → gsl_native/ndlinear.c} +320 -321
  177. data/ext/{nmf.c → gsl_native/nmf.c} +11 -11
  178. data/ext/{nmf_wrap.c → gsl_native/nmf_wrap.c} +1 -1
  179. data/ext/{ntuple.c → gsl_native/ntuple.c} +23 -23
  180. data/ext/{odeiv.c → gsl_native/odeiv.c} +101 -116
  181. data/ext/gsl_native/ool.c +879 -0
  182. data/ext/{permutation.c → gsl_native/permutation.c} +39 -37
  183. data/ext/{poly.c → gsl_native/poly.c} +10 -13
  184. data/ext/{poly2.c → gsl_native/poly2.c} +16 -16
  185. data/ext/{poly_source.c → gsl_native/poly_source.h} +249 -293
  186. data/ext/{qrng.c → gsl_native/qrng.c} +9 -20
  187. data/ext/{randist.c → gsl_native/randist.c} +222 -247
  188. data/ext/{rational.c → gsl_native/rational.c} +12 -12
  189. data/ext/{rng.c → gsl_native/rng.c} +30 -47
  190. data/ext/{root.c → gsl_native/root.c} +47 -48
  191. data/ext/{sf.c → gsl_native/sf.c} +196 -244
  192. data/ext/{sf_airy.c → gsl_native/sf_airy.c} +2 -2
  193. data/ext/{sf_bessel.c → gsl_native/sf_bessel.c} +7 -7
  194. data/ext/{sf_clausen.c → gsl_native/sf_clausen.c} +1 -1
  195. data/ext/{sf_coulomb.c → gsl_native/sf_coulomb.c} +40 -40
  196. data/ext/{sf_coupling.c → gsl_native/sf_coupling.c} +30 -30
  197. data/ext/{sf_dawson.c → gsl_native/sf_dawson.c} +1 -1
  198. data/ext/{sf_debye.c → gsl_native/sf_debye.c} +1 -10
  199. data/ext/{sf_dilog.c → gsl_native/sf_dilog.c} +1 -1
  200. data/ext/{sf_elementary.c → gsl_native/sf_elementary.c} +3 -3
  201. data/ext/{sf_ellint.c → gsl_native/sf_ellint.c} +43 -43
  202. data/ext/{sf_elljac.c → gsl_native/sf_elljac.c} +3 -3
  203. data/ext/{sf_erfc.c → gsl_native/sf_erfc.c} +1 -5
  204. data/ext/{sf_exp.c → gsl_native/sf_exp.c} +3 -3
  205. data/ext/{sf_expint.c → gsl_native/sf_expint.c} +2 -12
  206. data/ext/{sf_fermi_dirac.c → gsl_native/sf_fermi_dirac.c} +1 -1
  207. data/ext/{sf_gamma.c → gsl_native/sf_gamma.c} +2 -6
  208. data/ext/{sf_gegenbauer.c → gsl_native/sf_gegenbauer.c} +1 -1
  209. data/ext/{sf_hyperg.c → gsl_native/sf_hyperg.c} +1 -1
  210. data/ext/{sf_laguerre.c → gsl_native/sf_laguerre.c} +4 -4
  211. data/ext/{sf_lambert.c → gsl_native/sf_lambert.c} +1 -1
  212. data/ext/{sf_legendre.c → gsl_native/sf_legendre.c} +1 -1
  213. data/ext/{sf_log.c → gsl_native/sf_log.c} +4 -4
  214. data/ext/gsl_native/sf_mathieu.c +235 -0
  215. data/ext/{sf_power.c → gsl_native/sf_power.c} +1 -1
  216. data/ext/{sf_psi.c → gsl_native/sf_psi.c} +3 -12
  217. data/ext/{sf_synchrotron.c → gsl_native/sf_synchrotron.c} +1 -1
  218. data/ext/{sf_transport.c → gsl_native/sf_transport.c} +1 -1
  219. data/ext/{sf_trigonometric.c → gsl_native/sf_trigonometric.c} +4 -4
  220. data/ext/{sf_zeta.c → gsl_native/sf_zeta.c} +1 -5
  221. data/ext/{signal.c → gsl_native/signal.c} +63 -68
  222. data/ext/{siman.c → gsl_native/siman.c} +45 -49
  223. data/ext/{sort.c → gsl_native/sort.c} +6 -7
  224. data/ext/{spline.c → gsl_native/spline.c} +28 -46
  225. data/ext/{stats.c → gsl_native/stats.c} +105 -118
  226. data/ext/{sum.c → gsl_native/sum.c} +34 -34
  227. data/ext/{tamu_anova.c → gsl_native/tamu_anova.c} +1 -1
  228. data/ext/{tensor.c → gsl_native/tensor.c} +8 -11
  229. data/ext/{tensor_source.c → gsl_native/tensor_source.h} +147 -148
  230. data/ext/{vector.c → gsl_native/vector.c} +11 -14
  231. data/ext/{vector_complex.c → gsl_native/vector_complex.c} +179 -184
  232. data/ext/{vector_double.c → gsl_native/vector_double.c} +178 -183
  233. data/ext/{vector_int.c → gsl_native/vector_int.c} +27 -29
  234. data/ext/{vector_source.c → gsl_native/vector_source.h} +428 -443
  235. data/ext/{wavelet.c → gsl_native/wavelet.c} +224 -246
  236. data/gsl.gemspec +29 -0
  237. data/lib/gsl.rb +8 -3
  238. data/lib/gsl/gnuplot.rb +3 -3
  239. data/lib/gsl/oper.rb +35 -60
  240. data/lib/gsl/version.rb +3 -0
  241. data/lib/rbgsl.rb +1 -3
  242. data/rdoc/alf.rdoc +5 -5
  243. data/rdoc/blas.rdoc +9 -9
  244. data/rdoc/bspline.rdoc +17 -17
  245. data/rdoc/changes.rdoc +4 -9
  246. data/rdoc/cheb.rdoc +25 -25
  247. data/rdoc/cholesky_complex.rdoc +21 -21
  248. data/rdoc/combi.rdoc +37 -37
  249. data/rdoc/complex.rdoc +22 -22
  250. data/rdoc/const.rdoc +47 -47
  251. data/rdoc/dht.rdoc +49 -49
  252. data/rdoc/diff.rdoc +42 -42
  253. data/rdoc/ehandling.rdoc +6 -6
  254. data/rdoc/eigen.rdoc +153 -153
  255. data/rdoc/fft.rdoc +146 -146
  256. data/rdoc/fit.rdoc +109 -109
  257. data/rdoc/function.rdoc +11 -11
  258. data/rdoc/graph.rdoc +17 -17
  259. data/rdoc/hist.rdoc +103 -103
  260. data/rdoc/hist2d.rdoc +42 -42
  261. data/rdoc/hist3d.rdoc +9 -9
  262. data/rdoc/integration.rdoc +110 -110
  263. data/rdoc/interp.rdoc +71 -71
  264. data/rdoc/intro.rdoc +8 -8
  265. data/rdoc/linalg.rdoc +188 -188
  266. data/rdoc/linalg_complex.rdoc +1 -1
  267. data/rdoc/math.rdoc +58 -58
  268. data/rdoc/matrix.rdoc +275 -275
  269. data/rdoc/min.rdoc +57 -57
  270. data/rdoc/monte.rdoc +22 -22
  271. data/rdoc/multimin.rdoc +95 -95
  272. data/rdoc/multiroot.rdoc +80 -80
  273. data/rdoc/narray.rdoc +32 -32
  274. data/rdoc/ndlinear.rdoc +54 -54
  275. data/rdoc/nonlinearfit.rdoc +100 -100
  276. data/rdoc/ntuple.rdoc +31 -31
  277. data/rdoc/odeiv.rdoc +88 -88
  278. data/rdoc/perm.rdoc +90 -90
  279. data/rdoc/poly.rdoc +66 -66
  280. data/rdoc/qrng.rdoc +21 -21
  281. data/rdoc/randist.rdoc +82 -82
  282. data/rdoc/ref.rdoc +57 -57
  283. data/rdoc/rng.rdoc +85 -85
  284. data/rdoc/roots.rdoc +57 -57
  285. data/rdoc/sf.rdoc +428 -428
  286. data/rdoc/siman.rdoc +19 -19
  287. data/rdoc/sort.rdoc +30 -30
  288. data/rdoc/start.rdoc +8 -8
  289. data/rdoc/stats.rdoc +52 -52
  290. data/rdoc/sum.rdoc +12 -12
  291. data/rdoc/tensor.rdoc +31 -31
  292. data/rdoc/tut.rdoc +1 -1
  293. data/rdoc/use.rdoc +39 -39
  294. data/rdoc/vector.rdoc +188 -188
  295. data/rdoc/vector_complex.rdoc +24 -24
  296. data/rdoc/wavelet.rdoc +46 -46
  297. data/test/gsl/blas_test.rb +79 -0
  298. data/test/gsl/bspline_test.rb +63 -0
  299. data/test/gsl/cdf_test.rb +1512 -0
  300. data/test/gsl/cheb_test.rb +80 -0
  301. data/test/gsl/combination_test.rb +100 -0
  302. data/test/gsl/complex_test.rb +20 -0
  303. data/test/gsl/const_test.rb +29 -0
  304. data/test/gsl/deriv_test.rb +62 -0
  305. data/test/gsl/dht_test.rb +79 -0
  306. data/test/gsl/diff_test.rb +53 -0
  307. data/test/gsl/eigen_test.rb +563 -0
  308. data/test/gsl/err_test.rb +23 -0
  309. data/test/gsl/fit_test.rb +101 -0
  310. data/test/gsl/histo_test.rb +14 -0
  311. data/test/gsl/index_test.rb +61 -0
  312. data/test/gsl/integration_test.rb +274 -0
  313. data/test/gsl/interp_test.rb +27 -0
  314. data/test/gsl/linalg_test.rb +463 -0
  315. data/test/gsl/matrix_nmf_test.rb +37 -0
  316. data/test/gsl/matrix_test.rb +98 -0
  317. data/test/gsl/min_test.rb +89 -0
  318. data/test/gsl/monte_test.rb +77 -0
  319. data/test/gsl/multifit_test.rb +753 -0
  320. data/test/gsl/multimin_test.rb +157 -0
  321. data/test/gsl/multiroot_test.rb +135 -0
  322. data/test/gsl/multiset_test.rb +52 -0
  323. data/test/gsl/odeiv_test.rb +275 -0
  324. data/test/gsl/oper_test.rb +98 -0
  325. data/test/gsl/poly_test.rb +338 -0
  326. data/test/gsl/qrng_test.rb +94 -0
  327. data/test/gsl/quartic_test.rb +28 -0
  328. data/test/gsl/randist_test.rb +122 -0
  329. data/test/gsl/rng_test.rb +303 -0
  330. data/test/gsl/roots_test.rb +78 -0
  331. data/test/gsl/sf_test.rb +2079 -0
  332. data/test/gsl/stats_test.rb +122 -0
  333. data/test/gsl/sum_test.rb +69 -0
  334. data/test/gsl/tensor_test.rb +396 -0
  335. data/test/gsl/vector_test.rb +223 -0
  336. data/test/gsl/wavelet_test.rb +130 -0
  337. data/test/gsl_test.rb +321 -0
  338. data/test/test_helper.rb +42 -0
  339. data/uncrustify.cfg +1693 -0
  340. metadata +337 -378
  341. data/README +0 -32
  342. data/VERSION +0 -1
  343. data/ext/bspline.c +0 -130
  344. data/ext/const.c +0 -673
  345. data/ext/cqp.c +0 -283
  346. data/ext/extconf.rb +0 -295
  347. data/ext/fcmp.c +0 -66
  348. data/ext/fresnel.c +0 -312
  349. data/ext/jacobi.c +0 -739
  350. data/ext/ool.c +0 -879
  351. data/ext/oper_complex_source.c +0 -253
  352. data/ext/sf_mathieu.c +0 -238
  353. data/include/rb_gsl_config.h +0 -62
  354. data/include/rb_gsl_dirac.h +0 -13
  355. data/rdoc/index.rdoc +0 -62
  356. data/rdoc/rngextra.rdoc +0 -11
  357. data/rdoc/screenshot.rdoc +0 -40
  358. data/setup.rb +0 -1585
  359. data/tests/blas/amax.rb +0 -14
  360. data/tests/blas/asum.rb +0 -16
  361. data/tests/blas/axpy.rb +0 -25
  362. data/tests/blas/copy.rb +0 -23
  363. data/tests/blas/dot.rb +0 -23
  364. data/tests/bspline.rb +0 -53
  365. data/tests/cdf.rb +0 -1388
  366. data/tests/cheb.rb +0 -112
  367. data/tests/combination.rb +0 -123
  368. data/tests/complex.rb +0 -17
  369. data/tests/const.rb +0 -24
  370. data/tests/deriv.rb +0 -85
  371. data/tests/dht/dht1.rb +0 -17
  372. data/tests/dht/dht2.rb +0 -23
  373. data/tests/dht/dht3.rb +0 -23
  374. data/tests/dht/dht4.rb +0 -23
  375. data/tests/diff.rb +0 -78
  376. data/tests/eigen/eigen.rb +0 -220
  377. data/tests/eigen/gen.rb +0 -105
  378. data/tests/eigen/genherm.rb +0 -66
  379. data/tests/eigen/gensymm.rb +0 -68
  380. data/tests/eigen/nonsymm.rb +0 -53
  381. data/tests/eigen/nonsymmv.rb +0 -53
  382. data/tests/eigen/symm-herm.rb +0 -74
  383. data/tests/err.rb +0 -58
  384. data/tests/fit.rb +0 -124
  385. data/tests/gsl_test.rb +0 -118
  386. data/tests/gsl_test2.rb +0 -110
  387. data/tests/histo.rb +0 -12
  388. data/tests/integration/integration1.rb +0 -72
  389. data/tests/integration/integration2.rb +0 -71
  390. data/tests/integration/integration3.rb +0 -71
  391. data/tests/integration/integration4.rb +0 -71
  392. data/tests/interp.rb +0 -45
  393. data/tests/linalg/HH.rb +0 -64
  394. data/tests/linalg/LU.rb +0 -47
  395. data/tests/linalg/QR.rb +0 -77
  396. data/tests/linalg/SV.rb +0 -24
  397. data/tests/linalg/TDN.rb +0 -116
  398. data/tests/linalg/TDS.rb +0 -122
  399. data/tests/linalg/bidiag.rb +0 -73
  400. data/tests/linalg/cholesky.rb +0 -20
  401. data/tests/linalg/linalg.rb +0 -158
  402. data/tests/matrix/matrix_complex_test.rb +0 -36
  403. data/tests/matrix/matrix_nmf_test.rb +0 -39
  404. data/tests/matrix/matrix_test.rb +0 -48
  405. data/tests/min.rb +0 -99
  406. data/tests/monte/miser.rb +0 -31
  407. data/tests/monte/vegas.rb +0 -45
  408. data/tests/multifit/test_2dgauss.rb +0 -112
  409. data/tests/multifit/test_brown.rb +0 -90
  410. data/tests/multifit/test_enso.rb +0 -246
  411. data/tests/multifit/test_filip.rb +0 -155
  412. data/tests/multifit/test_gauss.rb +0 -97
  413. data/tests/multifit/test_longley.rb +0 -110
  414. data/tests/multifit/test_multifit.rb +0 -52
  415. data/tests/multimin.rb +0 -139
  416. data/tests/multiroot.rb +0 -131
  417. data/tests/multiset.rb +0 -52
  418. data/tests/narray/blas_dnrm2.rb +0 -20
  419. data/tests/odeiv.rb +0 -353
  420. data/tests/poly/poly.rb +0 -290
  421. data/tests/poly/special.rb +0 -65
  422. data/tests/qrng.rb +0 -131
  423. data/tests/quartic.rb +0 -29
  424. data/tests/randist.rb +0 -134
  425. data/tests/rng.rb +0 -305
  426. data/tests/roots.rb +0 -76
  427. data/tests/run-test.sh +0 -17
  428. data/tests/sf/gsl_test_sf.rb +0 -249
  429. data/tests/sf/test_airy.rb +0 -83
  430. data/tests/sf/test_bessel.rb +0 -306
  431. data/tests/sf/test_coulomb.rb +0 -17
  432. data/tests/sf/test_dilog.rb +0 -25
  433. data/tests/sf/test_gamma.rb +0 -209
  434. data/tests/sf/test_hyperg.rb +0 -356
  435. data/tests/sf/test_legendre.rb +0 -227
  436. data/tests/sf/test_mathieu.rb +0 -59
  437. data/tests/sf/test_mode.rb +0 -19
  438. data/tests/sf/test_sf.rb +0 -839
  439. data/tests/stats.rb +0 -174
  440. data/tests/stats_mt.rb +0 -16
  441. data/tests/sum.rb +0 -98
  442. data/tests/sys.rb +0 -323
  443. data/tests/tensor.rb +0 -419
  444. data/tests/vector/vector_complex_test.rb +0 -101
  445. data/tests/vector/vector_test.rb +0 -141
  446. data/tests/wavelet.rb +0 -142
@@ -1,83 +1,83 @@
1
1
  #
2
2
  # = Random Number Generation
3
- # The library provides a large collection of random number generators which
4
- # can be accessed through a uniform interface. Environment variables allow you
5
- # to select different generators and seeds at runtime, so that you can easily
6
- # switch between generators without needing to recompile your program.
7
- # Each instance of a generator keeps track of its own state, allowing the
8
- # generators to be used in multi-threaded programs. Additional functions are
9
- # available for transforming uniform random numbers into samples from
10
- # continuous or discrete probability distributions such as the Gaussian,
11
- # log-normal or Poisson distributions.
3
+ # The library provides a large collection of random number generators which
4
+ # can be accessed through a uniform interface. Environment variables allow you
5
+ # to select different generators and seeds at runtime, so that you can easily
6
+ # switch between generators without needing to recompile your program.
7
+ # Each instance of a generator keeps track of its own state, allowing the
8
+ # generators to be used in multi-threaded programs. Additional functions are
9
+ # available for transforming uniform random numbers into samples from
10
+ # continuous or discrete probability distributions such as the Gaussian,
11
+ # log-normal or Poisson distributions.
12
12
  #
13
13
  #
14
14
  #
15
15
  # Contents:
16
- # 1. {General comments on random numbers}[link:files/rdoc/rng_rdoc.html#1]
17
- # 1. {The Random Number Generator Interface: GSL::Rng class}[link:files/rdoc/rng_rdoc.html#2]
18
- # 1. {Random number generator initialization}[link:files/rdoc/rng_rdoc.html#3]
19
- # 1. {Sampling from a random number generator}[link:files/rdoc/rng_rdoc.html#4]
20
- # 1. {Auxiliary random number generator functions}[link:files/rdoc/rng_rdoc.html#5]
21
- # 1. {Random number environment variables}[link:files/rdoc/rng_rdoc.html#6]
22
- #
23
- # == {}[link:index.html"name="1] General comments on random numbers
24
- # In 1988, Park and Miller wrote a paper entitled "Random number generators:
16
+ # 1. {General comments on random numbers}[link:rdoc/rng_rdoc.html#label-General+comments+on+random+numbers]
17
+ # 1. {The Random Number Generator Interface: GSL::Rng class}[link:rdoc/rng_rdoc.html#label-The+Random+Number+Generator+Interface]
18
+ # 1. {Random number generator initialization}[link:rdoc/rng_rdoc.html#label-Random+number+generator+initialization]
19
+ # 1. {Sampling from a random number generator}[link:rdoc/rng_rdoc.html#label-Sampling+from+a+random+number+generator]
20
+ # 1. {Auxiliary random number generator functions}[link:rdoc/rng_rdoc.html#label-Auxiliary+random+number+generator+functions]
21
+ # 1. {Random number environment variables}[link:rdoc/rng_rdoc.html#label-Random+number+environment+variables]
22
+ #
23
+ # == General comments on random numbers
24
+ # In 1988, Park and Miller wrote a paper entitled "Random number generators:
25
25
  # good ones are hard to find." [Commun. ACM, 31, 1192-1201]. Fortunately, some
26
- # excellent random number generators are available, though poor ones are still
27
- # in common use. You may be happy with the system-supplied random number
28
- # generator on your computer, but you should be aware that as computers get
29
- # faster, requirements on random number generators increase. Nowadays, a
30
- # simulation that calls a random number generator millions of times can often
31
- # finish before you can make it down the hall to the coffee machine and back.
32
- #
33
- # A very nice review of random number generators was written by Pierre L'Ecuyer,
26
+ # excellent random number generators are available, though poor ones are still
27
+ # in common use. You may be happy with the system-supplied random number
28
+ # generator on your computer, but you should be aware that as computers get
29
+ # faster, requirements on random number generators increase. Nowadays, a
30
+ # simulation that calls a random number generator millions of times can often
31
+ # finish before you can make it down the hall to the coffee machine and back.
32
+ #
33
+ # A very nice review of random number generators was written by Pierre L'Ecuyer,
34
34
  # as Chapter 4 of the book: Handbook on Simulation, Jerry Banks, ed.
35
- # (Wiley, 1997). The chapter is available in postscript from L'Ecuyer's
36
- # ftp site (see references). Knuth's volume on Seminumerical Algorithms
35
+ # (Wiley, 1997). The chapter is available in postscript from L'Ecuyer's
36
+ # ftp site (see references). Knuth's volume on Seminumerical Algorithms
37
37
  # (originally published in 1968) devotes 170 pages to random number generators,
38
- # and has recently been updated in its 3rd edition (1997). It is brilliant,
39
- # a classic. If you don't own it, you should stop reading right now, run to the
40
- # nearest bookstore, and buy it.
41
- #
42
- # A good random number generator will satisfy both theoretical and statistical
43
- # properties. Theoretical properties are often hard to obtain (they require real
44
- # math!), but one prefers a random number generator with a long period,
45
- # low serial correlation, and a tendency not to "fall mainly on the planes."
38
+ # and has recently been updated in its 3rd edition (1997). It is brilliant,
39
+ # a classic. If you don't own it, you should stop reading right now, run to the
40
+ # nearest bookstore, and buy it.
41
+ #
42
+ # A good random number generator will satisfy both theoretical and statistical
43
+ # properties. Theoretical properties are often hard to obtain (they require real
44
+ # math!), but one prefers a random number generator with a long period,
45
+ # low serial correlation, and a tendency not to "fall mainly on the planes."
46
46
  # Statistical tests are performed with numerical simulations. Generally,
47
- # a random number generator is used to estimate some quantity for which the
48
- # theory of probability provides an exact answer. Comparison to this exact
49
- # answer provides a measure of "randomness".
50
- #
51
- # == {}[link:index.html"name="2] The Random Number Generator Interface
52
- # It is important to remember that a random number generator is not a "real"
53
- # function like sine or cosine. Unlike real functions, successive calls to a
54
- # random number generator yield different return values. Of course that is just
55
- # what you want for a random number generator, but to achieve this effect,
56
- # the generator must keep track of some kind of "state" variable. Sometimes this
57
- # state is just an integer (sometimes just the value of the previously generated
58
- # random number), but often it is more complicated than that and may involve a
59
- # whole array of numbers, possibly with some indices thrown in. To use the
60
- # random number generators, you do not need to know the details of what
61
- # comprises the state, and besides that varies from algorithm to algorithm.
47
+ # a random number generator is used to estimate some quantity for which the
48
+ # theory of probability provides an exact answer. Comparison to this exact
49
+ # answer provides a measure of "randomness".
50
+ #
51
+ # == The Random Number Generator Interface
52
+ # It is important to remember that a random number generator is not a "real"
53
+ # function like sine or cosine. Unlike real functions, successive calls to a
54
+ # random number generator yield different return values. Of course that is just
55
+ # what you want for a random number generator, but to achieve this effect,
56
+ # the generator must keep track of some kind of "state" variable. Sometimes this
57
+ # state is just an integer (sometimes just the value of the previously generated
58
+ # random number), but often it is more complicated than that and may involve a
59
+ # whole array of numbers, possibly with some indices thrown in. To use the
60
+ # random number generators, you do not need to know the details of what
61
+ # comprises the state, and besides that varies from algorithm to algorithm.
62
62
  #
63
63
  # The random number generator library uses <tt>GSL::Rng</tt> class for the interface.
64
- # == {}[link:index.html"name="3] Random number generator initialization
64
+ # == Random number generator initialization
65
65
  #
66
66
  # ---
67
67
  # * GSL::Rng.alloc(rng_type[, seed])
68
68
  #
69
- # This method returns a GSL::Rng object of a random number generator of type
70
- # <tt>rng_type</tt> with a seed <tt>seed</tt>. These two arguments can be omitted,
69
+ # This method returns a GSL::Rng object of a random number generator of type
70
+ # <tt>rng_type</tt> with a seed <tt>seed</tt>. These two arguments can be omitted,
71
71
  # and the generator 'gsl_rng_mt19937' and a seed 0 are used as defaults.
72
- # The GSL library provides a number of random number generator types,
72
+ # The GSL library provides a number of random number generator types,
73
73
  # and one can choose with a constant <tt>GSL::RNG_xxx</tt> or a String, as
74
74
  #
75
75
  # * <tt>GSL::Rng::MT19937</tt> or <tt>"gsl_rng_mt19937"</tt> or <tt>"mt19937"</tt>
76
- # * <tt>GSL::Rng::RANLXS0</tt> or <tt>"gsl_rng_ranlsx0"</tt> or <tt>"ranlxs0"</tt>
77
- # * <tt>GSL::Rng::ZUF</tt> or <tt>"gsl_rng_zuf"</tt> or <tt>"zuf"</tt>
76
+ # * <tt>GSL::Rng::RANLXS0</tt> or <tt>"gsl_rng_ranlsx0"</tt> or <tt>"ranlxs0"</tt>
77
+ # * <tt>GSL::Rng::ZUF</tt> or <tt>"gsl_rng_zuf"</tt> or <tt>"zuf"</tt>
78
78
  # * ...
79
79
  #
80
- # See the {GSL reference manual}[http://www.gnu.org/software/gsl/manual/html_node/Random-number-generator-algorithms.html#Random-number-generator-algorithms"target="_top] for the complete list.
80
+ # See the {GSL reference manual}[https://gnu.org/software/gsl/manual/html_node/Random-number-generator-algorithms.html#Random-number-generator-algorithms] for the complete list.
81
81
  # The following demonstrates how to use this class,
82
82
  #
83
83
  # require 'gsl'
@@ -90,12 +90,12 @@
90
90
  #
91
91
  # A generator of the type <tt>gsl_rng_taus</tt> is created with seed 1,
92
92
  # and <tt>gsl_rng_ran0</tt> with seed 2. The
93
- # method <tt>get</tt> returns a random integer.
93
+ # method <tt>get</tt> returns a random integer.
94
94
  # The method <tt>uniform</tt> returns
95
95
  # a floating number uniformly distributed in the range [0, 1).
96
96
  #
97
- # If the package {rngextra}[http://www.network-theory.co.uk/download/rngextra/"target="_top] is installed, additional
98
- # two generators are available,
97
+ # If the package {rngextra}[http://www.network-theory.co.uk/download/rngextra/] is installed, additional
98
+ # two generators are available,
99
99
  # * <tt>GSL::Rng::RNGEXTRA_RNG1</tt>, <tt>"rngextra_rng1"</tt>
100
100
  # * <tt>GSL::Rng::RNGEXTRA_RNG2</tt>, <tt>"rngextra_rng2"</tt>
101
101
  #
@@ -120,13 +120,13 @@
120
120
  # ---
121
121
  # * GSL::Rng.types_setup()
122
122
  #
123
- # Returns an array of all the available generators' names.
123
+ # Returns an array of all the available generators' names.
124
124
  #
125
125
  # ---
126
126
  # * GSK::Rng.memcpy(dest, src)
127
127
  #
128
- # Copies the random number generator <tt>src</tt>) into the pre-existing generator
129
- # <tt>dest</tt>, making dest into an exact copy of <tt>src</tt>.
128
+ # Copies the random number generator <tt>src</tt>) into the pre-existing generator
129
+ # <tt>dest</tt>, making dest into an exact copy of <tt>src</tt>.
130
130
  # The two generators must be of the same type.
131
131
  #
132
132
  # ---
@@ -134,7 +134,7 @@
134
134
  #
135
135
  # This method initializes the random number generator with a given seed <tt>s</tt>.
136
136
  #
137
- # == {}[link:index.html"name="4] Sampling from a random number generator
137
+ # == Sampling from a random number generator
138
138
  #
139
139
  # ---
140
140
  # * GSL::Rng#get
@@ -144,21 +144,21 @@
144
144
  # ---
145
145
  # * GSL::Rng#uniform
146
146
  #
147
- # This method returns a double precision floating point number uniformly
148
- # distributed in the range [0,1).
147
+ # This method returns a double precision floating point number uniformly
148
+ # distributed in the range [0,1).
149
149
  #
150
150
  # ---
151
151
  # * GSL::Rng#uniform_pos
152
152
  #
153
- # This returns a positive double precision floating point number uniformly
153
+ # This returns a positive double precision floating point number uniformly
154
154
  # distributed in the range (0,1), excluding both 0.0 and 1.0.
155
155
  #
156
156
  # ---
157
157
  # * GSL::Rng#uniform_int(n)
158
158
  #
159
- # This method returns a random integer from 0 to n-1 inclusive.
159
+ # This method returns a random integer from 0 to n-1 inclusive.
160
160
  #
161
- # == {}[link:index.html"name="5] Auxiliary random number generator functions
161
+ # == Auxiliary random number generator functions
162
162
  #
163
163
  # ---
164
164
  # * GSL::Rng#name
@@ -169,8 +169,8 @@
169
169
  # * GSL::Rng#max
170
170
  # * GSL::Rng#min
171
171
  #
172
- # These method return the largest/smallest value that the method
173
- # <tt>get</tt> can return.
172
+ # These method return the largest/smallest value that the method
173
+ # <tt>get</tt> can return.
174
174
  #
175
175
  # ---
176
176
  # * GSL::Rng#clone
@@ -178,26 +178,26 @@
178
178
  #
179
179
  # Return a newly created generator which is an exact copy of the generator <tt>self</tt>.
180
180
  #
181
- # == {}[link:index.html"name="6] Random number environment variables
182
- # The library allows you to choose a default generator and seed from the
183
- # environment variables <tt>GSL_RNG_TYPE</tt> and <tt>GSL_RNG_SEED</tt>
184
- # and the method <tt>GSL::Rng::env_setup</tt>.
181
+ # == Random number environment variables
182
+ # The library allows you to choose a default generator and seed from the
183
+ # environment variables <tt>GSL_RNG_TYPE</tt> and <tt>GSL_RNG_SEED</tt>
184
+ # and the method <tt>GSL::Rng::env_setup</tt>.
185
185
  #
186
186
  # ---
187
187
  # * GSL::Rng.env_setup()
188
188
  #
189
- # Reads the environment variables <tt>GSL_RNG_TYPE</tt> and
190
- # <tt>GSL_RNG_SEED</tt> and uses their values to set the corresponding
189
+ # Reads the environment variables <tt>GSL_RNG_TYPE</tt> and
190
+ # <tt>GSL_RNG_SEED</tt> and uses their values to set the corresponding
191
191
  # library variables.
192
192
  #
193
- # If you don't specify a generator for <tt>GSL_RNG_TYPE</tt>
194
- # then "mt19937" is used as the default.
195
- # The initial value of the default seed is zero.
193
+ # If you don't specify a generator for <tt>GSL_RNG_TYPE</tt>
194
+ # then "mt19937" is used as the default.
195
+ # The initial value of the default seed is zero.
196
196
  #
197
197
  #
198
- # {prev}[link:files/rdoc/integration_rdoc.html]
199
- # {next}[link:files/rdoc/qrng_rdoc.html]
198
+ # {prev}[link:rdoc/integration_rdoc.html]
199
+ # {next}[link:rdoc/qrng_rdoc.html]
200
200
  #
201
- # {Reference index}[link:files/rdoc/ref_rdoc.html]
202
- # {top}[link:files/rdoc/index_rdoc.html]
201
+ # {Reference index}[link:rdoc/ref_rdoc.html]
202
+ # {top}[link:index.html]
203
203
  #
@@ -1,27 +1,27 @@
1
1
  #
2
2
  # = One dimensional root-finding and the solver classes
3
- # One-dimensional root finding algorithms can be divided into two classes,
4
- # <tt>root bracketing</tt> and <tt>root polishing</tt>. The state for bracketing solvers
5
- # is held in a <tt>GSL::Root::FSolver</tt> object. The updating procedure uses only
6
- # function evaluations (not derivatives). The state for root polishing solvers is
7
- # held in a <tt>GSL::Root::FdfSolver</tt> object. The updates require both the function
3
+ # One-dimensional root finding algorithms can be divided into two classes,
4
+ # <tt>root bracketing</tt> and <tt>root polishing</tt>. The state for bracketing solvers
5
+ # is held in a <tt>GSL::Root::FSolver</tt> object. The updating procedure uses only
6
+ # function evaluations (not derivatives). The state for root polishing solvers is
7
+ # held in a <tt>GSL::Root::FdfSolver</tt> object. The updates require both the function
8
8
  # and its derivative (hence the name fdf) to be supplied by the user.
9
9
  #
10
10
  # Contents:
11
- # 1. {Solver classes}[link:files/rdoc/roots_rdoc.html#1]
12
- # 1. {Methods}[link:files/rdoc/roots_rdoc.html#2]
13
- # 1. {Methods to solve equations}[link:files/rdoc/roots_rdoc.html#2.1]
14
- # 1. {GSL::Function_fdf class: Providing the function to solve}[link:files/rdoc/roots_rdoc.html#2.2]
15
- # 1. {Search Stopping Parameters}[link:files/rdoc/roots_rdoc.html#2.3]
16
- # 1. {Higher-level interface}[link:files/rdoc/roots_rdoc.html#3]
17
- # 1. {Example}[link:files/rdoc/roots_rdoc.html#4]
11
+ # 1. {Solver classes}[link:rdoc/roots_rdoc.html#label-Solver+classes]
12
+ # 1. {Methods}[link:rdoc/roots_rdoc.html#label-Methods]
13
+ # 1. {Methods to solve equations}[link:rdoc/roots_rdoc.html#label-Methods+to+solve+equations]
14
+ # 1. {GSL::Function_fdf class: Providing the function to solve}[link:rdoc/roots_rdoc.html#label-Function_fdf+class]
15
+ # 1. {Search Stopping Parameters}[link:rdoc/roots_rdoc.html#label-Search+Stopping+Parameters]
16
+ # 1. {Higher-level interface}[link:rdoc/roots_rdoc.html#label-High-level+interface]
17
+ # 1. {Example}[link:rdoc/roots_rdoc.html#label-Example]
18
18
  #
19
- # == {}[link:index.html"name="1] Solver classes
19
+ # == Solver classes
20
20
  #
21
21
  # ---
22
22
  # * GSL::Root::FSolver.alloc(T)
23
23
  #
24
- # This creates a equation solver with a root bracketing algorithm of type <tt>T</tt>.
24
+ # This creates a equation solver with a root bracketing algorithm of type <tt>T</tt>.
25
25
  # The type <tt>T</tt> is given by a String or a constant,
26
26
  # * <tt>"bisection"</tt> or <tt>GSL::Root::FSolver::BISECION</tt>
27
27
  # * <tt>"falsepos"</tt> or <tt>GSL::Root::FSolver::FALSEPOS</tt>
@@ -37,37 +37,37 @@
37
37
  # ---
38
38
  # * GSL::Root::FdfSolver.alloc(T)
39
39
  #
40
- # This creates a derivative-based solver of type <tt>T</tt>.
40
+ # This creates a derivative-based solver of type <tt>T</tt>.
41
41
  # The type <tt>T</tt> is given by a String or a constant,
42
42
  # * <tt>"newton"</tt> or <tt>GSL::Root::FdfSolver::NEWTON</tt>
43
43
  # * <tt>"secant"</tt> or <tt>GSL::Root::FdfSolver::SECANT</tt>
44
44
  # * <tt>"steffenson"</tt> or <tt>GSL::Root::FdfSolver::STEFFENSON</tt>.
45
45
  #
46
- # == {}[link:index.html"name="2] Methods
46
+ # == Methods
47
47
  #
48
48
  # ---
49
49
  # * GSL::Root::FSolver#set(f, xl, xu)
50
50
  #
51
- # This initialize the solver <tt>self</tt> to use the function <tt>f</tt>,
52
- # and the initial search
53
- # interval <tt>xl, xu</tt>. The function to be solved <tt>f</tt> is given
54
- # an instanse of the {GSL::Function}[link:files/rdoc/function_rdoc.html] class.
51
+ # This initialize the solver <tt>self</tt> to use the function <tt>f</tt>,
52
+ # and the initial search
53
+ # interval <tt>xl, xu</tt>. The function to be solved <tt>f</tt> is given
54
+ # an instanse of the {GSL::Function}[link:rdoc/function_rdoc.html] class.
55
55
  #
56
56
  # ---
57
57
  # * GSL::Root::FdfSolver#set(fdf, r)
58
58
  #
59
- # This initializes, or reinitializes, an existing solver <tt>self</tt>
59
+ # This initializes, or reinitializes, an existing solver <tt>self</tt>
60
60
  # to use the function and derivative <tt>fdf</tt> and the initial guess <tt>r</tt>.
61
61
  # Here <tt>fdf</tt> is a <tt>GSL::Function_fdf</tt> object (see below).
62
62
  #
63
63
  #
64
- # === {}[link:index.html"name="2.1] Methods to solve equations
64
+ # === Methods to solve equations
65
65
  #
66
66
  # ---
67
67
  # * GSL::Root::FSolver#iterate
68
68
  # * GSL::Root::FdfSolver#iterate
69
69
  #
70
- # This performs a single iteration of the solver. If the iteration encounters an unexpected problem then an error code will be returned ( <tt>GSL::EBADFUNC</tt> or
70
+ # This performs a single iteration of the solver. If the iteration encounters an unexpected problem then an error code will be returned ( <tt>GSL::EBADFUNC</tt> or
71
71
  # <tt>GSL::EZERODIV</tt> ).
72
72
  #
73
73
  # ---
@@ -89,9 +89,9 @@
89
89
  #
90
90
  # Return the current bracketing interval for the solver.
91
91
  #
92
- # === {}[link:index.html"name="2.2] GSL::Function_fdf class: Providing the function to solve
93
- # The <tt>FSolver</tt> object require an instance of the
94
- # {GSL::Function}[link:files/rdoc/function_rdoc.html] class, which is already introduced elsewhere.
92
+ # === Function_fdf class
93
+ # The <tt>FSolver</tt> object require an instance of the
94
+ # {GSL::Function}[link:rdoc/function_rdoc.html] class, which is already introduced elsewhere.
95
95
  # The <tt>FdfSolver</tt> which uses the root-polishing algorithm requires not only
96
96
  # the function to solve, but also
97
97
  # procedures to calculate the derivatives. This is
@@ -103,7 +103,7 @@
103
103
  # * GSL::Function_fdf.alloc(f, df, fdf)
104
104
  #
105
105
  # Constructors. Here <tt>f, df</tt> are Ruby <tt>Proc</tt> objects which return a single value.
106
- # The option <tt>fdf</tt> must return an array which contain the values of the function
106
+ # The option <tt>fdf</tt> must return an array which contain the values of the function
107
107
  # and its derivative.
108
108
  #
109
109
  # ---
@@ -112,16 +112,16 @@
112
112
  #
113
113
  # This initializes or reinitializes the <tt>Function_fdf</tt> object <tt>self</tt> by
114
114
  # two or three <tt>Proc</tt> objects <tt>f, df</tt> and <tt>fdf</tt>.
115
- #
115
+ #
116
116
  # * ex: A quadratic equation a*x*x + b*x + c = 0:
117
117
  #
118
118
  # # Returns a value of the function
119
- # f = Proc.new { |x, params|
119
+ # f = Proc.new { |x, params|
120
120
  # a = params[0]; b = params[1]; c = params[2]
121
121
  # (a*x + b)*x + c
122
122
  # }
123
123
  # # Calculate the derivative
124
- # df = Proc.new { |x, params|
124
+ # df = Proc.new { |x, params|
125
125
  # a = params[0]; b = params[1]
126
126
  # 2*a*x + b
127
127
  # }
@@ -140,24 +140,24 @@
140
140
  # This sets or resets the constant parameters in the function.
141
141
  #
142
142
  # * Ex: x*x - 5 == 0
143
- #
143
+ #
144
144
  # function_fdf.set_params([1, 0, -5])
145
145
  #
146
- # === {}[link:index.html"name="2.3] Search Stopping Parameters
146
+ # === Search Stopping Parameters
147
147
  #
148
148
  # ---
149
149
  # * GSL::Root::test_interval(xl, xu, epsrel, epsabs)
150
150
  #
151
- # This function tests for the convergence of the interval
152
- # <tt>[xl, xu]</tt> with absolute error <tt>epsabs</tt> and relative error <tt>epsrel</tt>.
151
+ # This function tests for the convergence of the interval
152
+ # <tt>[xl, xu]</tt> with absolute error <tt>epsabs</tt> and relative error <tt>epsrel</tt>.
153
153
  # The test returns <tt>GSL::SUCCESS</tt> if the following condition is achieved,
154
- # |a - b| < epsabs + epsrel min(|a|,|b|)
155
- # when the interval x = [a,b] does not include the origin. If the interval includes
156
- # the origin then min(|a|,|b|) is replaced by zero (which is the minimum value of
157
- # |x| over the interval). This ensures that the relative error is accurately
154
+ # |a - b| < epsabs + epsrel min(|a|,|b|)
155
+ # when the interval x = [a,b] does not include the origin. If the interval includes
156
+ # the origin then min(|a|,|b|) is replaced by zero (which is the minimum value of
157
+ # |x| over the interval). This ensures that the relative error is accurately
158
158
  # estimated for roots close to the origin.
159
159
  #
160
- # This condition on the interval also implies that any estimate of the root r in
160
+ # This condition on the interval also implies that any estimate of the root r in
161
161
  # the interval satisfies the same condition with respect to the true root r0,
162
162
  #
163
163
  # |r - r0| < epsabs + epsrel r0
@@ -167,8 +167,8 @@
167
167
  # ---
168
168
  # * GSL::Root::test_delta(x1, x0, epsrel, epsabs)
169
169
  #
170
- # This function tests for the convergence of the sequence ..., <tt>x0, x1</tt> with
171
- # absolute error <tt>epsabs</tt> and relative error <tt>epsrel</tt>.
170
+ # This function tests for the convergence of the sequence ..., <tt>x0, x1</tt> with
171
+ # absolute error <tt>epsabs</tt> and relative error <tt>epsrel</tt>.
172
172
  # The test returns <tt>GSL::SUCCESS</tt> if the following condition is achieved,
173
173
  # |x_1 - x_0| < epsabs + epsrel |x_1|
174
174
  # and returns <tt>GSL::CONTINUE</tt> otherwise.
@@ -176,15 +176,15 @@
176
176
  # ---
177
177
  # * GSL::Root::test_residual(f, epsabs)
178
178
  #
179
- # This function tests the residual value <tt>f</tt> against the absolute error bound
180
- # <tt>epsabs</tt>. The test returns <tt>GSL::SUCCESS</tt> if the following condition is
179
+ # This function tests the residual value <tt>f</tt> against the absolute error bound
180
+ # <tt>epsabs</tt>. The test returns <tt>GSL::SUCCESS</tt> if the following condition is
181
181
  # achieved,
182
182
  # |f| < epsabs
183
- # and returns <tt>GSL::CONTINUE</tt> otherwise. This criterion is suitable for
184
- # situations where the precise location of the root, x, is unimportant provided a
183
+ # and returns <tt>GSL::CONTINUE</tt> otherwise. This criterion is suitable for
184
+ # situations where the precise location of the root, x, is unimportant provided a
185
185
  # value can be found where the residual, |f(x)|, is small enough.
186
186
  #
187
- # == {}[link:index.html"name="3] High-level interface
187
+ # == High-level interface
188
188
  # ---
189
189
  # * GSL::Root:FSolver.solve(func, [xl, xu], [epsabs = 0, epsrel = 1e-6])
190
190
  #
@@ -211,8 +211,8 @@
211
211
  # f = Function.alloc { |x| x*x - 5 }
212
212
  # f.fsolve([0, 5]) <----- 2.23606797749979
213
213
  #
214
- # == {}[link:index.html"name="4] Example
215
- # This example is equivalent to the one found in the GSL manual,
214
+ # == Example
215
+ # This example is equivalent to the one found in the GSL manual,
216
216
  # using the Brent's algorithm to solve the equation x^2 - 5 = 0.
217
217
  #
218
218
  # #!/usr/bin/env ruby
@@ -232,7 +232,7 @@
232
232
  # func.set_params([1, 0, -5])
233
233
  #
234
234
  # printf("%5s [%9s, %9s] %9s %10s %9s\n",
235
- # "iter", "lower", "upper", "root",
235
+ # "iter", "lower", "upper", "root",
236
236
  # "err", "err(est)")
237
237
  #
238
238
  # solver.set(func, 0.0, 5.0) # initialize the solver
@@ -252,18 +252,18 @@
252
252
  # i += 1
253
253
  # end while status != GSL::SUCCESS
254
254
  #
255
- # The following is an another version, using the <tt>FdfSolver</tt> with the Newton-Raphson
255
+ # The following is an another version, using the <tt>FdfSolver</tt> with the Newton-Raphson
256
256
  # algorithm.
257
257
  #
258
258
  # #!/usr/bin/env ruby
259
259
  # require "gsl"
260
260
  #
261
- # f = Proc.new { |x, params|
261
+ # f = Proc.new { |x, params|
262
262
  # a = params[0]; b = params[1]; c = params[2]
263
263
  # (a*x + b)*x + c
264
264
  # }
265
265
  #
266
- # df = Proc.new { |x, params|
266
+ # df = Proc.new { |x, params|
267
267
  # a = params[0]; b = params[1]
268
268
  # 2.0*a*x + b
269
269
  # }
@@ -288,7 +288,7 @@
288
288
  # x = solver.root
289
289
  #
290
290
  # status = Root::test_delta(x, x0, 0, 1e-3)
291
- #
291
+ #
292
292
  # if status == GSL::SUCCESS
293
293
  # printf("Converged:\n")
294
294
  # end
@@ -296,10 +296,10 @@
296
296
  # printf("%5d %10.7f %+10.7f %10.7f\n", iter, x, x - expected, x - x0)
297
297
  # end while status != GSL::SUCCESS
298
298
  #
299
- # {prev}[link:files/rdoc/dht_rdoc.html]
300
- # {next}[link:files/rdoc/min_rdoc.html]
299
+ # {prev}[link:rdoc/dht_rdoc.html]
300
+ # {next}[link:rdoc/min_rdoc.html]
301
301
  #
302
- # {Reference index}[link:files/rdoc/ref_rdoc.html]
303
- # {top}[link:files/rdoc/index_rdoc.html]
302
+ # {Reference index}[link:rdoc/ref_rdoc.html]
303
+ # {top}[link:index.html]
304
304
  #
305
305
  #