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,54 +1,54 @@
1
1
  #
2
2
  # = One dimensional Minimization
3
3
  #
4
- # This chapter describes routines for finding minima of arbitrary
4
+ # This chapter describes routines for finding minima of arbitrary
5
5
  # one-dimensional functions.
6
6
  #
7
7
  #
8
8
  # Contents:
9
- # 1. {Introduction}[link:files/rdoc/min_rdoc.html#1]
10
- # 1. {GSL::Min::FMinimizer class}[link:files/rdoc/min_rdoc.html#2]
11
- # 1. {Iteration}[link:files/rdoc/min_rdoc.html#3]
12
- # 1. {Stopping Parameters}[link:files/rdoc/min_rdoc.html#4]
13
- # 1. {Examples}[link:files/rdoc/min_rdoc.html#5]
9
+ # 1. {Introduction}[link:rdoc/min_rdoc.html#label-Introduction]
10
+ # 1. {GSL::Min::FMinimizer class}[link:rdoc/min_rdoc.html#label-Minimizer+class]
11
+ # 1. {Iteration}[link:rdoc/min_rdoc.html#label-Iteration]
12
+ # 1. {Stopping Parameters}[link:rdoc/min_rdoc.html#label-Stopping+Parameters]
13
+ # 1. {Examples}[link:rdoc/min_rdoc.html#label-Example]
14
14
  #
15
- # == {}[link:index.html"name="1] Introduction
15
+ # == Introduction
16
16
  #
17
- # The minimization algorithms begin with a bounded region known to contain
18
- # a minimum. The region is described by <tt>a</tt> lower bound a and an upper bound
17
+ # The minimization algorithms begin with a bounded region known to contain
18
+ # a minimum. The region is described by <tt>a</tt> lower bound a and an upper bound
19
19
  # <tt>b</tt>, with an estimate of the location of the minimum <tt>x</tt>.
20
20
  #
21
- # The value of the function at <tt>x</tt> must be less than the value of the
21
+ # The value of the function at <tt>x</tt> must be less than the value of the
22
22
  # function at the ends of the interval,
23
23
  # f(a) > f(x) < f(b)
24
- # This condition guarantees that a minimum is contained somewhere within the
24
+ # This condition guarantees that a minimum is contained somewhere within the
25
25
  # interval. On each iteration a new point <tt>x'</tt> is selected using one of the
26
- # available algorithms. If the new point is a better estimate of the minimum,
27
- # <tt>f(x') < f(x)</tt>, then the current estimate of the minimum <tt>x</tt> is
28
- # updated. The new point also allows the size of the bounded interval to be
29
- # reduced, by choosing the most compact set of points which satisfies the
30
- # constraint <tt>f(a) > f(x) < f(b)</tt>. The interval is reduced until it
31
- # encloses the true minimum to a desired tolerance. This provides a best
26
+ # available algorithms. If the new point is a better estimate of the minimum,
27
+ # <tt>f(x') < f(x)</tt>, then the current estimate of the minimum <tt>x</tt> is
28
+ # updated. The new point also allows the size of the bounded interval to be
29
+ # reduced, by choosing the most compact set of points which satisfies the
30
+ # constraint <tt>f(a) > f(x) < f(b)</tt>. The interval is reduced until it
31
+ # encloses the true minimum to a desired tolerance. This provides a best
32
32
  # estimate of the location of the minimum and a rigorous error estimate.
33
33
  #
34
- # Several bracketing algorithms are available within a single framework.
35
- # The user provides a high-level driver for the algorithm, and the library
36
- # provides the individual functions necessary for each of the steps. There
34
+ # Several bracketing algorithms are available within a single framework.
35
+ # The user provides a high-level driver for the algorithm, and the library
36
+ # provides the individual functions necessary for each of the steps. There
37
37
  # are three main phases of the iteration. The steps are,
38
38
  # * initialize minimizer (or <tt>solver</tt>) state, <tt>s</tt>, for algorithm <tt>T</tt>
39
39
  # * update <tt>s</tt> using the iteration <tt>T</tt>
40
40
  # * test <tt>s</tt> for convergence, and repeat iteration if necessary
41
41
  #
42
- # The state of the minimizers is held in a <tt>GSL::Min::FMinimizer</tt> object.
42
+ # The state of the minimizers is held in a <tt>GSL::Min::FMinimizer</tt> object.
43
43
  # The updating procedure use only function evaluations (not derivatives).
44
- # The function to minimize is given as an instance of the {GSL::Function}[link:files/rdoc/function_rdoc.html] class to the minimizer.
44
+ # The function to minimize is given as an instance of the {GSL::Function}[link:rdoc/function_rdoc.html] class to the minimizer.
45
45
  #
46
46
  #
