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/fft.rdoc
CHANGED
@@ -1,67 +1,67 @@
|
|
1
1
|
#
|
2
2
|
# = Fast Fourier Transforms
|
3
3
|
# Contents:
|
4
|
-
# 1. {Mathematical Definitions}[link:
|
5
|
-
# 1. {Complex data FFTs}[link:
|
6
|
-
# 1. {Overview of complex data FFTs}[link:
|
7
|
-
# 1. {Radix-2 FFT routines for complex data}[link:
|
8
|
-
# 1. {Example of the complex Radix-2 FFT}[link:
|
9
|
-
# 1. {Mixed-radix FFT routines for complex data}[link:
|
10
|
-
# 1. {GSL::FFT::ComplexWavetable class}[link:
|
11
|
-
# 1. {GSL::FFT::ComplexWorkspace class}[link:
|
12
|
-
# 1. {Methods to compute the transform}[link:
|
13
|
-
# 1. {Example of the mixed-radix FFT}[link:
|
14
|
-
# 1. {Real data FFTs}[link:
|
15
|
-
# 1. {Overview of real data FFTs}[link:
|
16
|
-
# 1. {Radix-2 FFT routines for real data}[link:
|
17
|
-
#
|
18
|
-
#
|
19
|
-
# 1. {Wavetable and Workspace classes}[link:
|
20
|
-
# 1. {Methods for real FFTs}[link:
|
21
|
-
#
|
22
|
-
#
|
23
|
-
# ==
|
24
|
-
# Fast Fourier Transforms are efficient algorithms for calculating the discrete
|
25
|
-
# fourier transform (DFT),
|
26
|
-
#
|
27
|
-
# The DFT usually arises as an approximation to the continuous fourier transform
|
28
|
-
# when functions are sampled at discrete intervals in space or time.
|
29
|
-
# The naive evaluation of the discrete fourier transform is a matrix-vector
|
30
|
-
# multiplication W\vec{z}. A general matrix-vector multiplication takes O(N^2)
|
31
|
-
# operations for N data-points. Fast fourier transform algorithms use a
|
32
|
-
# divide-and-conquer strategy to factorize the matrix W into smaller
|
33
|
-
# sub-matrices, corresponding to the integer factors of the length N.
|
34
|
-
# If N can be factorized into a product of integers f_1 f_2 ... f_n then the
|
35
|
-
# DFT can be computed in O(N \sum f_i) operations. For a radix-2 FFT this
|
36
|
-
# gives an operation count of O(N \log_2 N).
|
4
|
+
# 1. {Mathematical Definitions}[link:rdoc/fft_rdoc.html#label-Mathematical+Definitions]
|
5
|
+
# 1. {Complex data FFTs}[link:rdoc/fft_rdoc.html#label-Complex+data+FFTs]
|
6
|
+
# 1. {Overview of complex data FFTs}[link:rdoc/fft_rdoc.html#label-Overview+of+complex+data+FFTs]
|
7
|
+
# 1. {Radix-2 FFT routines for complex data}[link:rdoc/fft_rdoc.html#label-Radix-2+FFT+routines+for+complex+data]
|
8
|
+
# 1. {Example of the complex Radix-2 FFT}[link:rdoc/fft_rdoc.html#label-Example+of+complex+Radix-2+FFT]
|
9
|
+
# 1. {Mixed-radix FFT routines for complex data}[link:rdoc/fft_rdoc.html#label-Mixed-radix+FFT+routines+for+complex+data]
|
10
|
+
# 1. {GSL::FFT::ComplexWavetable class}[link:rdoc/fft_rdoc.html#label-ComplexWavetable+class]
|
11
|
+
# 1. {GSL::FFT::ComplexWorkspace class}[link:rdoc/fft_rdoc.html#label-ComplexWorkspace+class]
|
12
|
+
# 1. {Methods to compute the transform}[link:rdoc/fft_rdoc.html#label-Methods+to+compute+transform]
|
13
|
+
# 1. {Example of the mixed-radix FFT}[link:rdoc/fft_rdoc.html#label-Example+to+use+the+mixed-radix+FFT+algorithm]
|
14
|
+
# 1. {Real data FFTs}[link:rdoc/fft_rdoc.html#label-Real+data+FFTs]
|
15
|
+
# 1. {Overview of real data FFTs}[link:rdoc/fft_rdoc.html#label-Overview+of+real+data+FFTs]
|
16
|
+
# 1. {Radix-2 FFT routines for real data}[link:rdoc/fft_rdoc.html#label-Radix-2+FFT+routines+for+real+data]
|
17
|
+
# 1. {Mixed-radix FFT routines for real data}[link:rdoc/fft_rdoc.html#label-Mixed-radix+FFT+routines+for+real+data]
|
18
|
+
# 1. {Data storage scheme}[link:rdoc/fft_rdoc.html#label-Data+storage+scheme]
|
19
|
+
# 1. {Wavetable and Workspace classes}[link:rdoc/fft_rdoc.html#label-Wavetable+and+Workspace+classes]
|
20
|
+
# 1. {Methods for real FFTs}[link:rdoc/fft_rdoc.html#label-Methods+for+mixed-radix+real+FFTs]
|
21
|
+
# 1. {Examples}[link:rdoc/fft_rdoc.html#label-Examples]
|
22
|
+
#
|
23
|
+
# == Mathematical Definitions
|
24
|
+
# Fast Fourier Transforms are efficient algorithms for calculating the discrete
|
25
|
+
# fourier transform (DFT),
|
26
|
+
#
|
27
|
+
# The DFT usually arises as an approximation to the continuous fourier transform
|
28
|
+
# when functions are sampled at discrete intervals in space or time.
|
29
|
+
# The naive evaluation of the discrete fourier transform is a matrix-vector
|
30
|
+
# multiplication W\vec{z}. A general matrix-vector multiplication takes O(N^2)
|
31
|
+
# operations for N data-points. Fast fourier transform algorithms use a
|
32
|
+
# divide-and-conquer strategy to factorize the matrix W into smaller
|
33
|
+
# sub-matrices, corresponding to the integer factors of the length N.
|
34
|
+
# If N can be factorized into a product of integers f_1 f_2 ... f_n then the
|
35
|
+
# DFT can be computed in O(N \sum f_i) operations. For a radix-2 FFT this
|
36
|
+
# gives an operation count of O(N \log_2 N).
|
37
37
|
#
|
38
38
|
# All the FFT functions offer three types of transform: forwards, inverse and
|
39
|
-
# backwards, based on the same mathematical definitions. The definition of the
|
40
|
-
# forward fourier transform, x = FFT(z), is, and the definition of the inverse
|
41
|
-
# fourier transform, x = IFFT(z), is, The factor of 1/N makes this a true
|
42
|
-
# inverse. For example, a call to gsl_fft_complex_forward followed by a call
|
43
|
-
# to gsl_fft_complex_inverse should return the original data (within numerical
|
44
|
-
# errors).
|
45
|
-
#
|
46
|
-
# In general there are two possible choices for the sign of the exponential
|
39
|
+
# backwards, based on the same mathematical definitions. The definition of the
|
40
|
+
# forward fourier transform, x = FFT(z), is, and the definition of the inverse
|
41
|
+
# fourier transform, x = IFFT(z), is, The factor of 1/N makes this a true
|
42
|
+
# inverse. For example, a call to gsl_fft_complex_forward followed by a call
|
43
|
+
# to gsl_fft_complex_inverse should return the original data (within numerical
|
44
|
+
# errors).
|
45
|
+
#
|
46
|
+
# In general there are two possible choices for the sign of the exponential
|
47
47
|
# in the transform/ inverse-transform pair. GSL follows the same convention as
|
48
|
-
# FFTPACK, using a negative exponential for the forward transform.
|
49
|
-
# The advantage of this convention is that the inverse transform recreates
|
50
|
-
# the original function with simple fourier synthesis. Numerical Recipes uses
|
51
|
-
# the opposite convention, a positive exponential in the forward transform.
|
48
|
+
# FFTPACK, using a negative exponential for the forward transform.
|
49
|
+
# The advantage of this convention is that the inverse transform recreates
|
50
|
+
# the original function with simple fourier synthesis. Numerical Recipes uses
|
51
|
+
# the opposite convention, a positive exponential in the forward transform.
|
52
52
|
#
|
53
|
-
# The backwards FFT is simply our terminology for an unscaled version of the
|
54
|
-
# inverse FFT, When the overall scale of the result is unimportant it is often
|
53
|
+
# The backwards FFT is simply our terminology for an unscaled version of the
|
54
|
+
# inverse FFT, When the overall scale of the result is unimportant it is often
|
55
55
|
# convenient to use the backwards FFT instead of the inverse to save unnecessary
|
56
|
-
# divisions.
|
56
|
+
# divisions.
|
57
57
|
#
|
58
58
|
#
|
59
|
-
# ==
|
60
|
-
# ===
|
59
|
+
# == Complex data FFTs
|
60
|
+
# === Overview of complex data FFTs
|
61
61
|
# The complex data FFT routines are provided as instance methods of
|
62
|
-
# {GSL::Vector::Complex}[link:
|
62
|
+
# {GSL::Vector::Complex}[link:rdoc/vector_complex_rdoc.html].
|
63
63
|
#
|
64
|
-
# Here is a table which shows the layout of the array data, and the correspondence
|
64
|
+
# Here is a table which shows the layout of the array data, and the correspondence
|
65
65
|
# between the time-domain complex data z, and the frequency-domain complex data x.
|
66
66
|
#
|
67
67
|
# index z x = FFT(z)
|
@@ -82,7 +82,7 @@
|
|
82
82
|
# frequencies +1/(2 Delta), -1/(2 Delta) which are equivalent. If N is odd then
|
83
83
|
# general structure of the table above still applies, but N/2 does not appear.
|
84
84
|
#
|
85
|
-
# {GSL::Vector::Complex}[link:
|
85
|
+
# {GSL::Vector::Complex}[link:rdoc/vector_complex_rdoc.html] provides four methods for
|
86
86
|
# shifting the frequency domain data between <b>FFT order</b>, shown in the table
|
87
87
|
# above, and <b>natural order</b>, which has the most negative freqeuncy component
|
88
88
|
# first, the zero frequency component in the middle, and the most positive
|
@@ -110,14 +110,14 @@
|
|
110
110
|
# <tt>self</tt>. Note that <tt>#fftshift</tt> and <tt>#ifftshift</tt> are equivalent
|
111
111
|
# for even lengths, but not for odd lengths.
|
112
112
|
#
|
113
|
-
# ===
|
114
|
-
# The radix-2 algorithms are simple and compact, although not necessarily the
|
115
|
-
# most efficient. They use the Cooley-Tukey algorithm to compute complex
|
116
|
-
# FFTs for lengths which are a power of 2 -- no additional storage is required.
|
117
|
-
# The corresponding self-sorting mixed-radix routines offer better performance
|
113
|
+
# === Radix-2 FFT routines for complex data
|
114
|
+
# The radix-2 algorithms are simple and compact, although not necessarily the
|
115
|
+
# most efficient. They use the Cooley-Tukey algorithm to compute complex
|
116
|
+
# FFTs for lengths which are a power of 2 -- no additional storage is required.
|
117
|
+
# The corresponding self-sorting mixed-radix routines offer better performance
|
118
118
|
# at the expense of requiring additional working space.
|
119
119
|
#
|
120
|
-
# <b>The FFT methods described below return FFTed data, and the input vector is
|
120
|
+
# <b>The FFT methods described below return FFTed data, and the input vector is
|
121
121
|
# not changed. Use methods with '!' as <tt>tranform!</tt> for in-place transform.</b>
|
122
122
|
#
|
123
123
|
# ---
|
@@ -136,7 +136,7 @@
|
|
136
136
|
#
|
137
137
|
#
|
138
138
|
# The sign argument can be either <tt>GSL::FFT::FORWARD</tt> or <tt>GSL::FFT::BACKWARD</tt>.
|
139
|
-
#
|
139
|
+
#
|
140
140
|
# ---
|
141
141
|
# * GSL::Vector::Complex#radix2_dif_forward
|
142
142
|
# * GSL::Vector::Complex#radix2_dif_backward
|
@@ -146,10 +146,10 @@
|
|
146
146
|
#
|
147
147
|
# These are decimation-in-frequency versions of the radix-2 FFT functions.
|
148
148
|
#
|
149
|
-
# ====
|
150
|
-
# Here is an example program which computes the FFT of a short pulse in a
|
151
|
-
# sample of length 128. To make the resulting Fourier transform real the pulse
|
152
|
-
# is defined for equal positive and negative times (-10 ... 10), where the
|
149
|
+
# ==== Example of complex Radix-2 FFT
|
150
|
+
# Here is an example program which computes the FFT of a short pulse in a
|
151
|
+
# sample of length 128. To make the resulting Fourier transform real the pulse
|
152
|
+
# is defined for equal positive and negative times (-10 ... 10), where the
|
153
153
|
# negative times wrap around the end of the array.
|
154
154
|
#
|
155
155
|
# require("gsl")
|
@@ -176,23 +176,23 @@
|
|
176
176
|
# printf("%d %e %e\n", i, ffted[i].re, ffted[i].im)
|
177
177
|
# end
|
178
178
|
#
|
179
|
-
# ===
|
179
|
+
# === Mixed-radix FFT routines for complex data
|
180
180
|
#
|
181
|
-
# ====
|
181
|
+
# ==== ComplexWavetable class
|
182
182
|
# ---
|
183
183
|
# * GSL::FFT::ComplexWavetable.alloc(n)
|
184
184
|
#
|
185
185
|
#
|
186
186
|
# This method prepares a trigonometric lookup table for a complex FFT of length <tt>n</tt>.
|
187
|
-
# The length <tt>n</tt> is factorized into a product of subtransforms, and the factors and their
|
188
|
-
# trigonometric coefficients are stored in the wavetable. The trigonometric coefficients are
|
189
|
-
# computed using direct calls to sin and cos, for accuracy. Recursion relations could be used
|
190
|
-
# to compute the lookup table faster, but if an application performs many FFTs of the same
|
191
|
-
# length then this computation is a one-off overhead which does not affect the final
|
187
|
+
# The length <tt>n</tt> is factorized into a product of subtransforms, and the factors and their
|
188
|
+
# trigonometric coefficients are stored in the wavetable. The trigonometric coefficients are
|
189
|
+
# computed using direct calls to sin and cos, for accuracy. Recursion relations could be used
|
190
|
+
# to compute the lookup table faster, but if an application performs many FFTs of the same
|
191
|
+
# length then this computation is a one-off overhead which does not affect the final
|
192
192
|
# throughput.
|
193
193
|
#
|
194
194
|
# The <tt>Wavetable</tt> object can be used repeatedly for any transform of the same length.
|
195
|
-
# The table is not modified by calls to any of the other FFT functions. The same wavetable
|
195
|
+
# The table is not modified by calls to any of the other FFT functions. The same wavetable
|
196
196
|
# can be used for both forward and backward (or inverse) transforms of a given length.
|
197
197
|
#
|
198
198
|
# ---
|
@@ -201,14 +201,14 @@
|
|
201
201
|
# * GSL::FFT::ComplexWavetable#factor
|
202
202
|
#
|
203
203
|
#
|
204
|
-
# ====
|
204
|
+
# ==== ComplexWorkspace class
|
205
205
|
# ---
|
206
206
|
# * GSL::FFT::ComplexWorkspace.alloc(n)
|
207
207
|
#
|
208
208
|
#
|
209
209
|
# Creates a workspace for a complex transform of length <tt>n</tt>.
|
210
210
|
#
|
211
|
-
# ====
|
211
|
+
# ==== Methods to compute transform
|
212
212
|
# <b>The FFT methods described below return FFTed data, and the input vector is not changed. Use methods with '!' as <tt>tranform!</tt> for in-place transform.</b>
|
213
213
|
#
|
214
214
|
# ---
|
@@ -226,16 +226,16 @@
|
|
226
226
|
# There is no restriction on the length. Efficient modules are provided for
|
227
227
|
# subtransforms of length 2, 3, 4, 5, 6 and 7. Any remaining factors are
|
228
228
|
# computed with a slow, O(n^2), general-n module.
|
229
|
-
#
|
229
|
+
#
|
230
230
|
# The caller can supply a <tt>table</tt> containing the trigonometric lookup
|
231
231
|
# tables and a workspace <tt>work</tt> (they are optional).
|
232
|
-
#
|
232
|
+
#
|
233
233
|
# The sign argument for the method <tt>transform</tt> can be either
|
234
234
|
# <tt>GSL::FFT::FORWARD</tt> or <tt>GSL::FFT::BACKWARD</tt>.
|
235
235
|
#
|
236
236
|
# These methods return the FFTed data, and the input data is not changed.
|
237
237
|
#
|
238
|
-
# ====
|
238
|
+
# ==== Example to use the mixed-radix FFT algorithm
|
239
239
|
# require 'gsl'
|
240
240
|
# include GSL
|
241
241
|
#
|
@@ -259,11 +259,11 @@
|
|
259
259
|
# printf("%d %e %e\n", i, data[i].re, data[i].im)
|
260
260
|
# end
|
261
261
|
#
|
262
|
-
# ==
|
263
|
-
# ===
|
262
|
+
# == Real data FFTs
|
263
|
+
# === Overview of real data FFTs
|
264
264
|
#
|
265
265
|
# The functions for real data FFTs are provided as instance methods of
|
266
|
-
# {GSL::Vector}[link:
|
266
|
+
# {GSL::Vector}[link:rdoc/vector_rdoc.html]. While they are similar to those for
|
267
267
|
# complex data, there is an important difference in the data storage layout
|
268
268
|
# between forward and inverse transforms. The Fourier transform of a real
|
269
269
|
# sequence is not real. It is a complex sequence with a special symmetry. A
|
@@ -274,7 +274,7 @@
|
|
274
274
|
# Forward transforms of real sequences produce half complex sequences of the same
|
275
275
|
# length. Backward and inverse transforms of half complex sequences produce real
|
276
276
|
# sequences of the same length. In both cases, the input and output sequences
|
277
|
-
# are instances of {GSL::Vector}[link:
|
277
|
+
# are instances of {GSL::Vector}[link:rdoc/vector_rdoc.html].
|
278
278
|
#
|
279
279
|
# The precise storage arrangements of half complex seqeunces depend on the
|
280
280
|
# algorithm, and are different for radix-2 and mixed-radix routines. The radix-2
|
@@ -286,9 +286,9 @@
|
|
286
286
|
# complex sequence produces by a radix-2 forward transform <b>cannot</b> be
|
287
287
|
# recovered by a mixed-radix inverse transform (and vice versa).
|
288
288
|
#
|
289
|
-
# ===
|
289
|
+
# === Radix-2 FFT routines for real data
|
290
290
|
# The routines for readix-2 real FFTs are provided as instance methods of
|
291
|
-
# {GSL::Vector}[link:
|
291
|
+
# {GSL::Vector}[link:rdoc/vector_rdoc.html].
|
292
292
|
#
|
293
293
|
# <b>The FFT methods described below return FFTed data, and the input vector is
|
294
294
|
# not changed. Use methods with '!' as <tt>radix2_tranform!</tt> for in-place
|
@@ -312,23 +312,23 @@
|
|
312
312
|
#
|
313
313
|
# These methods return the FFTed data, and the input data is not changed.
|
314
314
|
#
|
315
|
-
# The following table shows the correspondence between the output <tt>self</tt>
|
316
|
-
# and the equivalent results obtained by considering the input data as a
|
315
|
+
# The following table shows the correspondence between the output <tt>self</tt>
|
316
|
+
# and the equivalent results obtained by considering the input data as a
|
317
317
|
# complex sequence with zero imaginary part,
|
318
318
|
#
|
319
|
-
# complex[0].real = self[0]
|
320
|
-
# complex[0].imag = 0
|
321
|
-
# complex[1].real = self[1]
|
319
|
+
# complex[0].real = self[0]
|
320
|
+
# complex[0].imag = 0
|
321
|
+
# complex[1].real = self[1]
|
322
322
|
# complex[1].imag = self[N-1]
|
323
323
|
# ............... ................
|
324
324
|
# complex[k].real = self[k]
|
325
|
-
# complex[k].imag = self[N-k]
|
325
|
+
# complex[k].imag = self[N-k]
|
326
326
|
# ............... ................
|
327
327
|
# complex[N/2].real = self[N/2]
|
328
328
|
# complex[N/2].real = 0
|
329
329
|
# ............... ................
|
330
330
|
# complex[k'].real = self[k] k' = N - k
|
331
|
-
# complex[k'].imag = -self[N-k]
|
331
|
+
# complex[k'].imag = -self[N-k]
|
332
332
|
# ............... ................
|
333
333
|
# complex[N-1].real = self[1]
|
334
334
|
# complex[N-1].imag = -self[N-1]
|
@@ -344,16 +344,16 @@
|
|
344
344
|
# half-complex sequence data stored according the output scheme used by
|
345
345
|
# gsl_fft_real_radix2. The result is a real array stored in natural order.
|
346
346
|
#
|
347
|
-
# ==
|
347
|
+
# == Mixed-radix FFT routines for real data
|
348
348
|
#
|
349
|
-
# This section describes mixed-radix FFT algorithms for real data.
|
350
|
-
# The mixed-radix functions work for FFTs of any length. They are a
|
351
|
-
# reimplementation of the real-FFT routines in the Fortran FFTPACK library
|
352
|
-
# by Paul Swarztrauber.
|
353
|
-
# The theory behind the algorithm is explained in the article
|
354
|
-
# <tt>Fast Mixed-Radix Real Fourier Transforms</tt> by Clive Temperton.
|
355
|
-
# The routines here use the same indexing scheme and basic algorithms as
|
356
|
-
# FFTPACK.
|
349
|
+
# This section describes mixed-radix FFT algorithms for real data.
|
350
|
+
# The mixed-radix functions work for FFTs of any length. They are a
|
351
|
+
# reimplementation of the real-FFT routines in the Fortran FFTPACK library
|
352
|
+
# by Paul Swarztrauber.
|
353
|
+
# The theory behind the algorithm is explained in the article
|
354
|
+
# <tt>Fast Mixed-Radix Real Fourier Transforms</tt> by Clive Temperton.
|
355
|
+
# The routines here use the same indexing scheme and basic algorithms as
|
356
|
+
# FFTPACK.
|
357
357
|
#
|
358
358
|
# The functions use the FFTPACK storage convention for half-complex sequences.
|
359
359
|
# In this convention the half-complex transform of a real sequence is stored with
|
@@ -363,22 +363,22 @@
|
|
363
363
|
# component is never stored. It is known to be zero since the zero frequency
|
364
364
|
# component is simply the sum of the input data (all real). For a sequence of
|
365
365
|
# even length the imaginary part of the frequency n/2 is not stored either, since
|
366
|
-
# the symmetry z_k = z_{N-k}^* implies that this is purely real too.
|
366
|
+
# the symmetry z_k = z_{N-k}^* implies that this is purely real too.
|
367
367
|
#
|
368
368
|
#
|
369
|
-
# ===
|
369
|
+
# === Data storage scheme
|
370
370
|
#
|
371
|
-
# The storage scheme is best shown by some examples.
|
372
|
-
# The table below shows the output for an odd-length sequence, n=5.
|
373
|
-
# The two columns give the correspondence between the 5 values in the
|
374
|
-
# half-complex sequence computed <tt>real_transform</tt>, <tt>halfcomplex[]</tt>
|
375
|
-
# and the values <tt>complex[]</tt> that would be returned if the same real input
|
376
|
-
# sequence were passed to <tt>complex_backward</tt> as a complex sequence
|
371
|
+
# The storage scheme is best shown by some examples.
|
372
|
+
# The table below shows the output for an odd-length sequence, n=5.
|
373
|
+
# The two columns give the correspondence between the 5 values in the
|
374
|
+
# half-complex sequence computed <tt>real_transform</tt>, <tt>halfcomplex[]</tt>
|
375
|
+
# and the values <tt>complex[]</tt> that would be returned if the same real input
|
376
|
+
# sequence were passed to <tt>complex_backward</tt> as a complex sequence
|
377
377
|
# (with imaginary parts set to 0),
|
378
378
|
#
|
379
|
-
# complex[0].real = halfcomplex[0]
|
379
|
+
# complex[0].real = halfcomplex[0]
|
380
380
|
# complex[0].imag = 0
|
381
|
-
# complex[1].real = halfcomplex[1]
|
381
|
+
# complex[1].real = halfcomplex[1]
|
382
382
|
# complex[1].imag = halfcomplex[2]
|
383
383
|
# complex[2].real = halfcomplex[3]
|
384
384
|
# complex[2].imag = halfcomplex[4]
|
@@ -388,46 +388,46 @@
|
|
388
388
|
# complex[4].imag = -halfcomplex[2]
|
389
389
|
#
|
390
390
|
# The upper elements of the <tt>complex</tt> array, <tt>complex[3]</tt> and <tt>complex[4]</tt>
|
391
|
-
# are filled in using the symmetry condition. The imaginary part of
|
391
|
+
# are filled in using the symmetry condition. The imaginary part of
|
392
392
|
# the zero-frequency term <tt>complex[0].imag</tt> is known to be zero by the symmetry.
|
393
393
|
#
|
394
|
-
# The next table shows the output for an even-length sequence,
|
394
|
+
# The next table shows the output for an even-length sequence,
|
395
395
|
# n=5 In the even case there are two values which are purely real,
|
396
396
|
#
|
397
397
|
# complex[0].real = halfcomplex[0]
|
398
398
|
# complex[0].imag = 0
|
399
|
-
# complex[1].real = halfcomplex[1]
|
400
|
-
# complex[1].imag = halfcomplex[2]
|
401
|
-
# complex[2].real = halfcomplex[3]
|
402
|
-
# complex[2].imag = halfcomplex[4]
|
403
|
-
# complex[3].real = halfcomplex[5]
|
404
|
-
# complex[3].imag = 0
|
405
|
-
# complex[4].real = halfcomplex[3]
|
399
|
+
# complex[1].real = halfcomplex[1]
|
400
|
+
# complex[1].imag = halfcomplex[2]
|
401
|
+
# complex[2].real = halfcomplex[3]
|
402
|
+
# complex[2].imag = halfcomplex[4]
|
403
|
+
# complex[3].real = halfcomplex[5]
|
404
|
+
# complex[3].imag = 0
|
405
|
+
# complex[4].real = halfcomplex[3]
|
406
406
|
# complex[4].imag = -halfcomplex[4]
|
407
|
-
# complex[5].real = halfcomplex[1]
|
408
|
-
# complex[5].imag = -halfcomplex[2]
|
407
|
+
# complex[5].real = halfcomplex[1]
|
408
|
+
# complex[5].imag = -halfcomplex[2]
|
409
409
|
#
|
410
|
-
# The upper elements of the <tt>complex</tt> array, <tt>complex[4]</tt>
|
411
|
-
# and <tt>complex[5]</tt> are filled in using the symmetry condition.
|
410
|
+
# The upper elements of the <tt>complex</tt> array, <tt>complex[4]</tt>
|
411
|
+
# and <tt>complex[5]</tt> are filled in using the symmetry condition.
|
412
412
|
# Both <tt>complex[0].imag</tt> and <tt>complex[3].imag</tt> are known to be zero.
|
413
413
|
#
|
414
|
-
# ====
|
414
|
+
# ==== Wavetable and Workspace classes
|
415
415
|
# ---
|
416
416
|
# * GSL::FFT::RealWavetable.alloc(n)
|
417
417
|
# * GSL::FFT::HalfComplexWavetable.alloc(n)
|
418
418
|
#
|
419
419
|
#
|
420
|
-
# These methods create trigonometric lookup tables for an FFT of size <tt>n</tt>
|
421
|
-
# real elements. The length <tt>n</tt> is factorized into a product of subtransforms,
|
420
|
+
# These methods create trigonometric lookup tables for an FFT of size <tt>n</tt>
|
421
|
+
# real elements. The length <tt>n</tt> is factorized into a product of subtransforms,
|
422
422
|
# and the factors and their trigonometric coefficients are stored in the wavetable.
|
423
|
-
# The trigonometric coefficients are computed using direct calls to sin and cos,
|
424
|
-
# for accuracy. Recursion relations could be used to compute the lookup table
|
425
|
-
# faster, but if an application performs many FFTs of the same length then
|
426
|
-
# computing the wavetable is a one-off overhead which does not affect the final
|
423
|
+
# The trigonometric coefficients are computed using direct calls to sin and cos,
|
424
|
+
# for accuracy. Recursion relations could be used to compute the lookup table
|
425
|
+
# faster, but if an application performs many FFTs of the same length then
|
426
|
+
# computing the wavetable is a one-off overhead which does not affect the final
|
427
427
|
# throughput.
|
428
428
|
#
|
429
|
-
# The wavetable structure can be used repeatedly for any transform of the same
|
430
|
-
# length. The table is not modified by calls to any of the other FFT functions.
|
429
|
+
# The wavetable structure can be used repeatedly for any transform of the same
|
430
|
+
# length. The table is not modified by calls to any of the other FFT functions.
|
431
431
|
# The appropriate type of wavetable must be used for forward real or inverse
|
432
432
|
# half-complex transforms.
|
433
433
|
#
|
@@ -439,7 +439,7 @@
|
|
439
439
|
# <tt>n</tt>. The same workspace can be used for both forward real and inverse
|
440
440
|
# halfcomplex transforms.
|
441
441
|
#
|
442
|
-
# ====
|
442
|
+
# ==== Methods for mixed-radix real FFTs
|
443
443
|
#
|
444
444
|
# <b>The FFT methods described below return FFTed data, and the input vector is not changed. Use methods with '!' as <tt>real_tranform!</tt> for in-place transform.</b>
|
445
445
|
#
|
@@ -454,12 +454,12 @@
|
|
454
454
|
# <tt>real_transform</tt> <tt>self</tt> is an array of time-ordered real data. For
|
455
455
|
# <tt>halfcomplex_transform</tt> <tt>self</tt> contains Fourier coefficients in the
|
456
456
|
# half-complex ordering described above. There is no restriction on the
|
457
|
-
# length <tt>n</tt>.
|
457
|
+
# length <tt>n</tt>.
|
458
458
|
#
|
459
|
-
# Efficient modules are provided for subtransforms of length 2, 3, 4 and 5.
|
460
|
-
# Any remaining factors are computed with a slow, O(n^2), general-n module.
|
459
|
+
# Efficient modules are provided for subtransforms of length 2, 3, 4 and 5.
|
460
|
+
# Any remaining factors are computed with a slow, O(n^2), general-n module.
|
461
461
|
#
|
462
|
-
# The caller can supply a <tt>table</tt> containing trigonometric lookup tables
|
462
|
+
# The caller can supply a <tt>table</tt> containing trigonometric lookup tables
|
463
463
|
# and a workspace <tt>work</tt> (optional).
|
464
464
|
#
|
465
465
|
# These methods return the FFTed data, and the input data is not changed.
|
@@ -470,9 +470,9 @@
|
|
470
470
|
# * GSL::Vector#ifft
|
471
471
|
#
|
472
472
|
#
|
473
|
-
# ==
|
473
|
+
# == Examples
|
474
474
|
#
|
475
|
-
# ===
|
475
|
+
# === Example 1
|
476
476
|
#
|
477
477
|
# #!/usr/bin/env ruby
|
478
478
|
# require("gsl")
|
@@ -493,7 +493,7 @@
|
|
493
493
|
# f = Vector.linspace(0, SAMPLING/2, mag.size)
|
494
494
|
# graph(f, mag, "-C -g 3 -x 0 200 -X 'Frequency [Hz]'")
|
495
495
|
#
|
496
|
-
# ===
|
496
|
+
# === Example 2
|
497
497
|
# #!/usr/bin/env ruby
|
498
498
|
# require("gsl")
|
499
499
|
# include GSL
|
@@ -507,7 +507,7 @@
|
|
507
507
|
#
|
508
508
|
# rtable = FFT::RealWavetable.alloc(n)
|
509
509
|
# rwork = FFT::RealWorkspace.alloc(n)
|
510
|
-
#
|
510
|
+
#
|
511
511
|
# #ffted = data.real_transform(rtable, rwork)
|
512
512
|
# #ffted = data.real_transform(rtable)
|
513
513
|
# #ffted = data.real_transform(rwork)
|
@@ -517,19 +517,19 @@
|
|
517
517
|
# for i in 11...n do
|
518
518
|
# ffted[i] = 0.0
|
519
519
|
# end
|
520
|
-
#
|
520
|
+
#
|
521
521
|
# hctable = FFT::HalfComplexWavetable.alloc(n)
|
522
|
-
#
|
522
|
+
#
|
523
523
|
# #data2 = ffted.halfcomplex_inverse(hctable, rwork)
|
524
524
|
# #data2 = ffted.halfcomplex_inverse()
|
525
525
|
# data2 = ffted.ifft
|
526
526
|
#
|
527
527
|
# graph(nil, data, data2, "-T X -C -g 3 -L 'Real-halfcomplex' -x 0 #{data.size}")
|
528
528
|
#
|
529
|
-
# {prev}[link:
|
530
|
-
# {next}[link:
|
529
|
+
# {prev}[link:rdoc/eigen_rdoc.html]
|
530
|
+
# {next}[link:rdoc/wavelet_rdoc.html]
|
531
531
|
#
|
532
|
-
# {Reference index}[link:
|
533
|
-
# {top}[link:
|
532
|
+
# {Reference index}[link:rdoc/ref_rdoc.html]
|
533
|
+
# {top}[link:index.html]
|
534
534
|
#
|
535
535
|
#
|