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.
- checksums.yaml +7 -0
- data/.gitignore +12 -0
- data/.travis.yml +24 -0
- data/AUTHORS +10 -2
- data/COPYING +341 -339
- data/ChangeLog +612 -554
- data/Gemfile +4 -0
- data/README.md +77 -0
- data/Rakefile +14 -93
- data/THANKS +1 -1
- data/examples/blas/blas.rb +1 -1
- data/examples/bspline.rb +3 -3
- data/examples/complex/functions.rb +4 -4
- data/examples/complex/mul.rb +1 -1
- data/examples/const/physconst.rb +4 -4
- data/examples/const/travel.rb +4 -4
- data/examples/eigen/nonsymmv.rb +1 -1
- data/examples/eigen/qhoscillator.rb +3 -3
- data/examples/fft/radix2.rb +1 -1
- data/examples/fft/real-halfcomplex.rb +3 -3
- data/examples/fft/real-halfcomplex2.rb +3 -3
- data/examples/fit/expfit.rb +1 -1
- data/examples/fit/multifit.rb +1 -1
- data/examples/fit/ndlinear.rb +44 -44
- data/examples/fit/nonlinearfit.rb +1 -1
- data/examples/fit/wlinear.rb +3 -3
- data/examples/function/function.rb +1 -1
- data/examples/function/min.rb +1 -1
- data/examples/function/synchrotron.rb +2 -2
- data/examples/gallery/koch.rb +1 -1
- data/examples/histogram/cauchy.rb +2 -2
- data/examples/histogram/exponential.rb +1 -1
- data/examples/histogram/histo3d.rb +1 -1
- data/examples/histogram/histogram-pdf.rb +2 -2
- data/examples/histogram/xexp.rb +1 -1
- data/examples/integration/ahmed.rb +2 -2
- data/examples/integration/cosmology.rb +7 -7
- data/examples/integration/friedmann.rb +4 -4
- data/examples/integration/qng.rb +1 -1
- data/examples/interp/demo.rb +2 -2
- data/examples/linalg/LQ_solve.rb +1 -1
- data/examples/linalg/LU.rb +1 -1
- data/examples/linalg/LU2.rb +1 -1
- data/examples/linalg/LU_narray.rb +1 -1
- data/examples/linalg/PTLQ.rb +1 -1
- data/examples/linalg/QRPT.rb +1 -1
- data/examples/linalg/chol.rb +1 -1
- data/examples/linalg/chol_narray.rb +1 -1
- data/examples/linalg/complex.rb +1 -1
- data/examples/math/elementary.rb +1 -1
- data/examples/math/functions.rb +1 -1
- data/examples/math/inf_nan.rb +1 -1
- data/examples/math/minmax.rb +1 -1
- data/examples/math/power.rb +1 -1
- data/examples/math/test.rb +1 -1
- data/examples/min.rb +1 -1
- data/examples/multimin/bundle.rb +1 -1
- data/examples/multimin/cqp.rb +17 -17
- data/examples/multiroot/fsolver3.rb +1 -1
- data/examples/odeiv/binarysystem.rb +12 -12
- data/examples/odeiv/demo.rb +3 -3
- data/examples/odeiv/frei1.rb +7 -7
- data/examples/odeiv/frei2.rb +4 -4
- data/examples/odeiv/oscillator.rb +1 -1
- data/examples/odeiv/sedov.rb +3 -3
- data/examples/odeiv/whitedwarf.rb +11 -11
- data/examples/permutation/ex1.rb +2 -2
- data/examples/permutation/permutation.rb +1 -1
- data/examples/poly/demo.rb +1 -1
- data/examples/random/diffusion.rb +1 -1
- data/examples/random/generator.rb +2 -2
- data/examples/random/randomwalk.rb +3 -3
- data/examples/random/rng.rb +1 -1
- data/examples/roots/bisection.rb +1 -1
- data/examples/roots/brent.rb +1 -1
- data/examples/roots/demo.rb +1 -1
- data/examples/roots/newton.rb +2 -2
- data/examples/roots/recombination.gp +0 -1
- data/examples/sf/hyperg.rb +1 -1
- data/examples/sf/sphbessel.rb +1 -1
- data/examples/sort/sort.rb +1 -1
- data/examples/tamu_anova.rb +4 -4
- data/examples/vector/add.rb +1 -1
- data/examples/vector/decimate.rb +1 -1
- data/examples/vector/gnuplot.rb +8 -8
- data/examples/vector/vector.rb +2 -2
- data/examples/wavelet/wavelet1.rb +1 -1
- data/ext/{alf.c → gsl_native/alf.c} +10 -10
- data/ext/{array.c → gsl_native/array.c} +70 -159
- data/ext/{array_complex.c → gsl_native/array_complex.c} +63 -66
- data/ext/{blas.c → gsl_native/blas.c} +2 -3
- data/ext/{blas1.c → gsl_native/blas1.c} +35 -36
- data/ext/{blas2.c → gsl_native/blas2.c} +57 -62
- data/ext/{blas3.c → gsl_native/blas3.c} +57 -58
- data/ext/{block.c → gsl_native/block.c} +14 -18
- data/ext/{block_source.c → gsl_native/block_source.h} +110 -112
- data/ext/gsl_native/bspline.c +122 -0
- data/ext/{bundle.c → gsl_native/bundle.c} +0 -0
- data/ext/{cdf.c → gsl_native/cdf.c} +79 -93
- data/ext/{cheb.c → gsl_native/cheb.c} +78 -89
- data/ext/{combination.c → gsl_native/combination.c} +11 -19
- data/ext/{common.c → gsl_native/common.c} +9 -41
- data/ext/{complex.c → gsl_native/complex.c} +116 -118
- data/ext/gsl_native/const.c +331 -0
- data/ext/{const_additional.c → gsl_native/const_additional.c} +13 -34
- data/ext/gsl_native/cqp.c +283 -0
- data/ext/{deriv.c → gsl_native/deriv.c} +25 -33
- data/ext/{dht.c → gsl_native/dht.c} +23 -31
- data/ext/{diff.c → gsl_native/diff.c} +26 -28
- data/ext/{dirac.c → gsl_native/dirac.c} +45 -46
- data/ext/{eigen.c → gsl_native/eigen.c} +1044 -1095
- data/ext/{error.c → gsl_native/error.c} +18 -18
- data/ext/gsl_native/extconf.rb +118 -0
- data/ext/{fft.c → gsl_native/fft.c} +197 -204
- data/ext/{fit.c → gsl_native/fit.c} +17 -18
- data/ext/gsl_native/fresnel.c +312 -0
- data/ext/{function.c → gsl_native/function.c} +37 -43
- data/ext/{geometry.c → gsl_native/geometry.c} +16 -16
- data/ext/{graph.c → gsl_native/graph.c} +39 -89
- data/ext/{gsl.c → gsl_native/gsl.c} +12 -33
- data/ext/{gsl_narray.c → gsl_native/gsl_narray.c} +20 -30
- data/ext/{histogram.c → gsl_native/histogram.c} +133 -160
- data/ext/{histogram2d.c → gsl_native/histogram2d.c} +78 -104
- data/ext/{histogram3d.c → gsl_native/histogram3d.c} +76 -76
- data/ext/{histogram3d_source.c → gsl_native/histogram3d_source.c} +196 -197
- data/ext/{histogram_find.c → gsl_native/histogram_find.c} +32 -34
- data/ext/{histogram_oper.c → gsl_native/histogram_oper.c} +43 -52
- data/ext/{ieee.c → gsl_native/ieee.c} +9 -21
- data/{include → ext/gsl_native/include}/rb_gsl.h +4 -26
- data/{include → ext/gsl_native/include}/rb_gsl_array.h +15 -39
- data/{include → ext/gsl_native/include}/rb_gsl_cheb.h +0 -2
- data/{include → ext/gsl_native/include}/rb_gsl_common.h +61 -61
- data/{include → ext/gsl_native/include}/rb_gsl_complex.h +1 -1
- data/{include → ext/gsl_native/include}/rb_gsl_const.h +0 -6
- data/ext/gsl_native/include/rb_gsl_dirac.h +6 -0
- data/{include → ext/gsl_native/include}/rb_gsl_eigen.h +1 -1
- data/{include → ext/gsl_native/include}/rb_gsl_fft.h +0 -13
- data/{include → ext/gsl_native/include}/rb_gsl_fit.h +0 -2
- data/{include → ext/gsl_native/include}/rb_gsl_function.h +0 -4
- data/{include → ext/gsl_native/include}/rb_gsl_graph.h +2 -4
- data/{include → ext/gsl_native/include}/rb_gsl_histogram.h +8 -8
- data/{include → ext/gsl_native/include}/rb_gsl_histogram3d.h +50 -50
- data/{include → ext/gsl_native/include}/rb_gsl_integration.h +1 -1
- data/{include → ext/gsl_native/include}/rb_gsl_interp.h +0 -5
- data/{include → ext/gsl_native/include}/rb_gsl_linalg.h +2 -6
- data/{include → ext/gsl_native/include}/rb_gsl_math.h +0 -6
- data/{include → ext/gsl_native/include}/rb_gsl_odeiv.h +0 -3
- data/{include → ext/gsl_native/include}/rb_gsl_poly.h +3 -7
- data/{include → ext/gsl_native/include}/rb_gsl_rational.h +1 -8
- data/{include → ext/gsl_native/include}/rb_gsl_rng.h +0 -1
- data/{include → ext/gsl_native/include}/rb_gsl_root.h +1 -1
- data/{include → ext/gsl_native/include}/rb_gsl_sf.h +39 -48
- data/{include → ext/gsl_native/include}/rb_gsl_statistics.h +1 -1
- data/{include → ext/gsl_native/include}/rb_gsl_tensor.h +0 -2
- data/{include → ext/gsl_native/include}/rb_gsl_with_narray.h +3 -1
- data/{include → ext/gsl_native/include}/templates_off.h +0 -0
- data/{include → ext/gsl_native/include}/templates_on.h +1 -1
- data/ext/{integration.c → gsl_native/integration.c} +164 -189
- data/ext/{interp.c → gsl_native/interp.c} +25 -38
- data/ext/gsl_native/jacobi.c +733 -0
- data/ext/{linalg.c → gsl_native/linalg.c} +462 -589
- data/ext/{linalg_complex.c → gsl_native/linalg_complex.c} +93 -106
- data/ext/{math.c → gsl_native/math.c} +48 -67
- data/ext/{matrix.c → gsl_native/matrix.c} +13 -16
- data/ext/{matrix_complex.c → gsl_native/matrix_complex.c} +119 -123
- data/ext/{matrix_double.c → gsl_native/matrix_double.c} +79 -82
- data/ext/{matrix_int.c → gsl_native/matrix_int.c} +53 -54
- data/ext/{matrix_source.c → gsl_native/matrix_source.h} +292 -318
- data/ext/{min.c → gsl_native/min.c} +45 -76
- data/ext/{monte.c → gsl_native/monte.c} +50 -64
- data/ext/{multifit.c → gsl_native/multifit.c} +142 -151
- data/ext/{multimin.c → gsl_native/multimin.c} +64 -92
- data/ext/{multimin_fsdf.c → gsl_native/multimin_fsdf.c} +16 -16
- data/ext/{multiroots.c → gsl_native/multiroots.c} +73 -76
- data/ext/{multiset.c → gsl_native/multiset.c} +4 -8
- data/ext/{ndlinear.c → gsl_native/ndlinear.c} +320 -321
- data/ext/{nmf.c → gsl_native/nmf.c} +11 -11
- data/ext/{nmf_wrap.c → gsl_native/nmf_wrap.c} +1 -1
- data/ext/{ntuple.c → gsl_native/ntuple.c} +23 -23
- data/ext/{odeiv.c → gsl_native/odeiv.c} +101 -116
- data/ext/gsl_native/ool.c +879 -0
- data/ext/{permutation.c → gsl_native/permutation.c} +39 -37
- data/ext/{poly.c → gsl_native/poly.c} +10 -13
- data/ext/{poly2.c → gsl_native/poly2.c} +16 -16
- data/ext/{poly_source.c → gsl_native/poly_source.h} +249 -293
- data/ext/{qrng.c → gsl_native/qrng.c} +9 -20
- data/ext/{randist.c → gsl_native/randist.c} +222 -247
- data/ext/{rational.c → gsl_native/rational.c} +12 -12
- data/ext/{rng.c → gsl_native/rng.c} +30 -47
- data/ext/{root.c → gsl_native/root.c} +47 -48
- data/ext/{sf.c → gsl_native/sf.c} +196 -244
- data/ext/{sf_airy.c → gsl_native/sf_airy.c} +2 -2
- data/ext/{sf_bessel.c → gsl_native/sf_bessel.c} +7 -7
- data/ext/{sf_clausen.c → gsl_native/sf_clausen.c} +1 -1
- data/ext/{sf_coulomb.c → gsl_native/sf_coulomb.c} +40 -40
- data/ext/{sf_coupling.c → gsl_native/sf_coupling.c} +30 -30
- data/ext/{sf_dawson.c → gsl_native/sf_dawson.c} +1 -1
- data/ext/{sf_debye.c → gsl_native/sf_debye.c} +1 -10
- data/ext/{sf_dilog.c → gsl_native/sf_dilog.c} +1 -1
- data/ext/{sf_elementary.c → gsl_native/sf_elementary.c} +3 -3
- data/ext/{sf_ellint.c → gsl_native/sf_ellint.c} +43 -43
- data/ext/{sf_elljac.c → gsl_native/sf_elljac.c} +3 -3
- data/ext/{sf_erfc.c → gsl_native/sf_erfc.c} +1 -5
- data/ext/{sf_exp.c → gsl_native/sf_exp.c} +3 -3
- data/ext/{sf_expint.c → gsl_native/sf_expint.c} +2 -12
- data/ext/{sf_fermi_dirac.c → gsl_native/sf_fermi_dirac.c} +1 -1
- data/ext/{sf_gamma.c → gsl_native/sf_gamma.c} +2 -6
- data/ext/{sf_gegenbauer.c → gsl_native/sf_gegenbauer.c} +1 -1
- data/ext/{sf_hyperg.c → gsl_native/sf_hyperg.c} +1 -1
- data/ext/{sf_laguerre.c → gsl_native/sf_laguerre.c} +4 -4
- data/ext/{sf_lambert.c → gsl_native/sf_lambert.c} +1 -1
- data/ext/{sf_legendre.c → gsl_native/sf_legendre.c} +1 -1
- data/ext/{sf_log.c → gsl_native/sf_log.c} +4 -4
- data/ext/gsl_native/sf_mathieu.c +235 -0
- data/ext/{sf_power.c → gsl_native/sf_power.c} +1 -1
- data/ext/{sf_psi.c → gsl_native/sf_psi.c} +3 -12
- data/ext/{sf_synchrotron.c → gsl_native/sf_synchrotron.c} +1 -1
- data/ext/{sf_transport.c → gsl_native/sf_transport.c} +1 -1
- data/ext/{sf_trigonometric.c → gsl_native/sf_trigonometric.c} +4 -4
- data/ext/{sf_zeta.c → gsl_native/sf_zeta.c} +1 -5
- data/ext/{signal.c → gsl_native/signal.c} +63 -68
- data/ext/{siman.c → gsl_native/siman.c} +45 -49
- data/ext/{sort.c → gsl_native/sort.c} +6 -7
- data/ext/{spline.c → gsl_native/spline.c} +28 -46
- data/ext/{stats.c → gsl_native/stats.c} +105 -118
- data/ext/{sum.c → gsl_native/sum.c} +34 -34
- data/ext/{tamu_anova.c → gsl_native/tamu_anova.c} +1 -1
- data/ext/{tensor.c → gsl_native/tensor.c} +8 -11
- data/ext/{tensor_source.c → gsl_native/tensor_source.h} +147 -148
- data/ext/{vector.c → gsl_native/vector.c} +11 -14
- data/ext/{vector_complex.c → gsl_native/vector_complex.c} +179 -184
- data/ext/{vector_double.c → gsl_native/vector_double.c} +178 -183
- data/ext/{vector_int.c → gsl_native/vector_int.c} +27 -29
- data/ext/{vector_source.c → gsl_native/vector_source.h} +428 -443
- data/ext/{wavelet.c → gsl_native/wavelet.c} +224 -246
- data/gsl.gemspec +29 -0
- data/lib/gsl.rb +8 -3
- data/lib/gsl/gnuplot.rb +3 -3
- data/lib/gsl/oper.rb +35 -60
- data/lib/gsl/version.rb +3 -0
- data/lib/rbgsl.rb +1 -3
- data/rdoc/alf.rdoc +5 -5
- data/rdoc/blas.rdoc +9 -9
- data/rdoc/bspline.rdoc +17 -17
- data/rdoc/changes.rdoc +4 -9
- data/rdoc/cheb.rdoc +25 -25
- data/rdoc/cholesky_complex.rdoc +21 -21
- data/rdoc/combi.rdoc +37 -37
- data/rdoc/complex.rdoc +22 -22
- data/rdoc/const.rdoc +47 -47
- data/rdoc/dht.rdoc +49 -49
- data/rdoc/diff.rdoc +42 -42
- data/rdoc/ehandling.rdoc +6 -6
- data/rdoc/eigen.rdoc +153 -153
- data/rdoc/fft.rdoc +146 -146
- data/rdoc/fit.rdoc +109 -109
- data/rdoc/function.rdoc +11 -11
- data/rdoc/graph.rdoc +17 -17
- data/rdoc/hist.rdoc +103 -103
- data/rdoc/hist2d.rdoc +42 -42
- data/rdoc/hist3d.rdoc +9 -9
- data/rdoc/integration.rdoc +110 -110
- data/rdoc/interp.rdoc +71 -71
- data/rdoc/intro.rdoc +8 -8
- data/rdoc/linalg.rdoc +188 -188
- data/rdoc/linalg_complex.rdoc +1 -1
- data/rdoc/math.rdoc +58 -58
- data/rdoc/matrix.rdoc +275 -275
- data/rdoc/min.rdoc +57 -57
- data/rdoc/monte.rdoc +22 -22
- data/rdoc/multimin.rdoc +95 -95
- data/rdoc/multiroot.rdoc +80 -80
- data/rdoc/narray.rdoc +32 -32
- data/rdoc/ndlinear.rdoc +54 -54
- data/rdoc/nonlinearfit.rdoc +100 -100
- data/rdoc/ntuple.rdoc +31 -31
- data/rdoc/odeiv.rdoc +88 -88
- data/rdoc/perm.rdoc +90 -90
- data/rdoc/poly.rdoc +66 -66
- data/rdoc/qrng.rdoc +21 -21
- data/rdoc/randist.rdoc +82 -82
- data/rdoc/ref.rdoc +57 -57
- data/rdoc/rng.rdoc +85 -85
- data/rdoc/roots.rdoc +57 -57
- data/rdoc/sf.rdoc +428 -428
- data/rdoc/siman.rdoc +19 -19
- data/rdoc/sort.rdoc +30 -30
- data/rdoc/start.rdoc +8 -8
- data/rdoc/stats.rdoc +52 -52
- data/rdoc/sum.rdoc +12 -12
- data/rdoc/tensor.rdoc +31 -31
- data/rdoc/tut.rdoc +1 -1
- data/rdoc/use.rdoc +39 -39
- data/rdoc/vector.rdoc +188 -188
- data/rdoc/vector_complex.rdoc +24 -24
- data/rdoc/wavelet.rdoc +46 -46
- data/test/gsl/blas_test.rb +79 -0
- data/test/gsl/bspline_test.rb +63 -0
- data/test/gsl/cdf_test.rb +1512 -0
- data/test/gsl/cheb_test.rb +80 -0
- data/test/gsl/combination_test.rb +100 -0
- data/test/gsl/complex_test.rb +20 -0
- data/test/gsl/const_test.rb +29 -0
- data/test/gsl/deriv_test.rb +62 -0
- data/test/gsl/dht_test.rb +79 -0
- data/test/gsl/diff_test.rb +53 -0
- data/test/gsl/eigen_test.rb +563 -0
- data/test/gsl/err_test.rb +23 -0
- data/test/gsl/fit_test.rb +101 -0
- data/test/gsl/histo_test.rb +14 -0
- data/test/gsl/index_test.rb +61 -0
- data/test/gsl/integration_test.rb +274 -0
- data/test/gsl/interp_test.rb +27 -0
- data/test/gsl/linalg_test.rb +463 -0
- data/test/gsl/matrix_nmf_test.rb +37 -0
- data/test/gsl/matrix_test.rb +98 -0
- data/test/gsl/min_test.rb +89 -0
- data/test/gsl/monte_test.rb +77 -0
- data/test/gsl/multifit_test.rb +753 -0
- data/test/gsl/multimin_test.rb +157 -0
- data/test/gsl/multiroot_test.rb +135 -0
- data/test/gsl/multiset_test.rb +52 -0
- data/test/gsl/odeiv_test.rb +275 -0
- data/test/gsl/oper_test.rb +98 -0
- data/test/gsl/poly_test.rb +338 -0
- data/test/gsl/qrng_test.rb +94 -0
- data/test/gsl/quartic_test.rb +28 -0
- data/test/gsl/randist_test.rb +122 -0
- data/test/gsl/rng_test.rb +303 -0
- data/test/gsl/roots_test.rb +78 -0
- data/test/gsl/sf_test.rb +2079 -0
- data/test/gsl/stats_test.rb +122 -0
- data/test/gsl/sum_test.rb +69 -0
- data/test/gsl/tensor_test.rb +396 -0
- data/test/gsl/vector_test.rb +223 -0
- data/test/gsl/wavelet_test.rb +130 -0
- data/test/gsl_test.rb +321 -0
- data/test/test_helper.rb +42 -0
- data/uncrustify.cfg +1693 -0
- metadata +337 -378
- data/README +0 -32
- data/VERSION +0 -1
- data/ext/bspline.c +0 -130
- data/ext/const.c +0 -673
- data/ext/cqp.c +0 -283
- data/ext/extconf.rb +0 -295
- data/ext/fcmp.c +0 -66
- data/ext/fresnel.c +0 -312
- data/ext/jacobi.c +0 -739
- data/ext/ool.c +0 -879
- data/ext/oper_complex_source.c +0 -253
- data/ext/sf_mathieu.c +0 -238
- data/include/rb_gsl_config.h +0 -62
- data/include/rb_gsl_dirac.h +0 -13
- data/rdoc/index.rdoc +0 -62
- data/rdoc/rngextra.rdoc +0 -11
- data/rdoc/screenshot.rdoc +0 -40
- data/setup.rb +0 -1585
- data/tests/blas/amax.rb +0 -14
- data/tests/blas/asum.rb +0 -16
- data/tests/blas/axpy.rb +0 -25
- data/tests/blas/copy.rb +0 -23
- data/tests/blas/dot.rb +0 -23
- data/tests/bspline.rb +0 -53
- data/tests/cdf.rb +0 -1388
- data/tests/cheb.rb +0 -112
- data/tests/combination.rb +0 -123
- data/tests/complex.rb +0 -17
- data/tests/const.rb +0 -24
- data/tests/deriv.rb +0 -85
- data/tests/dht/dht1.rb +0 -17
- data/tests/dht/dht2.rb +0 -23
- data/tests/dht/dht3.rb +0 -23
- data/tests/dht/dht4.rb +0 -23
- data/tests/diff.rb +0 -78
- data/tests/eigen/eigen.rb +0 -220
- data/tests/eigen/gen.rb +0 -105
- data/tests/eigen/genherm.rb +0 -66
- data/tests/eigen/gensymm.rb +0 -68
- data/tests/eigen/nonsymm.rb +0 -53
- data/tests/eigen/nonsymmv.rb +0 -53
- data/tests/eigen/symm-herm.rb +0 -74
- data/tests/err.rb +0 -58
- data/tests/fit.rb +0 -124
- data/tests/gsl_test.rb +0 -118
- data/tests/gsl_test2.rb +0 -110
- data/tests/histo.rb +0 -12
- data/tests/integration/integration1.rb +0 -72
- data/tests/integration/integration2.rb +0 -71
- data/tests/integration/integration3.rb +0 -71
- data/tests/integration/integration4.rb +0 -71
- data/tests/interp.rb +0 -45
- data/tests/linalg/HH.rb +0 -64
- data/tests/linalg/LU.rb +0 -47
- data/tests/linalg/QR.rb +0 -77
- data/tests/linalg/SV.rb +0 -24
- data/tests/linalg/TDN.rb +0 -116
- data/tests/linalg/TDS.rb +0 -122
- data/tests/linalg/bidiag.rb +0 -73
- data/tests/linalg/cholesky.rb +0 -20
- data/tests/linalg/linalg.rb +0 -158
- data/tests/matrix/matrix_complex_test.rb +0 -36
- data/tests/matrix/matrix_nmf_test.rb +0 -39
- data/tests/matrix/matrix_test.rb +0 -48
- data/tests/min.rb +0 -99
- data/tests/monte/miser.rb +0 -31
- data/tests/monte/vegas.rb +0 -45
- data/tests/multifit/test_2dgauss.rb +0 -112
- data/tests/multifit/test_brown.rb +0 -90
- data/tests/multifit/test_enso.rb +0 -246
- data/tests/multifit/test_filip.rb +0 -155
- data/tests/multifit/test_gauss.rb +0 -97
- data/tests/multifit/test_longley.rb +0 -110
- data/tests/multifit/test_multifit.rb +0 -52
- data/tests/multimin.rb +0 -139
- data/tests/multiroot.rb +0 -131
- data/tests/multiset.rb +0 -52
- data/tests/narray/blas_dnrm2.rb +0 -20
- data/tests/odeiv.rb +0 -353
- data/tests/poly/poly.rb +0 -290
- data/tests/poly/special.rb +0 -65
- data/tests/qrng.rb +0 -131
- data/tests/quartic.rb +0 -29
- data/tests/randist.rb +0 -134
- data/tests/rng.rb +0 -305
- data/tests/roots.rb +0 -76
- data/tests/run-test.sh +0 -17
- data/tests/sf/gsl_test_sf.rb +0 -249
- data/tests/sf/test_airy.rb +0 -83
- data/tests/sf/test_bessel.rb +0 -306
- data/tests/sf/test_coulomb.rb +0 -17
- data/tests/sf/test_dilog.rb +0 -25
- data/tests/sf/test_gamma.rb +0 -209
- data/tests/sf/test_hyperg.rb +0 -356
- data/tests/sf/test_legendre.rb +0 -227
- data/tests/sf/test_mathieu.rb +0 -59
- data/tests/sf/test_mode.rb +0 -19
- data/tests/sf/test_sf.rb +0 -839
- data/tests/stats.rb +0 -174
- data/tests/stats_mt.rb +0 -16
- data/tests/sum.rb +0 -98
- data/tests/sys.rb +0 -323
- data/tests/tensor.rb +0 -419
- data/tests/vector/vector_complex_test.rb +0 -101
- data/tests/vector/vector_test.rb +0 -141
- data/tests/wavelet.rb +0 -142
data/rdoc/perm.rdoc
CHANGED
@@ -1,39 +1,39 @@
|
|
1
1
|
#
|
2
2
|
# = Permutations
|
3
3
|
# Contents:
|
4
|
-
# 1. {Permuation allocations}[link:
|
5
|
-
# 1. {Methods}[link:
|
6
|
-
# 1. {Accessing permutation elements}[link:
|
7
|
-
# 1. {Permuation properties}[link:
|
8
|
-
# 1. {Permuation functions}[link:
|
9
|
-
# 1. {Reading and writing permutations}[link:
|
10
|
-
# 1. {Permutations in cyclic form}[link:
|
11
|
-
# 1. {Applying Permutations}[link:
|
4
|
+
# 1. {Permuation allocations}[link:rdoc/perm_rdoc.html#label-Permuation+allocations]
|
5
|
+
# 1. {Methods}[link:rdoc/perm_rdoc.html#label-Methods]
|
6
|
+
# 1. {Accessing permutation elements}[link:rdoc/perm_rdoc.html#label-Accessing+permutation+elements]
|
7
|
+
# 1. {Permuation properties}[link:rdoc/perm_rdoc.html#label-Permutation+properties]
|
8
|
+
# 1. {Permuation functions}[link:rdoc/perm_rdoc.html#label-Permutation+functions]
|
9
|
+
# 1. {Reading and writing permutations}[link:rdoc/perm_rdoc.html#label-Reading+and+writing+permutations]
|
10
|
+
# 1. {Permutations in cyclic form}[link:rdoc/perm_rdoc.html#label-Permutations+in+cyclic+Form]
|
11
|
+
# 1. {Applying Permutations}[link:rdoc/perm_rdoc.html#label-Applying+Permutations]
|
12
12
|
#
|
13
|
-
# ==
|
13
|
+
# == Permuation allocations
|
14
14
|
# ---
|
15
15
|
# * GSL::Permutation.alloc(n)
|
16
16
|
#
|
17
|
-
# These functions create a new permutation of size <tt>n</tt>.
|
18
|
-
# The permutation is not initialized and its elements are undefined.
|
19
|
-
# Use <tt>GSL::Permutation.calloc</tt> if you want to create a permutation
|
20
|
-
# which is initialized to the identity.
|
17
|
+
# These functions create a new permutation of size <tt>n</tt>.
|
18
|
+
# The permutation is not initialized and its elements are undefined.
|
19
|
+
# Use <tt>GSL::Permutation.calloc</tt> if you want to create a permutation
|
20
|
+
# which is initialized to the identity.
|
21
21
|
#
|
22
22
|
# ---
|
23
23
|
# * GSL::Permutation.calloc(n)
|
24
24
|
#
|
25
|
-
# This creates a new permutation of size <tt>n</tt> and initializes it to the identity.
|
25
|
+
# This creates a new permutation of size <tt>n</tt> and initializes it to the identity.
|
26
26
|
#
|
27
|
-
# ==
|
27
|
+
# == Methods
|
28
28
|
# ---
|
29
29
|
# * GSL::Permutation#init()
|
30
30
|
#
|
31
|
-
# This initializes the permutation to the identity, i.e. (0,1,2,...,n-1).
|
31
|
+
# This initializes the permutation to the identity, i.e. (0,1,2,...,n-1).
|
32
32
|
#
|
33
33
|
# ---
|
34
34
|
# * GSL::Permutation.memcpy(dest, src)
|
35
35
|
#
|
36
|
-
# This method copies the elements of the permutation <tt>src</tt>
|
36
|
+
# This method copies the elements of the permutation <tt>src</tt>
|
37
37
|
# into the permutation <tt>dest</tt>. The two permutations must have the same size.
|
38
38
|
#
|
39
39
|
# ---
|
@@ -41,19 +41,19 @@
|
|
41
41
|
#
|
42
42
|
# This creates a new permutation with the same elements of <tt>self</tt>.
|
43
43
|
#
|
44
|
-
# ===
|
44
|
+
# === Accessing permutation elements
|
45
45
|
#
|
46
46
|
# ---
|
47
47
|
# * GSL::Permutation#get(i)
|
48
48
|
#
|
49
|
-
# Returns the value of the <tt>i</tt>-th element of the permutation.
|
49
|
+
# Returns the value of the <tt>i</tt>-th element of the permutation.
|
50
50
|
#
|
51
51
|
# ---
|
52
52
|
# * GSL::Permutation#swap(i, j)
|
53
53
|
#
|
54
54
|
# This exchanges the <tt>i</tt>-th and <tt>j</tt>-th elements of the permutation.
|
55
55
|
#
|
56
|
-
# ===
|
56
|
+
# === Permutation properties
|
57
57
|
# ---
|
58
58
|
# * GSL::Permutation#size
|
59
59
|
#
|
@@ -61,7 +61,7 @@
|
|
61
61
|
# ---
|
62
62
|
# * GSL::Permutation#valid
|
63
63
|
#
|
64
|
-
# This checks that the permutation <tt>self</tt> is valid.
|
64
|
+
# This checks that the permutation <tt>self</tt> is valid.
|
65
65
|
# The n elements should contain each of the numbers 0 .. n-1 once and only once.
|
66
66
|
#
|
67
67
|
# ---
|
@@ -69,7 +69,7 @@
|
|
69
69
|
#
|
70
70
|
# This returns true if the permutation <tt>self</tt> is valid, and false otherwise.
|
71
71
|
#
|
72
|
-
# ===
|
72
|
+
# === Permutation functions
|
73
73
|
#
|
74
74
|
# ---
|
75
75
|
# * GSL::Permutation#reverse
|
@@ -84,20 +84,20 @@
|
|
84
84
|
# ---
|
85
85
|
# * GSL::Permutation#next
|
86
86
|
#
|
87
|
-
# This method advances the permutation <tt>self</tt> to the next permutation in
|
88
|
-
# lexicographic order and returns <tt>GSL::SUCCESS</tt>. If no further permutations
|
89
|
-
# are available it returns <tt>GSL::FAILURE</tt> and leaves <tt>self</tt> unmodified.
|
90
|
-
# Starting with the identity permutation and repeatedly applying this function
|
87
|
+
# This method advances the permutation <tt>self</tt> to the next permutation in
|
88
|
+
# lexicographic order and returns <tt>GSL::SUCCESS</tt>. If no further permutations
|
89
|
+
# are available it returns <tt>GSL::FAILURE</tt> and leaves <tt>self</tt> unmodified.
|
90
|
+
# Starting with the identity permutation and repeatedly applying this function
|
91
91
|
# will iterate through all possible permutations of a given order.
|
92
92
|
# ---
|
93
93
|
# * GSL::Permutation#prev
|
94
94
|
#
|
95
|
-
# This method steps backwards from the permutation <tt>self</tt> to the previous
|
96
|
-
# permutation in lexicographic order, returning <tt>GSL_SUCCESS</tt>.
|
97
|
-
# If no previous permutation is available it returns <tt>GSL_FAILURE</tt>
|
95
|
+
# This method steps backwards from the permutation <tt>self</tt> to the previous
|
96
|
+
# permutation in lexicographic order, returning <tt>GSL_SUCCESS</tt>.
|
97
|
+
# If no previous permutation is available it returns <tt>GSL_FAILURE</tt>
|
98
98
|
# and leaves <tt>self</tt> unmodified.
|
99
99
|
#
|
100
|
-
# ===
|
100
|
+
# === Reading and writing permutations
|
101
101
|
# ---
|
102
102
|
# * GSL::Permutation#fwrite(io)
|
103
103
|
# * GSL::Permutation#fwrite(filename)
|
@@ -109,113 +109,113 @@
|
|
109
109
|
# * GSL::Permutation#fscanf(filename)
|
110
110
|
#
|
111
111
|
#
|
112
|
-
# ===
|
113
|
-
# A permutation can be represented in both <tt>linear</tt> and
|
114
|
-
# <tt>cyclic</tt> notations. The functions described in this section convert
|
115
|
-
# between the two forms. The linear notation is an index mapping, and has
|
116
|
-
# already been described above. The cyclic notation expresses a
|
117
|
-
# permutation as a series of circular rearrangements of groups
|
118
|
-
# of elements, or <tt>cycles</tt>.
|
112
|
+
# === Permutations in cyclic Form
|
113
|
+
# A permutation can be represented in both <tt>linear</tt> and
|
114
|
+
# <tt>cyclic</tt> notations. The functions described in this section convert
|
115
|
+
# between the two forms. The linear notation is an index mapping, and has
|
116
|
+
# already been described above. The cyclic notation expresses a
|
117
|
+
# permutation as a series of circular rearrangements of groups
|
118
|
+
# of elements, or <tt>cycles</tt>.
|
119
119
|
#
|
120
|
-
# For example, under the cycle (1 2 3), 1 is replaced by 2, 2 is replaced
|
121
|
-
# by 3 and 3 is replaced by 1 in a circular fashion. Cycles of different
|
122
|
-
# sets of elements can be combined independently, for example (1 2 3) (4 5)
|
123
|
-
# combines the cycle (1 2 3) with the cycle (4 5), which is an exchange of
|
124
|
-
# elements 4 and 5. A cycle of length one represents an element which is
|
125
|
-
# unchanged by the permutation and is referred to as a <tt>singleton</tt>.
|
120
|
+
# For example, under the cycle (1 2 3), 1 is replaced by 2, 2 is replaced
|
121
|
+
# by 3 and 3 is replaced by 1 in a circular fashion. Cycles of different
|
122
|
+
# sets of elements can be combined independently, for example (1 2 3) (4 5)
|
123
|
+
# combines the cycle (1 2 3) with the cycle (4 5), which is an exchange of
|
124
|
+
# elements 4 and 5. A cycle of length one represents an element which is
|
125
|
+
# unchanged by the permutation and is referred to as a <tt>singleton</tt>.
|
126
126
|
#
|
127
|
-
# It can be shown that every permutation can be decomposed into combinations
|
128
|
-
# of cycles. The decomposition is not unique, but can always be rearranged
|
129
|
-
# into a standard <tt>canonical form</tt> by a reordering of elements.
|
130
|
-
# The library uses the canonical form defined in Knuth's
|
131
|
-
# <tt>Art of Computer Programming</tt> (Vol 1, 3rd Ed, 1997) Section 1.3.3, p.178.
|
127
|
+
# It can be shown that every permutation can be decomposed into combinations
|
128
|
+
# of cycles. The decomposition is not unique, but can always be rearranged
|
129
|
+
# into a standard <tt>canonical form</tt> by a reordering of elements.
|
130
|
+
# The library uses the canonical form defined in Knuth's
|
131
|
+
# <tt>Art of Computer Programming</tt> (Vol 1, 3rd Ed, 1997) Section 1.3.3, p.178.
|
132
132
|
#
|
133
|
-
# The procedure for obtaining the canonical form given by Knuth is,
|
133
|
+
# The procedure for obtaining the canonical form given by Knuth is,
|
134
134
|
#
|
135
135
|
#
|
136
|
-
# 1. Write all singleton cycles explicitly
|
137
|
-
# 1. Within each cycle, put the smallest number first
|
138
|
-
# 1. Order the cycles in decreasing order of the first number in the cycle.
|
136
|
+
# 1. Write all singleton cycles explicitly
|
137
|
+
# 1. Within each cycle, put the smallest number first
|
138
|
+
# 1. Order the cycles in decreasing order of the first number in the cycle.
|
139
139
|
#
|
140
|
-
# For example, the linear representation (2 4 3 0 1) is represented as
|
141
|
-
# (1 4) (0 2 3) in canonical form. The permutation corresponds to an
|
142
|
-
# exchange of elements 1 and 4, and rotation of elements 0, 2 and 3.
|
140
|
+
# For example, the linear representation (2 4 3 0 1) is represented as
|
141
|
+
# (1 4) (0 2 3) in canonical form. The permutation corresponds to an
|
142
|
+
# exchange of elements 1 and 4, and rotation of elements 0, 2 and 3.
|
143
143
|
#
|
144
|
-
# The important property of the canonical form is that it can be reconstructed
|
145
|
-
# from the contents of each cycle without the brackets. In addition, by removing
|
146
|
-
# the brackets it can be considered as a linear representation of a different
|
147
|
-
# permutation. In the example given above the permutation (2 4 3 0 1) would
|
148
|
-
# become (1 4 0 2 3). This mapping has many applications in the theory of
|
149
|
-
# permutations.
|
144
|
+
# The important property of the canonical form is that it can be reconstructed
|
145
|
+
# from the contents of each cycle without the brackets. In addition, by removing
|
146
|
+
# the brackets it can be considered as a linear representation of a different
|
147
|
+
# permutation. In the example given above the permutation (2 4 3 0 1) would
|
148
|
+
# become (1 4 0 2 3). This mapping has many applications in the theory of
|
149
|
+
# permutations.
|
150
150
|
#
|
151
151
|
# ---
|
152
152
|
# * GSL::Permutation#linear_to_canonical
|
153
153
|
# * GSL::Permutation#to_canonical
|
154
154
|
#
|
155
|
-
# Computes the canonical form of the permutation <tt>self</tt> and
|
155
|
+
# Computes the canonical form of the permutation <tt>self</tt> and
|
156
156
|
# returns it as a new <tt>GSL::Permutation</tt>.
|
157
157
|
#
|
158
158
|
# ---
|
159
159
|
# * GSL::Permutation#canonical_to_linear
|
160
160
|
# * GSL::Permutation#to_linear
|
161
161
|
#
|
162
|
-
# Converts a permutation <tt>self</tt> in canonical form back into linear
|
162
|
+
# Converts a permutation <tt>self</tt> in canonical form back into linear
|
163
163
|
# form and returns it as a new <tt>GSL::Permutation</tt>.
|
164
164
|
#
|
165
165
|
#
|
166
166
|
# ---
|
167
167
|
# * GSL::Permutation#inversions
|
168
168
|
#
|
169
|
-
# Counts the number of inversions in the permutation <tt>self</tt>.
|
170
|
-
# An inversion is any pair of elements that are not in order.
|
169
|
+
# Counts the number of inversions in the permutation <tt>self</tt>.
|
170
|
+
# An inversion is any pair of elements that are not in order.
|
171
171
|
# For example, the permutation 2031 has three inversions, corresponding
|
172
|
-
# to the pairs (2,0) (2,1) and (3,1).
|
173
|
-
# The identity permutation has no inversions.
|
172
|
+
# to the pairs (2,0) (2,1) and (3,1).
|
173
|
+
# The identity permutation has no inversions.
|
174
174
|
#
|
175
175
|
# ---
|
176
176
|
# * GSL::Permutation#linear_cycles
|
177
177
|
#
|
178
|
-
# Counts the number of cycles in the permutation <tt>self</tt>,
|
179
|
-
# given in linear form.
|
178
|
+
# Counts the number of cycles in the permutation <tt>self</tt>,
|
179
|
+
# given in linear form.
|
180
180
|
#
|
181
181
|
# ---
|
182
182
|
# * GSL::Permutation#canonical_cycles
|
183
183
|
#
|
184
|
-
# Counts the number of cycles in the permutation <tt>self</tt>,
|
185
|
-
# given in canonical form.
|
184
|
+
# Counts the number of cycles in the permutation <tt>self</tt>,
|
185
|
+
# given in canonical form.
|
186
186
|
#
|
187
|
-
# ==
|
187
|
+
# == Applying Permutations
|
188
188
|
# ---
|
189
189
|
# * GSL::Permutation::permute(v)
|
190
190
|
#
|
191
|
-
# Applies the permutation <tt>self</tt> to the elements of the vector <tt>v</tt>,
|
192
|
-
# considered as a row-vector acted on by a permutation matrix from the
|
193
|
-
# right, v' = v P. The j-th column of the permutation matrix P is
|
194
|
-
# given by the p_j-th column of the identity matrix.
|
191
|
+
# Applies the permutation <tt>self</tt> to the elements of the vector <tt>v</tt>,
|
192
|
+
# considered as a row-vector acted on by a permutation matrix from the
|
193
|
+
# right, v' = v P. The j-th column of the permutation matrix P is
|
194
|
+
# given by the p_j-th column of the identity matrix.
|
195
195
|
# The permutation <tt>self</tt> and the vector <tt>v</tt> must have the same length.
|
196
196
|
# ---
|
197
197
|
# * GSL::Permutation::permute_inverse(v)
|
198
198
|
#
|
199
|
-
# Applies the inverse of the permutation <tt>self</tt> to the elements of
|
200
|
-
# the vector <tt>v</tt>, considered as a row-vector acted on by an inverse
|
201
|
-
# permutation matrix from the right, v' = v P^T.
|
202
|
-
# Note that for permutation matrices the inverse is the same as the
|
203
|
-
# transpose. The j-th column of the permutation matrix P is given by
|
204
|
-
# the p_j-th column of the identity matrix.
|
199
|
+
# Applies the inverse of the permutation <tt>self</tt> to the elements of
|
200
|
+
# the vector <tt>v</tt>, considered as a row-vector acted on by an inverse
|
201
|
+
# permutation matrix from the right, v' = v P^T.
|
202
|
+
# Note that for permutation matrices the inverse is the same as the
|
203
|
+
# transpose. The j-th column of the permutation matrix P is given by
|
204
|
+
# the p_j-th column of the identity matrix.
|
205
205
|
# The permutation <tt>self</tt> and the vector <tt>v</tt> must have the same length.
|
206
206
|
# ---
|
207
207
|
# * GSL::Permutation.mul(pa, pb)
|
208
208
|
#
|
209
|
-
# Combines the two permutations <tt>pa</tt> and <tt>pb</tt> into a single
|
210
|
-
# permutation <tt>p</tt> and returns it.
|
211
|
-
# The permutation <tt>p</tt> is equivalent to applying <tt>pb</tt> first
|
212
|
-
# and then <tt>pa</tt>.
|
209
|
+
# Combines the two permutations <tt>pa</tt> and <tt>pb</tt> into a single
|
210
|
+
# permutation <tt>p</tt> and returns it.
|
211
|
+
# The permutation <tt>p</tt> is equivalent to applying <tt>pb</tt> first
|
212
|
+
# and then <tt>pa</tt>.
|
213
213
|
#
|
214
214
|
#
|
215
|
-
# {prev}[link:
|
216
|
-
# {next}[link:
|
215
|
+
# {prev}[link:rdoc/matrix_rdoc.html]
|
216
|
+
# {next}[link:rdoc/combi_rdoc.html]
|
217
217
|
#
|
218
|
-
# {Reference index}[link:
|
219
|
-
# {top}[link:
|
218
|
+
# {Reference index}[link:rdoc/ref_rdoc.html]
|
219
|
+
# {top}[link:index.html]
|
220
220
|
#
|
221
221
|
#
|
data/rdoc/poly.rdoc
CHANGED
@@ -1,26 +1,26 @@
|
|
1
1
|
#
|
2
2
|
# = Polynomials
|
3
3
|
# Contents:
|
4
|
-
# 1. {Polynomial Evaluation}[link:
|
5
|
-
# 1. {Solving polynomial equations}[link:
|
6
|
-
# 1. {Quadratic Equations}[link:
|
7
|
-
# 1. {Cubic Equations}[link:
|
8
|
-
# 1. {General Polynomial Equations}[link:
|
9
|
-
# 1. {GSL::Poly
|
10
|
-
# 1. {Constructors}[link:
|
11
|
-
# 1. {Methods}[link:
|
12
|
-
# 1. {Polynomial Fitting}[link:
|
13
|
-
# 1. {Divided-difference representations}[link:
|
14
|
-
# 1. {Extensions}[link:
|
15
|
-
# 1. {Special Polynomials}[link:
|
16
|
-
# 1. {Polynomial Operations}[link:
|
17
|
-
#
|
18
|
-
# ==
|
4
|
+
# 1. {Polynomial Evaluation}[link:rdoc/poly_rdoc.html#label-Polynomial+Evaluation]
|
5
|
+
# 1. {Solving polynomial equations}[link:rdoc/poly_rdoc.html#label-Solving+polynomial+equations]
|
6
|
+
# 1. {Quadratic Equations}[link:rdoc/poly_rdoc.html#label-Quadratic+Equations]
|
7
|
+
# 1. {Cubic Equations}[link:rdoc/poly_rdoc.html#label-Cubic+Equations]
|
8
|
+
# 1. {General Polynomial Equations}[link:rdoc/poly_rdoc.html#label-General+Polynomial+Equations]
|
9
|
+
# 1. {GSL::Poly class}[link:rdoc/poly_rdoc.html#label-Poly+class]
|
10
|
+
# 1. {Constructors}[link:rdoc/poly_rdoc.html#label-Constructors]
|
11
|
+
# 1. {Methods}[link:rdoc/poly_rdoc.html#label-Instance+Methods]
|
12
|
+
# 1. {Polynomial Fitting}[link:rdoc/poly_rdoc.html#label-Polynomial+fitting]
|
13
|
+
# 1. {Divided-difference representations}[link:rdoc/poly_rdoc.html#label-Divided-difference+representations]
|
14
|
+
# 1. {Extensions}[link:rdoc/poly_rdoc.html#label-Extensions]
|
15
|
+
# 1. {Special Polynomials}[link:rdoc/poly_rdoc.html#label-Special+Polynomials]
|
16
|
+
# 1. {Polynomial Operations}[link:rdoc/poly_rdoc.html#label-Polynomial+Operations]
|
17
|
+
#
|
18
|
+
# == Polynomial Evaluation
|
19
19
|
# ---
|
20
20
|
# * GSL::Poly.eval(c, x)
|
21
21
|
#
|
22
|
-
# Evaluates the polynomial <tt>c[0] + c[1]x + c[2]x^2 + ...</tt>.
|
23
|
-
# The polynomial coefficients <tt>c</tt> can be an <tt>Array</tt>,
|
22
|
+
# Evaluates the polynomial <tt>c[0] + c[1]x + c[2]x^2 + ...</tt>.
|
23
|
+
# The polynomial coefficients <tt>c</tt> can be an <tt>Array</tt>,
|
24
24
|
# a <tt>GSL::Vector</tt>, or an <tt>NArray</tt>. The evaluation point <tt>x</tt>
|
25
25
|
# is a <tt>Numeric</tt>, <tt>Array</tt>, <tt>GSL::Vector</tt> or <tt>NArray</tt>.
|
26
26
|
# From GSL 1.11, <tt>x</tt> can be a complex number, and <tt>c</tt> can be a complex polynomial given by a <tt>GSL::Vector::Complex</tt> or an <tt>Array</tt>.
|
@@ -54,17 +54,17 @@
|
|
54
54
|
# * GSL::Poly#eval_derivs(x, lenres)
|
55
55
|
#
|
56
56
|
# (GSL-1.13) Evaluate and return a polynomial and its derivatives. The output contains the values of d^k P/d x^k for the specified value of x starting with k = 0. If <tt>lenres</tt> is not given, <tt>lenres = LENGTH(self) + 1</tt> is used, therefore the last element of the output is 0.
|
57
|
-
#
|
57
|
+
#
|
58
58
|
# Ex.)
|
59
59
|
# >> ary = [1, 2, 3]
|
60
60
|
# => [1, 2, 3]
|
61
61
|
# >> GSL::Poly.eval_derivs(ary, 1)
|
62
62
|
# => [6.0, 8.0, 6.0, 0.0]
|
63
63
|
# >> na = NArray[1.0, 2, 3]
|
64
|
-
# => NArray.float(3):
|
64
|
+
# => NArray.float(3):
|
65
65
|
# [ 1.0, 2.0, 3.0 ]
|
66
66
|
# >> GSL::Poly.eval_derivs(na, 1)
|
67
|
-
# => NArray.float(4):
|
67
|
+
# => NArray.float(4):
|
68
68
|
# [ 6.0, 8.0, 6.0, 0.0 ]
|
69
69
|
# >> poly = GSL::Poly[1.0, 2, 3]
|
70
70
|
# => GSL::Poly
|
@@ -79,20 +79,20 @@
|
|
79
79
|
# => GSL::Poly
|
80
80
|
# [ 6.000e+00 8.000e+00 6.000e+00 ]
|
81
81
|
#
|
82
|
-
# ==
|
83
|
-
# ===
|
82
|
+
# == Solving polynomial equations
|
83
|
+
# === Quadratic Equations
|
84
84
|
# ---
|
85
85
|
# * GSL::Poly::solve_quadratic(a, b, c)
|
86
86
|
# * GSL::Poly::solve_quadratic([a, b, c])
|
87
87
|
#
|
88
88
|
# Find the real roots of the quadratic equation,
|
89
89
|
# a x^2 + b x + c = 0
|
90
|
-
# The coefficients are given by 3 numbers, or a Ruby array,
|
90
|
+
# The coefficients are given by 3 numbers, or a Ruby array,
|
91
91
|
# or a <tt>GSL::Vector</tt> object. The roots are returned as a <tt>GSL::Vector</tt>.
|
92
92
|
#
|
93
93
|
# * Ex: z^2 - 3z + 2 = 0
|
94
94
|
# >> GSL::Poly::solve_quadratic(1, -3, 2)
|
95
|
-
# => GSL::Vector:
|
95
|
+
# => GSL::Vector:
|
96
96
|
# [ 1.000e+00 2.000e+00 ]
|
97
97
|
#
|
98
98
|
#
|
@@ -102,21 +102,21 @@
|
|
102
102
|
#
|
103
103
|
# Find the complex roots of the quadratic equation,
|
104
104
|
# a z^2 + b z + z = 0
|
105
|
-
# The coefficients are given by 3 numbers or a Ruby array, or a
|
105
|
+
# The coefficients are given by 3 numbers or a Ruby array, or a
|
106
106
|
# <tt>GSL::Vector</tt>.
|
107
107
|
# The roots are returned as a <tt>GSL::Vector::Complex</tt> of two elements.
|
108
|
-
#
|
108
|
+
#
|
109
109
|
# * Ex: z^2 - 3z + 2 = 0
|
110
110
|
# >> require("gsl")
|
111
111
|
# => true
|
112
112
|
# >> GSL::Poly::complex_solve_quadratic(1, -3, 2)
|
113
|
-
# [ [1.000e+00 0.000e+00] [2.000e+00 0.000e+00] ]
|
113
|
+
# [ [1.000e+00 0.000e+00] [2.000e+00 0.000e+00] ]
|
114
114
|
# => #<GSL::Vector::Complex:0x764014>
|
115
115
|
# >> GSL::Poly::complex_solve_quadratic(1, -3, 2).real <--- Real part
|
116
|
-
# => GSL::Vector::View:
|
116
|
+
# => GSL::Vector::View:
|
117
117
|
# [ 1.000e+00 2.000e+00 ]
|
118
118
|
#
|
119
|
-
# ===
|
119
|
+
# === Cubic Equations
|
120
120
|
# ---
|
121
121
|
# * GSL::Poly::solve_cubic(same as solve_quadratic)
|
122
122
|
#
|
@@ -129,28 +129,28 @@
|
|
129
129
|
# This method finds the complex roots of the cubic equation,
|
130
130
|
# z^3 + a z^2 + b z + c = 0
|
131
131
|
#
|
132
|
-
# ===
|
132
|
+
# === General Polynomial Equations
|
133
133
|
# ---
|
134
134
|
# * GSL::Poly::complex_solve(c0, c1, c2,,, )
|
135
135
|
# * GSL::Poly::solve(c0, c1, c2,,, )
|
136
136
|
#
|
137
|
-
# Find the complex roots of the polynomial equation. Note that
|
137
|
+
# Find the complex roots of the polynomial equation. Note that
|
138
138
|
# the coefficients are given by "ascending" order.
|
139
139
|
#
|
140
|
-
# * Ex: x^2 - 3 x + 2 == 0
|
140
|
+
# * Ex: x^2 - 3 x + 2 == 0
|
141
141
|
# >> GSL::Poly::complex_solve(2, -3, 1) <--- different from Poly::quadratic_solve
|
142
142
|
# [ [1.000e+00 0.000e+00] [2.000e+00 0.000e+00] ]
|
143
143
|
# => #<GSL::Vector::Complex:0x75e614>
|
144
144
|
#
|
145
|
-
# ==
|
145
|
+
# == Poly class
|
146
146
|
# This class expresses polynomials of arbitrary orders.
|
147
147
|
#
|
148
|
-
# ===
|
148
|
+
# === Constructors
|
149
149
|
# ---
|
150
150
|
# * GSL::Poly.alloc(c0, c1, c2, ....)
|
151
151
|
# * GSL::Poly[c0, c1, c2, ....]
|
152
152
|
#
|
153
|
-
# This creates an instance of the <tt>GSL::Poly</tt> class,
|
153
|
+
# This creates an instance of the <tt>GSL::Poly</tt> class,
|
154
154
|
# which represents a polynomial
|
155
155
|
# c0 + c1 x + c2 x^2 + ....
|
156
156
|
# This class is derived from <tt>GSL::Vector</tt>.
|
@@ -158,13 +158,13 @@
|
|
158
158
|
# * Ex: x^2 - 3 x + 2
|
159
159
|
# poly = GSL::Poly.alloc([2, -3, 1])
|
160
160
|
#
|
161
|
-
# ===
|
161
|
+
# === Instance Methods
|
162
162
|
# ---
|
163
163
|
# * GSL::Poly#eval(x)
|
164
164
|
# * GSL::Poly#at(x)
|
165
165
|
#
|
166
|
-
# Evaluates the polynomial
|
167
|
-
# c[0] + c[1] x + c[2] x^2 + ... + c[len-1] x^{len-1}
|
166
|
+
# Evaluates the polynomial
|
167
|
+
# <tt>c[0] + c[1] x + c[2] x^2 + ... + c[len-1] x^{len-1}</tt>
|
168
168
|
# using Horner's method for stability. The argument <tt>x</tt> is a
|
169
169
|
# <tt>Numeric</tt>, <tt>GSL::Vector, Matrix</tt> or an <tt>Array</tt>.
|
170
170
|
#
|
@@ -175,10 +175,10 @@
|
|
175
175
|
#
|
176
176
|
# * Ex: z^2 - 3 z + 2 = 0:
|
177
177
|
# >> a = GSL::Poly[2, -3, 1]
|
178
|
-
# => GSL::Poly:
|
178
|
+
# => GSL::Poly:
|
179
179
|
# [ 2.000e+00 -3.000e+00 1.000e+00 ]
|
180
180
|
# >> a.solve_quadratic
|
181
|
-
# => GSL::Vector:
|
181
|
+
# => GSL::Vector:
|
182
182
|
# [ 1.000e+00 2.000e+00 ]
|
183
183
|
#
|
184
184
|
# ---
|
@@ -196,21 +196,21 @@
|
|
196
196
|
#
|
197
197
|
# * Ex: z^2 - 3 z + 2 = 0:
|
198
198
|
# >> a = GSL::Poly[2, -3, 1]
|
199
|
-
# => GSL::Poly:
|
199
|
+
# => GSL::Poly:
|
200
200
|
# [ 2.000e+00 -3.000e+00 1.000e+00 ]
|
201
201
|
# >> a.solve
|
202
202
|
# [ [1.000e+00 0.000e+00] [2.000e+00 0.000e+00] ]
|
203
203
|
# => #<GSL::Vector::Complex:0x35db28>
|
204
204
|
#
|
205
|
-
# ==
|
205
|
+
# == Polynomial fitting
|
206
206
|
# ---
|
207
207
|
# * GSL::Poly.fit(x, y, order)
|
208
208
|
# * GSL::Poly.wfit(x, w, y, order)
|
209
209
|
#
|
210
|
-
# Finds the coefficient of a polynomial of order <tt>order</tt>
|
210
|
+
# Finds the coefficient of a polynomial of order <tt>order</tt>
|
211
211
|
# that fits the vector data (<tt>x, y</tt>) in a least-square sense.
|
212
212
|
# This provides a higher-level interface to the method
|
213
|
-
# {GSL::Multifit#linear}[link:
|
213
|
+
# {GSL::Multifit#linear}[link:rdoc/fit_rdoc.html] in a case of polynomial fitting.
|
214
214
|
#
|
215
215
|
# Example:
|
216
216
|
# #!/usr/bin/env ruby
|
@@ -219,34 +219,34 @@
|
|
219
219
|
# x = GSL::Vector[1, 2, 3, 4, 5]
|
220
220
|
# y = GSL::Vector[5.5, 43.1, 128, 290.7, 498.4]
|
221
221
|
# # The results are stored in a polynomial "coef"
|
222
|
-
# coef, cov, chisq, status = Poly.fit(x, y, 3)
|
222
|
+
# coef, cov, chisq, status = Poly.fit(x, y, 3)
|
223
223
|
#
|
224
224
|
# x2 = GSL::Vector.linspace(1, 5, 20)
|
225
225
|
# graph([x, y], [x2, coef.eval(x2)], "-C -g 3 -S 4")
|
226
226
|
#
|
227
|
-
# ==
|
227
|
+
# == Divided-difference representations
|
228
228
|
#
|
229
229
|
# ---
|
230
230
|
# * GSL::Poly::dd_init(xa, ya)
|
231
231
|
#
|
232
|
-
# This method computes a divided-difference representation of the
|
232
|
+
# This method computes a divided-difference representation of the
|
233
233
|
# interpolating polynomial for the points <tt>(xa, ya)</tt>.
|
234
234
|
#
|
235
235
|
# ---
|
236
236
|
# * GSL::Poly::DividedDifference#eval(x)
|
237
237
|
#
|
238
|
-
# This method evaluates the polynomial stored in divided-difference form
|
238
|
+
# This method evaluates the polynomial stored in divided-difference form
|
239
239
|
# <tt>self</tt> at the point <tt>x</tt>.
|
240
240
|
#
|
241
241
|
# ---
|
242
242
|
# * GSL::Poly::DividedDifference#taylor(xp)
|
243
243
|
#
|
244
|
-
# This method converts the divided-difference representation of a polynomial
|
245
|
-
# to a Taylor expansion. On output the Taylor coefficients of the polynomial
|
244
|
+
# This method converts the divided-difference representation of a polynomial
|
245
|
+
# to a Taylor expansion. On output the Taylor coefficients of the polynomial
|
246
246
|
# expanded about the point <tt>xp</tt> are returned.
|
247
247
|
#
|
248
|
-
# ==
|
249
|
-
# ===
|
248
|
+
# == Extensions
|
249
|
+
# === Special Polynomials
|
250
250
|
# ---
|
251
251
|
# * GSL::Poly.hermite(n)
|
252
252
|
#
|
@@ -255,13 +255,13 @@
|
|
255
255
|
# H(x; n+1) = 2 x H(x; n) - 2 n H(x; n-1)
|
256
256
|
# * Ex:
|
257
257
|
# >> GSL::Poly.hermite(2)
|
258
|
-
# => GSL::Poly::Int:
|
258
|
+
# => GSL::Poly::Int:
|
259
259
|
# [ -2 0 4 ] <----- 4x^2 - 2
|
260
260
|
# >> GSL::Poly.hermite(5)
|
261
|
-
# => GSL::Poly::Int:
|
261
|
+
# => GSL::Poly::Int:
|
262
262
|
# [ 0 120 0 -160 0 32 ] <----- 32x^5 - 160x^3 + 120x
|
263
263
|
# >> GSL::Poly.hermite(7)
|
264
|
-
# => GSL::Poly::Int:
|
264
|
+
# => GSL::Poly::Int:
|
265
265
|
# [ 0 -1680 0 3360 0 -1344 0 128 ]
|
266
266
|
#
|
267
267
|
# ---
|
@@ -300,22 +300,22 @@
|
|
300
300
|
# rb(main):001:0> require("gsl")
|
301
301
|
# => true
|
302
302
|
# >> GSL::Poly.laguerre(0)
|
303
|
-
# => GSL::Poly::Int:
|
303
|
+
# => GSL::Poly::Int:
|
304
304
|
# [ 1 ] <--- 1
|
305
305
|
# >> GSL::Poly.laguerre(1)
|
306
|
-
# => GSL::Poly::Int:
|
306
|
+
# => GSL::Poly::Int:
|
307
307
|
# [ 1 -1 ] <--- -x + 1
|
308
308
|
# >> GSL::Poly.laguerre(2)
|
309
|
-
# => GSL::Poly::Int:
|
309
|
+
# => GSL::Poly::Int:
|
310
310
|
# [ 2 -4 1 ] <--- (x^2 - 4x + 2)/2!
|
311
311
|
# >> GSL::Poly.laguerre(3)
|
312
|
-
# => GSL::Poly::Int:
|
312
|
+
# => GSL::Poly::Int:
|
313
313
|
# [ 6 -18 9 -1 ] <--- (-x^3 + 9x^2 - 18x + 6)/3!
|
314
314
|
# >> GSL::Poly.laguerre(4)
|
315
|
-
# => GSL::Poly::Int:
|
315
|
+
# => GSL::Poly::Int:
|
316
316
|
# [ 24 -96 72 -16 1 ] <--- (x^4 - 16x^3 + 72x^2 - 96x + 24)/4!
|
317
|
-
#
|
318
|
-
# ===
|
317
|
+
#
|
318
|
+
# === Polynomial Operations
|
319
319
|
# ---
|
320
320
|
# * GSL::Poly#conv
|
321
321
|
# * GSL::Poly#deconv
|
@@ -325,11 +325,11 @@
|
|
325
325
|
# * GSL::Poly#compan
|
326
326
|
#
|
327
327
|
#
|
328
|
-
# {prev}[link:
|
329
|
-
# {next}[link:
|
328
|
+
# {prev}[link:rdoc/complex_rdoc.html]
|
329
|
+
# {next}[link:rdoc/sf_rdoc.html]
|
330
330
|
#
|
331
|
-
# {Reference index}[link:
|
332
|
-
# {top}[link:
|
331
|
+
# {Reference index}[link:rdoc/ref_rdoc.html]
|
332
|
+
# {top}[link:index.html]
|
333
333
|
#
|
334
334
|
#
|
335
335
|
#
|