47
- # == {}[link:index.html"name="2] GSL::Min::FMinimizer class
47
+ # == FMinimizer class
48
48
  # ---
49
49
  # * GSL::Min::FMinimizer.alloc(t)
50
50
  #
51
- # These method create an instance of the <tt>GSL::Min::FMinimizer</tt> class of
51
+ # These method create an instance of the <tt>GSL::Min::FMinimizer</tt> class of
52
52
  # type <tt>t</tt>. The type <tt>t</tt> is given by a String,
53
53
  # * "goldensection"
54
54
  # * "brent"
@@ -65,52 +65,52 @@
65
65
  # ---
66
66
  # * GSL::Min::FMinimizer#set(f, xmin, xlow, xup)
67
67
  #
68
- # This method sets, or resets, an existing minimizer <tt>self</tt> to use
68
+ # This method sets, or resets, an existing minimizer <tt>self</tt> to use
69
69
  # the function <tt>f</tt> (given by a <tt>GSL::Function</tt>
70
- # object) and the initial search interval [<tt>xlow, xup</tt>],
70
+ # object) and the initial search interval [<tt>xlow, xup</tt>],
71
71
  # with a guess for the location of the minimum <tt>xmin</tt>.
72
72
  #
73
- # If the interval given does not contain a minimum, then the
73
+ # If the interval given does not contain a minimum, then the
74
74
  # method returns an error code of <tt>GSL::FAILURE</tt>.
75
75
  #
76
76
  # ---
77
77
  # * GSL::Min::FMinimizer#set_with_values(f, xmin, fmin, xlow, flow, xup, fup)
78
78
  #
79
- # This method is equivalent to <tt>Fminimizer#set</tt> but uses the values
80
- # <tt>fmin, flowe</tt> and <tt>fup</tt> instead of computing
79
+ # This method is equivalent to <tt>Fminimizer#set</tt> but uses the values
80
+ # <tt>fmin, flowe</tt> and <tt>fup</tt> instead of computing
81
81
  # <tt>f(xmin), f(xlow)</tt> and <tt>f(xup)</tt>.
82
82
  #
83
83
  # ---
84
84
  # * GSL::Min::FMinimizer#name
85
85
  #
86
- # This returns the name of the minimizer.
86
+ # This returns the name of the minimizer.
87
87
  #
88
- # == {}[link:index.html"name="3] Iteration
88
+ # == Iteration
89
89
  # ---
90
90
  # * GSL::Min::FMinimizer#iterate
91
91
  #
92
- # This method performs a single iteration of the minimizer <tt>self</tt>.
93
- # If the iteration encounters an unexpected problem then an error code
92
+ # This method performs a single iteration of the minimizer <tt>self</tt>.
93
+ # If the iteration encounters an unexpected problem then an error code
94
94
  # will be returned,
95
- # * <tt>GSL::EBADFUNC</tt>: the iteration encountered a singular point where the
95
+ # * <tt>GSL::EBADFUNC</tt>: the iteration encountered a singular point where the
96
96
  # function evaluated to <tt>Inf</tt> or <tt>NaN</tt>.
97
- # * <tt>GSL::FAILURE</tt>: the algorithm could not improve the current best
97
+ # * <tt>GSL::FAILURE</tt>: the algorithm could not improve the current best
98
98
  # approximation or bounding interval.
99
- # The minimizer maintains a current best estimate of the position of
100
- # the minimum at all times, and the current interval bounding the minimum.
99
+ # The minimizer maintains a current best estimate of the position of
100
+ # the minimum at all times, and the current interval bounding the minimum.
101
101
  # This information can be accessed with the following auxiliary methods
102
102
  #
103
103
  # ---
104
104
  # * GSL::Min::FMinimizer#x_minimum
105
105
  #
106
- # Returns the current estimate of the position of the minimum
106
+ # Returns the current estimate of the position of the minimum
107
107
  # for the minimizer <tt>self</tt>.
108
108
  #
109
109
  # ---
110
110
  # * GSL::Min::FMinimizer#x_upper
111
111
  # * GSL::Min::FMinimizer#x_lower
112
112
  #
113
- # Return the current upper and lower bound of the interval for the
113
+ # Return the current upper and lower bound of the interval for the
114
114
  # minimizer <tt>self</tt>.
115
115
  #
116
116
  # ---
@@ -118,33 +118,33 @@
118
118
  # * GSL::Min::FMinimizer#f_upper
119
119
  # * GSL::Min::FMinimizer#f_lower
120
120
  #
121
- # Return the value of the function at the current estimate of the
122
- # minimum and at the upper and lower bounds of interval
121
+ # Return the value of the function at the current estimate of the
122
+ # minimum and at the upper and lower bounds of interval
123
123
  # for the minimizer <tt>self</tt>.
124
124
  #
125
- # == {}[link:index.html"name="4] Stopping Parameters
125
+ # == Stopping Parameters
126
126
  # ---
127
127
  # * GSL::Min::FMinimizer#test_interval(epsabs, epsrel)
128
128
  # * GSL::Min.test_interval(xlow, xup, epsabs, epsrel)
129
129
  #
130
- # These methoeds test for the convergence of the interval
131
- # [<tt>xlow, xup</tt>] with absolute error <tt>epsabs</tt> and relative
132
- # error <tt>epsrel</tt>. The test returns <tt>GSL::SUCCESS</tt>
130
+ # These methoeds test for the convergence of the interval
131
+ # [<tt>xlow, xup</tt>] with absolute error <tt>epsabs</tt> and relative
132
+ # error <tt>epsrel</tt>. The test returns <tt>GSL::SUCCESS</tt>
133
133
  # if the following condition is achieved,
134
- # |a - b| < epsabs + epsrel min(|a|,|b|)
135
- # when the interval <tt>x = [a,b]</tt> does not include the origin.
136
- # If the interval includes the origin then <tt>min(|a|,|b|)</tt> is
137
- # replaced by zero (which is the minimum value of |x| over the interval).
138
- # This ensures that the relative error is accurately estimated for minima
134
+ # |a - b| < epsabs + epsrel min(|a|,|b|)
135
+ # when the interval <tt>x = [a,b]</tt> does not include the origin.
136
+ # If the interval includes the origin then <tt>min(|a|,|b|)</tt> is
137
+ # replaced by zero (which is the minimum value of |x| over the interval).
138
+ # This ensures that the relative error is accurately estimated for minima
139
139
  # close to the origin.
140
140
  #
141
- # This condition on the interval also implies that any estimate of the
142
- # minimum x_m in the interval satisfies the same condition with respect
141
+ # This condition on the interval also implies that any estimate of the
142
+ # minimum x_m in the interval satisfies the same condition with respect
143
143
  # to the true minimum x_m^*,
144
144
  # |x_m - x_m^*| < epsabs + epsrel x_m^*
145
145
  # assuming that the true minimum x_m^* is contained within the interval.
146
146
  #
147
- # == {}[link:index.html"name="5] Example
147
+ # == Example
148
148
  # To find the minimum of the function f(x) = cos(x) + 1.0:
149
149
  #
150
150
  # #!/usr/bin/env ruby
@@ -180,10 +180,10 @@
180
180
  # iter, a, b, m, m - m_expected, b - a);
181
181
  # end while status == GSL::CONTINUE and iter < max_iter
182
182
  #
183
- # {prev}[link:files/rdoc/roots_rdoc.html]
184
- # {next}[link:files/rdoc/multiroot_rdoc.html]
183
+ # {prev}[link:rdoc/roots_rdoc.html]
184
+ # {next}[link:rdoc/multiroot_rdoc.html]
185
185
  #
186
- # {Reference index}[link:files/rdoc/ref_rdoc.html]
187
- # {top}[link:files/rdoc/index_rdoc.html]
186
+ # {Reference index}[link:rdoc/ref_rdoc.html]
187
+ # {top}[link:index.html]
188
188
  #
189
189
  #
@@ -1,7 +1,7 @@
1
1
  #
2
2
  # = Monte Carlo Integration
3
3
  #
4
- # == {}[link:index.html"name="1] The GSL::Monte::Function class
4
+ # == The Function class
5
5
  # The function to be integrated has its own datatype, the <tt>GSL::Monte::Function</tt> class.
6
6
  #
7
7
  # ---
@@ -18,7 +18,7 @@
18
18
  # }
19
19
  # dim = 2
20
20
  # mf = Monte::Function.alloc(proc_f, dim)
21
- # mf.set_params([3, 2, 1])
21
+ # mf.set_params([3, 2, 1])
22
22
  #
23
23
  # ---
24
24
  # * GSL::Munte::Function#set(proc, dim, params)
@@ -32,34 +32,34 @@
32
32
  # * GSL::Munte::Function#call
33
33
  #
34
34
  #
35
- # == {}[link:index.html"name="2] Monte Carlo plans, alrgorithms
36
- # === {}[link:index.html"name="2.1] PLAIN Monte Carlo
35
+ # == Monte Carlo plans, alrgorithms
36
+ # === PLAIN Monte Carlo
37
37
  # ---
38
38
  # * GSL::Monte::Plain.alloc(dim)
39
39
  # * GSL::Monte::Plain#init
40
40
  #
41
- # === {}[link:index.html"name="2.2] Miser
41
+ # === Miser
42
42
  # ---
43
43
  # * GSL::Monte::Miser.alloc(dim)
44
44
  # * GSL::Monte::Miser#init
45
45
  #
46
- # === {}[link:index.html"name="2.3] Vegas
46
+ # === Vegas
47
47
  # ---
48
48
  # * GSL::Monte::Vegas.alloc(dim)
49
49
  # * GSL::Monte::Vegas#init
50
50
  #
51
51
  #
52
- # == {}[link:index.html"name="3] Integration
52
+ # == Integration
53
53
  # ---
54
54
  # * GSL:Monte::Function#integrate(xl, xu, dim, calls, rng, s)
55
55
  # * GSL:Monte::Function#integrate(xl, xu, dim, calls, s)
56
56
  # * GSL:Monte::Function#integrate(xl, xu, calls, rng, s)
57
57
  # * GSL:Monte::Function#integrate(xl, xu, calls, s)
58
58
  #
59
- # This method performs Monte-Carlo integration of the function <tt>self</tt>
60
- # using the algorithm <tt>s</tt>, over the <tt>dim</tt>-dimensional hypercubic
61
- # region defined by the lower and upper
62
- # limits in the arrays <tt>xl</tt> and <tt>xu</tt>, each of size <tt>dim</tt>.
59
+ # This method performs Monte-Carlo integration of the function <tt>self</tt>
60
+ # using the algorithm <tt>s</tt>, over the <tt>dim</tt>-dimensional hypercubic
61
+ # region defined by the lower and upper
62
+ # limits in the arrays <tt>xl</tt> and <tt>xu</tt>, each of size <tt>dim</tt>.
63
63
  # The integration uses a fixed number of function calls <tt>calls</tt>.
64
64
  # The argument <tt>rng</tt> is a random number generator (optional). If it is not
65
65
  # given, a new generator is created internally and freed when the calculation
@@ -67,7 +67,7 @@
67
67
  #
68
68
  # See sample scripts <tt>sample/monte*.rb</tt> for more details.
69
69
  #
70
- # == {}[link:index.html"name="4] Accessing internal state of the Monte Carlo classes
70
+ # == Accessing internal state of the Monte Carlo classes
71
71
  # ---
72
72
  # * GSL::Monte::Miser#estimate_frac
73
73
  # * GSL::Monte::Miser#estimate_frac=
@@ -102,7 +102,7 @@
102
102
  # * GSL::Monte::Vegas#verbose=
103
103
  #
104
104
  #
105
- # == {}[link:index.html"name="5] Miser Parameters (GSL-1.13 or later)
105
+ # == Miser Parameters (GSL-1.13 or later)
106
106
  # ---
107
107
  # * GSL::Monte::Miser#params_get
108
108
  #
@@ -111,7 +111,7 @@
111
111
  # * GSL::Monte::Miser#params_set(params)
112
112
  #
113
113
  # Sets the integrator parameters based on values provided in an object of the <tt>GSL::Monte::Miser::Params</tt> class <tt>params</tt>.
114
- # === {}[link:index.html"name="5.1] Accessors of <tt>GSL::Monte::Miser::Params</tt>
114
+ # === Accessors of Miser <tt>Params</tt>
115
115
  # ---
116
116
  # * GSL::Monte::Miser::Params#estimate_frac
117
117
  # * GSL::Monte::Miser::Params#estimate_frac=
@@ -138,7 +138,7 @@
138
138
  #
139
139
  # This parameter introduces a random fractional variation of size dither into each bisection, which can be used to break the symmetry of integrands which are concentrated near the exact center of the hypercubic integration region. The default value of dither is zero, so no variation is introduced. If needed, a typical value of dither is 0.1.
140
140
  #
141
- # == {}[link:index.html"name="6] Vegas Parameters (GSL-1.13 or later)
141
+ # == Vegas Parameters (GSL-1.13 or later)
142
142
  # ---
143
143
  # * GSL::Monte::Vegas#params_get
144
144
  #
@@ -148,7 +148,7 @@
148
148
  #
149
149
  # Sets the integrator parameters based on values provided in an object of the <tt>GSL::Monte::Vegas::Params</tt> class <tt>params</tt>.
150
150
  #
151
- # === {}[link:index.html"name="6.1] Accessors of <tt>GSL::Monte::Vegas::Params</tt>
151
+ # === Accessors of Vegas <tt>Params</tt>
152
152
  # ---
153
153
  # * GSL::Monte::Vegas::Params#alpha
154
154
  # * GSL::Monte::Vegas::Params#alpha=
@@ -175,7 +175,7 @@
175
175
  #
176
176
  # Set the level of information printed by VEGAS. All information is written to the stream ostream. The default setting of verbose is -1, which turns off all output. A verbose value of 0 prints summary information about the weighted average and final result, while a value of 1 also displays the grid coordinates. A value of 2 prints information from the rebinning procedure for each iteration.
177
177
  #
178
- # == {}[link:index.html"name="7] Example
178
+ # == Example
179
179
  #
180
180
  # #!/usr/bin/env ruby
181
181
  # require("gsl")
@@ -220,15 +220,15 @@
220
220
  # puts("converging...");
221
221
  # begin
222
222
  # result, error = G.integrate(xl, xu, dim, calls/5, r, vegas)
223
- # printf("result = % .6f sigma = % .6f chisq/dof = %.1f\n",
223
+ # printf("result = % .6f sigma = % .6f chisq/dof = %.1f\n",
224
224
  # result, error, vegas.chisq)
225
225
  # end while (vegas.chisq-1.0).abs > 0.5
226
226
  # display_results("vegas final", result, error)
227
227
  #
228
- # {prev}[link:files/rdoc/ntuple_rdoc.html]
229
- # {next}[link:files/rdoc/siman_rdoc.html]
228
+ # {prev}[link:rdoc/ntuple_rdoc.html]
229
+ # {next}[link:rdoc/siman_rdoc.html]
230
230
  #
231
- # {Reference index}[link:files/rdoc/ref_rdoc.html]
232
- # {top}[link:files/rdoc/index_rdoc.html]
231
+ # {Reference index}[link:rdoc/ref_rdoc.html]
232
+ # {top}[link:index.html]
233
233
  #
234
234
  #
@@ -1,78 +1,78 @@
1
1
  #
2
2
  # = Multidimensional Minimization
3
- # This chapter describes routines for finding minima of arbitrary
4
- # multidimensional functions. The library provides low level components for a
5
- # variety of iterative minimizers and convergence tests. These can be combined
6
- # by the user to achieve the desired solution, while providing full access to
7
- # the intermediate steps of the algorithms. Each class of methods uses the
8
- # same framework, so that you can switch between minimizers at runtime without
9
- # needing to recompile your program. Each instance of a minimizer keeps track
10
- # of its own state, allowing the minimizers to be used in multi-threaded
11
- # programs.
3
+ # This chapter describes routines for finding minima of arbitrary
4
+ # multidimensional functions. The library provides low level components for a
5
+ # variety of iterative minimizers and convergence tests. These can be combined
6
+ # by the user to achieve the desired solution, while providing full access to
7
+ # the intermediate steps of the algorithms. Each class of methods uses the
8
+ # same framework, so that you can switch between minimizers at runtime without
9
+ # needing to recompile your program. Each instance of a minimizer keeps track
10
+ # of its own state, allowing the minimizers to be used in multi-threaded
11
+ # programs.
12
12
  #
13
13
  # Contents:
14
- # 1. {Overview}[link:files/rdoc/multimin_rdoc.html#1]
15
- # 1. {Caveats}[link:files/rdoc/multimin_rdoc.html#2]
16
- # 1. {Initializing the Multidimensional Minimizer}[link:files/rdoc/multimin_rdoc.html#3]
17
- # 1. {Providing a function to minimize}[link:files/rdoc/multimin_rdoc.html#4]
18
- # 1. {Iteration}[link:files/rdoc/multimin_rdoc.html#5]
19
- # 1. {Stopping Criteria}[link:files/rdoc/multimin_rdoc.html#6]
20
- # 1. {Examples}[link:files/rdoc/multimin_rdoc.html#7]
21
- # 1. {FdfMinimizer}[link:files/rdoc/multimin_rdoc.html#7.1]
22
- # 1. {FMinimizer}[link:files/rdoc/multimin_rdoc.html#7.2]
23
- #
24
- # == {}[link:index.html"name="1] Overview
25
- # The problem of multidimensional minimization requires finding a point x such
26
- # that the scalar function, takes a value which is lower than at any neighboring
27
- # point. For smooth functions the gradient g = \nabla f vanishes at the minimum.
28
- # In general there are no bracketing methods available for the minimization of
29
- # n-dimensional functions. The algorithms proceed from an initial guess using a
30
- # search algorithm which attempts to move in a downhill direction.
31
- #
32
- # Algorithms making use of the gradient of the function perform a
33
- # one-dimensional line minimisation along this direction until the lowest point
34
- # is found to a suitable tolerance. The search direction is then updated with
35
- # local information from the function and its derivatives, and the whole process
36
- # repeated until the true n-dimensional minimum is found.
37
- #
38
- # The Nelder-Mead Simplex algorithm applies a different strategy. It maintains
39
- # n+1 trial parameter vectors as the vertices of a n-dimensional simplex.
40
- # In each iteration step it tries to improve the worst vertex by a simple
41
- # geometrical transformation until the size of the simplex falls below a given
42
- # tolerance.
43
- #
44
- # Both types of algorithms use a standard framework. The user provides a
45
- # high-level driver for the algorithms, and the library provides the individual
46
- # functions necessary for each of the steps. There are three main phases of the
47
- # iteration. The steps are,
48
- #
49
- # * initialize minimizer state, s, for algorithm T
50
- # * update s using the iteration T
51
- # * test s for convergence, and repeat iteration if necessary
52
- #
53
- # Each iteration step consists either of an improvement to the line-minimisation
54
- # in the current direction or an update to the search direction itself. The
55
- # state for the minimizers is held in a <tt>GSL::MultiMin::FdfMinimizer</tt> or
14
+ # 1. {Overview}[link:rdoc/multimin_rdoc.html#label-Overview]
15
+ # 1. {Caveats}[link:rdoc/multimin_rdoc.html#label-Caveats]
16
+ # 1. {Initializing the Multidimensional Minimizer}[link:rdoc/multimin_rdoc.html#label-Initializing+the+Multidimensional+Minimizer]
17
+ # 1. {Providing a function to minimize}[link:rdoc/multimin_rdoc.html#label-Providing+a+function+to+minimize]
18
+ # 1. {Iteration}[link:rdoc/multimin_rdoc.html#label-Iteration]
19
+ # 1. {Stopping Criteria}[link:rdoc/multimin_rdoc.html#label-Stopping+Criteria]
20
+ # 1. {Examples}[link:rdoc/multimin_rdoc.html#label-Examples]
21
+ # 1. {FdfMinimizer}[link:rdoc/multimin_rdoc.html#label-FdfMinimizer]
22
+ # 1. {FMinimizer}[link:rdoc/multimin_rdoc.html#label-FMinimizer]
23
+ #
24
+ # == Overview
25
+ # The problem of multidimensional minimization requires finding a point x such
26
+ # that the scalar function, takes a value which is lower than at any neighboring
27
+ # point. For smooth functions the gradient g = \nabla f vanishes at the minimum.
28
+ # In general there are no bracketing methods available for the minimization of
29
+ # n-dimensional functions. The algorithms proceed from an initial guess using a
30
+ # search algorithm which attempts to move in a downhill direction.
31
+ #
32
+ # Algorithms making use of the gradient of the function perform a
33
+ # one-dimensional line minimisation along this direction until the lowest point
34
+ # is found to a suitable tolerance. The search direction is then updated with
35
+ # local information from the function and its derivatives, and the whole process
36
+ # repeated until the true n-dimensional minimum is found.
37
+ #
38
+ # The Nelder-Mead Simplex algorithm applies a different strategy. It maintains
39
+ # n+1 trial parameter vectors as the vertices of a n-dimensional simplex.
40
+ # In each iteration step it tries to improve the worst vertex by a simple
41
+ # geometrical transformation until the size of the simplex falls below a given
42
+ # tolerance.
43
+ #
44
+ # Both types of algorithms use a standard framework. The user provides a
45
+ # high-level driver for the algorithms, and the library provides the individual
46
+ # functions necessary for each of the steps. There are three main phases of the
47
+ # iteration. The steps are,
48
+ #
49
+ # * initialize minimizer state, s, for algorithm T
50
+ # * update s using the iteration T
51
+ # * test s for convergence, and repeat iteration if necessary
52
+ #
53
+ # Each iteration step consists either of an improvement to the line-minimisation
54
+ # in the current direction or an update to the search direction itself. The
55
+ # state for the minimizers is held in a <tt>GSL::MultiMin::FdfMinimizer</tt> or
56
56
  # a <tt>GSL::MultiMin::FMinimizer</tt> object.
57
57
  #
58
- # == {}[link:index.html"name="2] Caveats
59
- # Note that the minimization algorithms can only search for one local minimum
60
- # at a time. When there are several local minima in the search area, the first
61
- # minimum to be found will be returned; however it is difficult to predict which
62
- # of the minima this will be. In most cases, no error will be reported if you
63
- # try to find a local minimum in an area where there is more than one.
58
+ # == Caveats
59
+ # Note that the minimization algorithms can only search for one local minimum
60
+ # at a time. When there are several local minima in the search area, the first
61
+ # minimum to be found will be returned; however it is difficult to predict which
62
+ # of the minima this will be. In most cases, no error will be reported if you
63
+ # try to find a local minimum in an area where there is more than one.
64
64
  #
65
- # It is also important to note that the minimization algorithms find local
66
- # minima; there is no way to determine whether a minimum is a global minimum of
67
- # the function in question.
65
+ # It is also important to note that the minimization algorithms find local
66
+ # minima; there is no way to determine whether a minimum is a global minimum of
67
+ # the function in question.
68
68
  #
69
69
  #
70
- # == {}[link:index.html"name="3] Initializing the Multidimensional Minimizer
70
+ # == Initializing the Multidimensional Minimizer
71
71
  # ---
72
72
  # * GSL::MultiMin::FdfMinimizer.alloc(type, n)
73
73
  # * GSL::MultiMin::FMinimizer.alloc(type, n)
74
74
  #
75
- # These method create a minimizer of type <tt>type</tt> for an <tt>n</tt>-dimension function.
75
+ # These method create a minimizer of type <tt>type</tt> for an <tt>n</tt>-dimension function.
76
76
  # The type is given by a string, or by a Ruby constant.
77
77
  #
78
78
  # * <tt>GSL::MultiMin::FdfMinimizer::CONJUGATE_FR</tt> or <tt>"conjugate_fr"</tt>
@@ -93,17 +93,17 @@
93
93
  # ---
94
94
  # * GSL::MultiMin::FdfMinimizer#set(func, x, step_size, tol)
95
95
  #
96
- # This method initializes the minimizer <tt>self</tt> to minimize the function
97
- # <tt>fdf</tt> (the <tt>GSL::MultiMin::Function_fdf</tt> class, see below) starting from
98
- # the initial point <tt>x</tt> (<tt>GSL::Vector</tt>). The size of the first trial step is
99
- # given by <tt>step_size</tt> (<tt>Vector</tt>). The accuracy of the line minimization is
96
+ # This method initializes the minimizer <tt>self</tt> to minimize the function
97
+ # <tt>fdf</tt> (the <tt>GSL::MultiMin::Function_fdf</tt> class, see below) starting from
98
+ # the initial point <tt>x</tt> (<tt>GSL::Vector</tt>). The size of the first trial step is
99
+ # given by <tt>step_size</tt> (<tt>Vector</tt>). The accuracy of the line minimization is
100
100
  # specified by <tt>tol</tt>.
101
101
  #
102
102
  # ---
103
103
  # * GSL::MultiMin::FMinimizer#set(func, x, step_size)
104
104
  #
105
- # This method initializes the minimizer <tt>self</tt> to minimize the function <tt>func</tt>,
106
- # starting from the initial point <tt>x</tt> (Vector). The size of the initial trial steps
105
+ # This method initializes the minimizer <tt>self</tt> to minimize the function <tt>func</tt>,
106
+ # starting from the initial point <tt>x</tt> (Vector). The size of the initial trial steps
107
107
  # is given in vector <tt>step_size</tt>.
108
108
  #
109
109
  # ---
@@ -112,10 +112,10 @@
112
112
  #
113
113
  # These return the name of the minimizer <tt>self</tt>.
114
114
  #
115
- # == {}[link:index.html"name="4] Providing a function to minimize
116
- # You must provide a parametric function of <tt>n</tt> variables for the minimizers to
117
- # operate on. You may also need to provide a routine which calculates the gradient of the
118
- # function. In order to allow for general parameters the functions are defined by the
115
+ # == Providing a function to minimize
116
+ # You must provide a parametric function of <tt>n</tt> variables for the minimizers to
117
+ # operate on. You may also need to provide a routine which calculates the gradient of the
118
+ # function. In order to allow for general parameters the functions are defined by the
119
119
  # classes, <tt>GSL::MultiMin::Function_fdf</tt> and <tt>GSL::MultiMin::Function</tt>.
120
120
  #
121
121
  # ---
@@ -166,14 +166,14 @@
166
166
  # my_func = Function.alloc(my_f, np)
167
167
  # my_func.set_params([1.0, 2.0]) # parameters
168
168
  #
169
- # == {}[link:index.html"name="5] Iteration
169
+ # == Iteration
170
170
  # ---
171
171
  # * GSL::MultiMin::FdfMinimizer#iterate
172
172
  # * GSL::MultiMin::FMinimizer#iterate
173
173
  #
174
- # These methods perform a single iteration of the minimizer <tt>self</tt>.
174
+ # These methods perform a single iteration of the minimizer <tt>self</tt>.
175
175
  # If the iteration encounters an unexpected problem then an error code will be returned.
176
- # The minimizer maintains a current best estimate of the minimum at all times.
176
+ # The minimizer maintains a current best estimate of the minimum at all times.
177
177
  # This information can be accessed with the following methods,
178
178
  #
179
179
  # ---
@@ -184,48 +184,48 @@
184
184
  # * GSL::MultiMin::FMinimizer#minimum
185
185
  # * GSL::MultiMin::FMinimizer#size
186
186
  #
187
- # These method return the current best estimate of the location of the minimum,
188
- # the value of the function at that point, its gradient, and minimizer specific
187
+ # These method return the current best estimate of the location of the minimum,
188
+ # the value of the function at that point, its gradient, and minimizer specific
189
189
  # characteristic size for the minimizer <tt>self</tt>.
190
190
  #
191
191
  # ---
192
192
  # * GSL::MultiMin::FdfMinimizer#restart
193
193
  #
194
- # This method resets the minimizer <tt>self</tt> to use the current point as a new
194
+ # This method resets the minimizer <tt>self</tt> to use the current point as a new
195
195
  # starting point.
196
196
  #
197
- # == {}[link:index.html"name="6] Stopping Criteria
197
+ # == Stopping Criteria
198
198
  # A minimization procedure should stop when one of the following conditions is true:
199
199
  # * A minimum has been found to within the user-specified precision.
200
200
  # * A user-specified maximum number of iterations has been reached.
201
201
  # * An error has occurred.
202
- # The handling of these conditions is under user control. The methods below allow the
202
+ # The handling of these conditions is under user control. The methods below allow the
203
203
  # user to test the precision of the current result.
204
204
  #
205
205
  # ---
206
206
  # * GSL::MultiMin::FdfMinimizer#test_gradient(epsabs)
207
207
  # * GSL::MultiMin::FdfMinimizer.test_gradient(g, epsabs)
208
208
  #
209
- # These method test the norm of the gradient <tt>g</tt> against the absolute tolerance
210
- # <tt>epsabs</tt>. The gradient of a multidimensional function goes to zero at a minimum.
209
+ # These method test the norm of the gradient <tt>g</tt> against the absolute tolerance
210
+ # <tt>epsabs</tt>. The gradient of a multidimensional function goes to zero at a minimum.
211
211
  # The tests return <tt>GSL::SUCCESS</tt> if the following condition is achieved,
212
212
  # |g| < epsabs
213
- # and returns <tt>GSL::CONTINUE</tt> otherwise. A suitable choice of <tt>epsabs</tt> can
214
- # be made from the desired accuracy in the function for small variations in <tt>x</tt>.
213
+ # and returns <tt>GSL::CONTINUE</tt> otherwise. A suitable choice of <tt>epsabs</tt> can
214
+ # be made from the desired accuracy in the function for small variations in <tt>x</tt>.
215
215
  # The relationship between these quantities is given by <tt>\delta f = g \delta x</tt>.
216
216
  #
217
217
  # ---
218
218
  # * GSL::MultiMin::FdfMinimizer#test_size(epsabs)
219
219
  # * GSL::MultiMin::FdfMinimizer.test_size(size, epsabs)
220
220
  #
221
- # These method test the minimizer specific characteristic <tt>size</tt>
222
- # (if applicable to the used minimizer) against absolute tolerance <tt>epsabs</tt>.
223
- # The tests return (<tt>GSL::SUCCESS</tt> if the size is smaller than tolerance,
221
+ # These method test the minimizer specific characteristic <tt>size</tt>
222
+ # (if applicable to the used minimizer) against absolute tolerance <tt>epsabs</tt>.
223
+ # The tests return (<tt>GSL::SUCCESS</tt> if the size is smaller than tolerance,
224
224
  # otherwise <tt>GSL::CONTINUE</tt> is returned.
225
225
  #
226
- # == {}[link:index.html"name="7] Examples
226
+ # == Examples
227
227
  #
228
- # === {}[link:index.html"name="7.1] FdfMinimizer
228
+ # === FdfMinimizer
229
229
  # #!/usr/bin/env ruby
230
230
  # require("gsl")
231
231
  # include GSL::MultiMin
@@ -264,13 +264,13 @@
264
264
  # printf("%5d %.5f %.5f %10.5f\n", iter, x[0], x[1], f)
265
265
  # end while status == GSL::CONTINUE and iter < 100
266
266
  #
267
- # === {}[link:index.html"name="7.2] FMinimizer
267
+ # === FMinimizer
268
268
  # #!/usr/bin/env ruby
269
269
  # require("gsl")
270
270
  # include GSL::MultiMin
271
271
  #
272
272
  # np = 2
273
- #
273
+ #
274
274
  # my_f = Proc.new { |v, params|
275
275
  # x = v[0]; y = v[1]
276
276
  # p0 = params[0]; p1 = params[1]
@@ -303,10 +303,10 @@
303
303
  # printf("f() = %7.3f size = %.3f\n", minimizer.fval, minimizer.size);
304
304
  # end while status == GSL::CONTINUE and iter < 100
305
305
  #
306
- # {prev}[link:files/rdoc/multiroot_rdoc.html]
307
- # {next}[link:files/rdoc/fit_rdoc.html]
306
+ # {prev}[link:rdoc/multiroot_rdoc.html]
307
+ # {next}[link:rdoc/fit_rdoc.html]
308
308
  #
309
- # {Reference index}[link:files/rdoc/ref_rdoc.html]
310
- # {top}[link:files/rdoc/index_rdoc.html]
309
+ # {Reference index}[link:rdoc/ref_rdoc.html]
310
+ # {top}[link:index.html]
311
311
  #
312
312
  #