2011-04-08 Joel Sherrill <joel.sherrill@oarcorp.com>

	* AUTHORS, BUGS, COPYING, ChangeLog, INSTALL, Makefile.am, Makefile.in,
	NEWS, README, SUPPORT, THANKS, TODO, acconfig.h, aclocal.m4,
	autogen.sh, config.guess, config.h.in, config.sub, configure,
	configure.ac, gsl-config.in, gsl-histogram.c, gsl-randist.c, gsl.m4,
	gsl.pc.in, gsl.spec.in, gsl_machine.h, gsl_math.h, gsl_mode.h,
	gsl_nan.h, gsl_pow_int.h, gsl_precision.h, gsl_types.h,
	gsl_version.h.in, install-sh, ltmain.sh, mdate-sh, missing,
	mkinstalldirs, templates_off.h, templates_on.h,
	test_gsl_histogram.sh, version.c, blas/ChangeLog, blas/Makefile.am,
	blas/Makefile.in, blas/TODO, blas/blas.c, blas/gsl_blas.h,
	blas/gsl_blas_types.h, block/ChangeLog, block/Makefile.am,
	block/Makefile.in, block/block.c, block/block_source.c, block/file.c,
	block/fprintf_source.c, block/fwrite_source.c, block/gsl_block.h,
	block/gsl_block_char.h, block/gsl_block_complex_double.h,
	block/gsl_block_complex_float.h,
	block/gsl_block_complex_long_double.h, block/gsl_block_double.h,
	block/gsl_block_float.h, block/gsl_block_int.h,
	block/gsl_block_long.h, block/gsl_block_long_double.h,
	block/gsl_block_short.h, block/gsl_block_uchar.h,
	block/gsl_block_uint.h, block/gsl_block_ulong.h,
	block/gsl_block_ushort.h, block/gsl_check_range.h, block/init.c,
	block/init_source.c, block/test.c, block/test_complex_io.c,
	block/test_complex_source.c, block/test_io.c, block/test_source.c,
	bspline/ChangeLog, bspline/Makefile.am, bspline/Makefile.in,
	bspline/TODO, bspline/bspline.c, bspline/gsl_bspline.h,
	bspline/test.c, cblas/ChangeLog, cblas/Makefile.am,
	cblas/Makefile.in, cblas/TODO, cblas/caxpy.c, cblas/cblas.h,
	cblas/ccopy.c, cblas/cdotc_sub.c, cblas/cdotu_sub.c, cblas/cgbmv.c,
	cblas/cgemm.c, cblas/cgemv.c, cblas/cgerc.c, cblas/cgeru.c,
	cblas/chbmv.c, cblas/chemm.c, cblas/chemv.c, cblas/cher.c,
	cblas/cher2.c, cblas/cher2k.c, cblas/cherk.c, cblas/chpmv.c,
	cblas/chpr.c, cblas/chpr2.c, cblas/cscal.c, cblas/csscal.c,
	cblas/cswap.c, cblas/csymm.c, cblas/csyr2k.c, cblas/csyrk.c,
	cblas/ctbmv.c, cblas/ctbsv.c, cblas/ctpmv.c, cblas/ctpsv.c,
	cblas/ctrmm.c, cblas/ctrmv.c, cblas/ctrsm.c, cblas/ctrsv.c,
	cblas/dasum.c, cblas/daxpy.c, cblas/dcopy.c, cblas/ddot.c,
	cblas/dgbmv.c, cblas/dgemm.c, cblas/dgemv.c, cblas/dger.c,
	cblas/dnrm2.c, cblas/drot.c, cblas/drotg.c, cblas/drotm.c,
	cblas/drotmg.c, cblas/dsbmv.c, cblas/dscal.c, cblas/dsdot.c,
	cblas/dspmv.c, cblas/dspr.c, cblas/dspr2.c, cblas/dswap.c,
	cblas/dsymm.c, cblas/dsymv.c, cblas/dsyr.c, cblas/dsyr2.c,
	cblas/dsyr2k.c, cblas/dsyrk.c, cblas/dtbmv.c, cblas/dtbsv.c,
	cblas/dtpmv.c, cblas/dtpsv.c, cblas/dtrmm.c, cblas/dtrmv.c,
	cblas/dtrsm.c, cblas/dtrsv.c, cblas/dzasum.c, cblas/dznrm2.c,
	cblas/gsl_cblas.h, cblas/hypot.c, cblas/icamax.c, cblas/idamax.c,
	cblas/isamax.c, cblas/izamax.c, cblas/sasum.c, cblas/saxpy.c,
	cblas/scasum.c, cblas/scnrm2.c, cblas/scopy.c, cblas/sdot.c,
	cblas/sdsdot.c, cblas/sgbmv.c, cblas/sgemm.c, cblas/sgemv.c,
	cblas/sger.c, cblas/snrm2.c, cblas/source_asum_c.h,
	cblas/source_asum_r.h, cblas/source_axpy_c.h, cblas/source_axpy_r.h,
	cblas/source_copy_c.h, cblas/source_copy_r.h, cblas/source_dot_c.h,
	cblas/source_dot_r.h, cblas/source_gbmv_c.h, cblas/source_gbmv_r.h,
	cblas/source_gemm_c.h, cblas/source_gemm_r.h, cblas/source_gemv_c.h,
	cblas/source_gemv_r.h, cblas/source_ger.h, cblas/source_gerc.h,
	cblas/source_geru.h, cblas/source_hbmv.h, cblas/source_hemm.h,
	cblas/source_hemv.h, cblas/source_her.h, cblas/source_her2.h,
	cblas/source_her2k.h, cblas/source_herk.h, cblas/source_hpmv.h,
	cblas/source_hpr.h, cblas/source_hpr2.h, cblas/source_iamax_c.h,
	cblas/source_iamax_r.h, cblas/source_nrm2_c.h, cblas/source_nrm2_r.h,
	cblas/source_rot.h, cblas/source_rotg.h, cblas/source_rotm.h,
	cblas/source_rotmg.h, cblas/source_sbmv.h, cblas/source_scal_c.h,
	cblas/source_scal_c_s.h, cblas/source_scal_r.h, cblas/source_spmv.h,
	cblas/source_spr.h, cblas/source_spr2.h, cblas/source_swap_c.h,
	cblas/source_swap_r.h, cblas/source_symm_c.h, cblas/source_symm_r.h,
	cblas/source_symv.h, cblas/source_syr.h, cblas/source_syr2.h,
	cblas/source_syr2k_c.h, cblas/source_syr2k_r.h,
	cblas/source_syrk_c.h, cblas/source_syrk_r.h, cblas/source_tbmv_c.h,
	cblas/source_tbmv_r.h, cblas/source_tbsv_c.h, cblas/source_tbsv_r.h,
	cblas/source_tpmv_c.h, cblas/source_tpmv_r.h, cblas/source_tpsv_c.h,
	cblas/source_tpsv_r.h, cblas/source_trmm_c.h, cblas/source_trmm_r.h,
	cblas/source_trmv_c.h, cblas/source_trmv_r.h, cblas/source_trsm_c.h,
	cblas/source_trsm_r.h, cblas/source_trsv_c.h, cblas/source_trsv_r.h,
	cblas/srot.c, cblas/srotg.c, cblas/srotm.c, cblas/srotmg.c,
	cblas/ssbmv.c, cblas/sscal.c, cblas/sspmv.c, cblas/sspr.c,
	cblas/sspr2.c, cblas/sswap.c, cblas/ssymm.c, cblas/ssymv.c,
	cblas/ssyr.c, cblas/ssyr2.c, cblas/ssyr2k.c, cblas/ssyrk.c,
	cblas/stbmv.c, cblas/stbsv.c, cblas/stpmv.c, cblas/stpsv.c,
	cblas/strmm.c, cblas/strmv.c, cblas/strsm.c, cblas/strsv.c,
	cblas/test.c, cblas/test_amax.c, cblas/test_asum.c,
	cblas/test_axpy.c, cblas/test_copy.c, cblas/test_dot.c,
	cblas/test_gbmv.c, cblas/test_gemm.c, cblas/test_gemv.c,
	cblas/test_ger.c, cblas/test_hbmv.c, cblas/test_hemm.c,
	cblas/test_hemv.c, cblas/test_her.c, cblas/test_her2.c,
	cblas/test_her2k.c, cblas/test_herk.c, cblas/test_hpmv.c,
	cblas/test_hpr.c, cblas/test_hpr2.c, cblas/test_nrm2.c,
	cblas/test_rot.c, cblas/test_rotg.c, cblas/test_rotm.c,
	cblas/test_rotmg.c, cblas/test_sbmv.c, cblas/test_scal.c,
	cblas/test_spmv.c, cblas/test_spr.c, cblas/test_spr2.c,
	cblas/test_swap.c, cblas/test_symm.c, cblas/test_symv.c,
	cblas/test_syr.c, cblas/test_syr2.c, cblas/test_syr2k.c,
	cblas/test_syrk.c, cblas/test_tbmv.c, cblas/test_tbsv.c,
	cblas/test_tpmv.c, cblas/test_tpsv.c, cblas/test_trmm.c,
	cblas/test_trmv.c, cblas/test_trsm.c, cblas/test_trsv.c,
	cblas/tests.c, cblas/tests.h, cblas/xerbla.c, cblas/zaxpy.c,
	cblas/zcopy.c, cblas/zdotc_sub.c, cblas/zdotu_sub.c, cblas/zdscal.c,
	cblas/zgbmv.c, cblas/zgemm.c, cblas/zgemv.c, cblas/zgerc.c,
	cblas/zgeru.c, cblas/zhbmv.c, cblas/zhemm.c, cblas/zhemv.c,
	cblas/zher.c, cblas/zher2.c, cblas/zher2k.c, cblas/zherk.c,
	cblas/zhpmv.c, cblas/zhpr.c, cblas/zhpr2.c, cblas/zscal.c,
	cblas/zswap.c, cblas/zsymm.c, cblas/zsyr2k.c, cblas/zsyrk.c,
	cblas/ztbmv.c, cblas/ztbsv.c, cblas/ztpmv.c, cblas/ztpsv.c,
	cblas/ztrmm.c, cblas/ztrmv.c, cblas/ztrsm.c, cblas/ztrsv.c,
	cdf/ChangeLog, cdf/Makefile.am, cdf/Makefile.in, cdf/beta.c,
	cdf/beta_inc.c, cdf/betainv.c, cdf/binomial.c, cdf/cauchy.c,
	cdf/cauchyinv.c, cdf/chisq.c, cdf/chisqinv.c, cdf/error.h,
	cdf/exponential.c, cdf/exponentialinv.c, cdf/exppow.c, cdf/fdist.c,
	cdf/fdistinv.c, cdf/flat.c, cdf/flatinv.c, cdf/gamma.c,
	cdf/gammainv.c, cdf/gauss.c, cdf/gaussinv.c, cdf/geometric.c,
	cdf/gsl_cdf.h, cdf/gumbel1.c, cdf/gumbel1inv.c, cdf/gumbel2.c,
	cdf/gumbel2inv.c, cdf/hypergeometric.c, cdf/laplace.c,
	cdf/laplaceinv.c, cdf/logistic.c, cdf/logisticinv.c, cdf/lognormal.c,
	cdf/lognormalinv.c, cdf/nbinomial.c, cdf/pareto.c, cdf/paretoinv.c,
	cdf/pascal.c, cdf/poisson.c, cdf/rat_eval.h, cdf/rayleigh.c,
	cdf/rayleighinv.c, cdf/tdist.c, cdf/tdistinv.c, cdf/test.c,
	cdf/test_auto.c, cdf/weibull.c, cdf/weibullinv.c, cheb/ChangeLog,
	cheb/Makefile.am, cheb/Makefile.in, cheb/deriv.c, cheb/eval.c,
	cheb/gsl_chebyshev.h, cheb/init.c, cheb/integ.c, cheb/test.c,
	combination/ChangeLog, combination/Makefile.am,
	combination/Makefile.in, combination/combination.c,
	combination/file.c, combination/gsl_combination.h,
	combination/init.c, combination/test.c, complex/ChangeLog,
	complex/Makefile.am, complex/Makefile.in, complex/TODO,
	complex/gsl_complex.h, complex/gsl_complex_math.h, complex/math.c,
	complex/results.h, complex/results1.h, complex/results_real.h,
	complex/test.c, const/ChangeLog, const/Makefile.am,
	const/Makefile.in, const/TODO, const/gsl_const.h,
	const/gsl_const_cgs.h, const/gsl_const_cgsm.h, const/gsl_const_mks.h,
	const/gsl_const_mksa.h, const/gsl_const_num.h, const/test.c,
	deriv/ChangeLog, deriv/Makefile.am, deriv/Makefile.in, deriv/deriv.c,
	deriv/gsl_deriv.h, deriv/test.c, dht/ChangeLog, dht/Makefile.am,
	dht/Makefile.in, dht/dht.c, dht/gsl_dht.h, dht/test.c,
	diff/ChangeLog, diff/Makefile.am, diff/Makefile.in, diff/diff.c,
	diff/gsl_diff.h, diff/test.c, doc/12-cities.eps, doc/ChangeLog,
	doc/Makefile.am, doc/Makefile.in, doc/algorithm.sty,
	doc/algorithmic.sty, doc/autoconf.texi, doc/blas.texi,
	doc/bspline.eps, doc/bspline.texi, doc/calc.sty, doc/cblas.texi,
	doc/cheb.eps, doc/cheb.texi, doc/combination.texi, doc/complex.texi,
	doc/const.texi, doc/debug.texi, doc/dht.texi, doc/diff.texi,
	doc/dwt-orig.eps, doc/dwt-samp.eps, doc/dwt.texi, doc/eigen.texi,
	doc/err.texi, doc/fdl.texi, doc/fft-complex-radix2-f.eps,
	doc/fft-complex-radix2-t.eps, doc/fft-complex-radix2.eps,
	doc/fft-real-mixedradix.eps, doc/fft.texi, doc/fftalgorithms.bib,
	doc/fftalgorithms.tex, doc/final-route.eps, doc/fit-exp.eps,
	doc/fit-wlinear.eps, doc/fit-wlinear2.eps, doc/fitting.texi,
	doc/freemanuals.texi, doc/gpl.texi, doc/gsl-config.1,
	doc/gsl-design.texi, doc/gsl-histogram.1, doc/gsl-randist.1,
	doc/gsl-ref.info, doc/gsl-ref.info-1, doc/gsl-ref.info-2,
	doc/gsl-ref.info-3, doc/gsl-ref.info-4, doc/gsl-ref.info-5,
	doc/gsl-ref.info-6, doc/gsl-ref.texi, doc/gsl.3, doc/histogram.eps,
	doc/histogram.texi, doc/histogram2d.eps, doc/ieee754.texi,
	doc/initial-route.eps, doc/integration.texi, doc/interp.texi,
	doc/interp2.eps, doc/interpp2.eps, doc/intro.texi, doc/landau.dat,
	doc/linalg.texi, doc/math.texi, doc/mdate-sh, doc/min-interval.eps,
	doc/min.texi, doc/montecarlo.texi, doc/multifit.texi,
	doc/multimin.eps, doc/multimin.texi, doc/multiroots.texi,
	doc/ntuple.eps, doc/ntuple.texi, doc/ode-initval.texi,
	doc/permutation.texi, doc/poly.texi, doc/qrng.eps, doc/qrng.texi,
	doc/rand-bernoulli.tex, doc/rand-beta.tex, doc/rand-binomial.tex,
	doc/rand-bivariate-gaussian.tex, doc/rand-cauchy.tex,
	doc/rand-chisq.tex, doc/rand-erlang.tex, doc/rand-exponential.tex,
	doc/rand-exppow.tex, doc/rand-fdist.tex, doc/rand-flat.tex,
	doc/rand-gamma.tex, doc/rand-gaussian-tail.tex,
	doc/rand-gaussian.tex, doc/rand-geometric.tex, doc/rand-gumbel.tex,
	doc/rand-gumbel1.tex, doc/rand-gumbel2.tex,
	doc/rand-hypergeometric.tex, doc/rand-landau.tex,
	doc/rand-laplace.tex, doc/rand-levy.tex, doc/rand-levyskew.tex,
	doc/rand-logarithmic.tex, doc/rand-logistic.tex,
	doc/rand-lognormal.tex, doc/rand-nbinomial.tex, doc/rand-pareto.tex,
	doc/rand-pascal.tex, doc/rand-poisson.tex,
	doc/rand-rayleigh-tail.tex, doc/rand-rayleigh.tex,
	doc/rand-tdist.tex, doc/rand-weibull.tex, doc/randist.texi,
	doc/random-walk.tex, doc/randplots.gnp, doc/rng.texi,
	doc/roots-bisection.eps, doc/roots-false-position.eps,
	doc/roots-newtons-method.eps, doc/roots-secant-method.eps,
	doc/roots.texi, doc/siman-energy.eps, doc/siman-test.eps,
	doc/siman.texi, doc/sort.texi, doc/specfunc-airy.texi,
	doc/specfunc-bessel.texi, doc/specfunc-clausen.texi,
	doc/specfunc-coulomb.texi, doc/specfunc-coupling.texi,
	doc/specfunc-dawson.texi, doc/specfunc-debye.texi,
	doc/specfunc-dilog.texi, doc/specfunc-elementary.texi,
	doc/specfunc-ellint.texi, doc/specfunc-elljac.texi,
	doc/specfunc-erf.texi, doc/specfunc-exp.texi,
	doc/specfunc-expint.texi, doc/specfunc-fermi-dirac.texi,
	doc/specfunc-gamma.texi, doc/specfunc-gegenbauer.texi,
	doc/specfunc-hyperg.texi, doc/specfunc-laguerre.texi,
	doc/specfunc-lambert.texi, doc/specfunc-legendre.texi,
	doc/specfunc-log.texi, doc/specfunc-mathieu.texi,
	doc/specfunc-pow-int.texi, doc/specfunc-psi.texi,
	doc/specfunc-synchrotron.texi, doc/specfunc-transport.texi,
	doc/specfunc-trig.texi, doc/specfunc-zeta.texi, doc/specfunc.texi,
	doc/stamp-vti, doc/statistics.texi, doc/sum.texi, doc/texinfo.tex,
	doc/usage.texi, doc/vdp.eps, doc/vectors.texi, doc/version-ref.texi,
	doc/examples/blas.c, doc/examples/blas.out, doc/examples/block.c,
	doc/examples/block.out, doc/examples/bspline.c, doc/examples/cblas.c,
	doc/examples/cblas.out, doc/examples/cdf.c, doc/examples/cdf.out,
	doc/examples/cheb.c, doc/examples/combination.c,
	doc/examples/combination.out, doc/examples/const.c,
	doc/examples/const.out, doc/examples/demo_fn.c,
	doc/examples/demo_fn.h, doc/examples/diff.c, doc/examples/diff.out,
	doc/examples/dwt.c, doc/examples/dwt.dat, doc/examples/ecg.dat,
	doc/examples/eigen.c, doc/examples/eigen_nonsymm.c,
	doc/examples/expfit.c, doc/examples/fft.c, doc/examples/fftmr.c,
	doc/examples/fftreal.c, doc/examples/fitting.c,
	doc/examples/fitting2.c, doc/examples/fitting3.c,
	doc/examples/histogram.c, doc/examples/histogram2d.c,
	doc/examples/ieee.c, doc/examples/ieeeround.c,
	doc/examples/integration.c, doc/examples/integration.out,
	doc/examples/interp.c, doc/examples/interpp.c, doc/examples/intro.c,
	doc/examples/intro.out, doc/examples/linalglu.c,
	doc/examples/linalglu.out, doc/examples/matrix.c,
	doc/examples/matrixw.c, doc/examples/min.c, doc/examples/min.out,
	doc/examples/monte.c, doc/examples/nlfit.c, doc/examples/ntupler.c,
	doc/examples/ntuplew.c, doc/examples/ode-initval.c,
	doc/examples/odefixed.c, doc/examples/permseq.c,
	doc/examples/permshuffle.c, doc/examples/polyroots.c,
	doc/examples/polyroots.out, doc/examples/qrng.c,
	doc/examples/randpoisson.2.out, doc/examples/randpoisson.c,
	doc/examples/randpoisson.out, doc/examples/randwalk.c,
	doc/examples/rng.c, doc/examples/rng.out, doc/examples/rngunif.2.out,
	doc/examples/rngunif.c, doc/examples/rngunif.out,
	doc/examples/rootnewt.c, doc/examples/roots.c, doc/examples/siman.c,
	doc/examples/sortsmall.c, doc/examples/sortsmall.out,
	doc/examples/specfun.c, doc/examples/specfun.out,
	doc/examples/specfun_e.c, doc/examples/specfun_e.out,
	doc/examples/stat.c, doc/examples/stat.out, doc/examples/statsort.c,
	doc/examples/statsort.out, doc/examples/sum.c, doc/examples/sum.out,
	doc/examples/vector.c, doc/examples/vectorr.c,
	doc/examples/vectorview.c, doc/examples/vectorview.out,
	doc/examples/vectorw.c, eigen/ChangeLog, eigen/Makefile.am,
	eigen/Makefile.in, eigen/TODO, eigen/francis.c, eigen/gsl_eigen.h,
	eigen/herm.c, eigen/hermv.c, eigen/jacobi.c, eigen/nonsymm.c,
	eigen/nonsymmv.c, eigen/qrstep.c, eigen/schur.c, eigen/schur.h,
	eigen/sort.c, eigen/symm.c, eigen/symmv.c, eigen/test.c,
	err/ChangeLog, err/Makefile.am, err/Makefile.in, err/TODO,
	err/error.c, err/gsl_errno.h, err/gsl_message.h, err/message.c,
	err/stream.c, err/strerror.c, err/test.c, fft/ChangeLog,
	fft/Makefile.am, fft/Makefile.in, fft/TODO, fft/bitreverse.c,
	fft/bitreverse.h, fft/c_init.c, fft/c_main.c, fft/c_pass.h,
	fft/c_pass_2.c, fft/c_pass_3.c, fft/c_pass_4.c, fft/c_pass_5.c,
	fft/c_pass_6.c, fft/c_pass_7.c, fft/c_pass_n.c, fft/c_radix2.c,
	fft/compare.h, fft/compare_source.c, fft/complex_internal.h,
	fft/dft.c, fft/dft_source.c, fft/factorize.c, fft/factorize.h,
	fft/fft.c, fft/gsl_dft_complex.h, fft/gsl_dft_complex_float.h,
	fft/gsl_fft.h, fft/gsl_fft_complex.h, fft/gsl_fft_complex_float.h,
	fft/gsl_fft_halfcomplex.h, fft/gsl_fft_halfcomplex_float.h,
	fft/gsl_fft_real.h, fft/gsl_fft_real_float.h, fft/hc_init.c,
	fft/hc_main.c, fft/hc_pass.h, fft/hc_pass_2.c, fft/hc_pass_3.c,
	fft/hc_pass_4.c, fft/hc_pass_5.c, fft/hc_pass_n.c, fft/hc_radix2.c,
	fft/hc_unpack.c, fft/real_init.c, fft/real_main.c, fft/real_pass.h,
	fft/real_pass_2.c, fft/real_pass_3.c, fft/real_pass_4.c,
	fft/real_pass_5.c, fft/real_pass_n.c, fft/real_radix2.c,
	fft/real_unpack.c, fft/signals.c, fft/signals.h,
	fft/signals_source.c, fft/test.c, fft/test_complex_source.c,
	fft/test_real_source.c, fft/test_trap_source.c, fft/urand.c,
	fit/ChangeLog, fit/Makefile.am, fit/Makefile.in, fit/gsl_fit.h,
	fit/linear.c, fit/test.c, gsl/Makefile.am, gsl/Makefile.in,
	histogram/ChangeLog, histogram/Makefile.am, histogram/Makefile.in,
	histogram/TODO, histogram/add.c, histogram/add2d.c,
	histogram/calloc_range.c, histogram/calloc_range2d.c,
	histogram/copy.c, histogram/copy2d.c, histogram/file.c,
	histogram/file2d.c, histogram/find.c, histogram/find2d.c,
	histogram/get.c, histogram/get2d.c, histogram/gsl_histogram.h,
	histogram/gsl_histogram2d.h, histogram/init.c, histogram/init2d.c,
	histogram/maxval.c, histogram/maxval2d.c, histogram/oper.c,
	histogram/oper2d.c, histogram/params.c, histogram/params2d.c,
	histogram/pdf.c, histogram/pdf2d.c, histogram/reset.c,
	histogram/reset2d.c, histogram/stat.c, histogram/stat2d.c,
	histogram/test.c, histogram/test1d.c, histogram/test1d_resample.c,
	histogram/test1d_trap.c, histogram/test2d.c,
	histogram/test2d_resample.c, histogram/test2d_trap.c,
	histogram/urand.c, ieee-utils/ChangeLog, ieee-utils/Makefile.am,
	ieee-utils/Makefile.in, ieee-utils/TODO, ieee-utils/endian.c,
	ieee-utils/env.c, ieee-utils/fp-aix.c, ieee-utils/fp-darwin.c,
	ieee-utils/fp-darwin86.c, ieee-utils/fp-freebsd.c,
	ieee-utils/fp-gnuc99.c, ieee-utils/fp-gnum68k.c,
	ieee-utils/fp-gnuppc.c, ieee-utils/fp-gnusparc.c,
	ieee-utils/fp-gnux86.c, ieee-utils/fp-hpux.c, ieee-utils/fp-hpux11.c,
	ieee-utils/fp-irix.c, ieee-utils/fp-netbsd.c,
	ieee-utils/fp-openbsd.c, ieee-utils/fp-os2emx.c,
	ieee-utils/fp-solaris.c, ieee-utils/fp-sunos4.c,
	ieee-utils/fp-tru64.c, ieee-utils/fp-unknown.c, ieee-utils/fp.c,
	ieee-utils/gsl_ieee_utils.h, ieee-utils/make_rep.c,
	ieee-utils/print.c, ieee-utils/read.c, ieee-utils/standardize.c,
	ieee-utils/test.c, integration/ChangeLog, integration/Makefile.am,
	integration/Makefile.in, integration/TODO, integration/append.c,
	integration/err.c, integration/gsl_integration.h,
	integration/initialise.c, integration/positivity.c,
	integration/ptsort.c, integration/qag.c, integration/qagp.c,
	integration/qags.c, integration/qawc.c, integration/qawf.c,
	integration/qawo.c, integration/qaws.c, integration/qc25c.c,
	integration/qc25f.c, integration/qc25s.c, integration/qcheb.c,
	integration/qelg.c, integration/qk.c, integration/qk15.c,
	integration/qk21.c, integration/qk31.c, integration/qk41.c,
	integration/qk51.c, integration/qk61.c, integration/qmomo.c,
	integration/qmomof.c, integration/qng.c, integration/qng.h,
	integration/qpsrt.c, integration/qpsrt2.c, integration/reset.c,
	integration/set_initial.c, integration/test.c, integration/tests.c,
	integration/tests.h, integration/util.c, integration/workspace.c,
	interpolation/ChangeLog, interpolation/Makefile.am,
	interpolation/Makefile.in, interpolation/TODO, interpolation/accel.c,
	interpolation/akima.c, interpolation/bsearch.c,
	interpolation/bsearch.h, interpolation/cspline.c,
	interpolation/gsl_interp.h, interpolation/gsl_spline.h,
	interpolation/integ_eval.h, interpolation/interp.c,
	interpolation/linear.c, interpolation/poly.c, interpolation/spline.c,
	interpolation/test.c, linalg/ChangeLog, linalg/Makefile.am,
	linalg/Makefile.in, linalg/TODO, linalg/apply_givens.c,
	linalg/balance.c, linalg/balancemat.c, linalg/bidiag.c,
	linalg/cholesky.c, linalg/exponential.c, linalg/givens.c,
	linalg/gsl_linalg.h, linalg/hermtd.c, linalg/hessenberg.c,
	linalg/hh.c, linalg/householder.c, linalg/householdercomplex.c,
	linalg/lq.c, linalg/lu.c, linalg/luc.c, linalg/multiply.c,
	linalg/ptlq.c, linalg/qr.c, linalg/qrpt.c, linalg/svd.c,
	linalg/svdstep.c, linalg/symmtd.c, linalg/test.c, linalg/tridiag.c,
	linalg/tridiag.h, matrix/ChangeLog, matrix/Makefile.am,
	matrix/Makefile.in, matrix/TODO, matrix/copy.c, matrix/copy_source.c,
	matrix/file.c, matrix/file_source.c, matrix/getset.c,
	matrix/getset_source.c, matrix/gsl_matrix.h,
	matrix/gsl_matrix_char.h, matrix/gsl_matrix_complex_double.h,
	matrix/gsl_matrix_complex_float.h,
	matrix/gsl_matrix_complex_long_double.h, matrix/gsl_matrix_double.h,
	matrix/gsl_matrix_float.h, matrix/gsl_matrix_int.h,
	matrix/gsl_matrix_long.h, matrix/gsl_matrix_long_double.h,
	matrix/gsl_matrix_short.h, matrix/gsl_matrix_uchar.h,
	matrix/gsl_matrix_uint.h, matrix/gsl_matrix_ulong.h,
	matrix/gsl_matrix_ushort.h, matrix/init.c, matrix/init_source.c,
	matrix/matrix.c, matrix/matrix_source.c, matrix/minmax.c,
	matrix/minmax_source.c, matrix/oper.c, matrix/oper_complex_source.c,
	matrix/oper_source.c, matrix/prop.c, matrix/prop_source.c,
	matrix/rowcol.c, matrix/rowcol_source.c, matrix/submatrix.c,
	matrix/submatrix_source.c, matrix/swap.c, matrix/swap_source.c,
	matrix/test.c, matrix/test_complex_source.c, matrix/test_source.c,
	matrix/test_static.c, matrix/view.c, matrix/view.h,
	matrix/view_source.c, min/ChangeLog, min/Makefile.am,
	min/Makefile.in, min/bracketing.c, min/brent.c, min/convergence.c,
	min/fsolver.c, min/golden.c, min/gsl_min.h, min/min.h, min/test.c,
	min/test.h, min/test_funcs.c, monte/ChangeLog, monte/Makefile.am,
	monte/Makefile.in, monte/README, monte/TODO, monte/gsl_monte.h,
	monte/gsl_monte_miser.h, monte/gsl_monte_plain.h,
	monte/gsl_monte_vegas.h, monte/miser.c, monte/plain.c, monte/test.c,
	monte/test_main.c, monte/vegas.c, multifit/ChangeLog,
	multifit/Makefile.am, multifit/Makefile.in, multifit/TODO,
	multifit/convergence.c, multifit/covar.c, multifit/fdfsolver.c,
	multifit/fsolver.c, multifit/gradient.c, multifit/gsl_multifit.h,
	multifit/gsl_multifit_nlin.h, multifit/lmder.c, multifit/lmiterate.c,
	multifit/lmpar.c, multifit/lmset.c, multifit/lmutil.c,
	multifit/multilinear.c, multifit/qrsolv.c, multifit/test.c,
	multifit/test_brown.c, multifit/test_enso.c,
	multifit/test_estimator.c, multifit/test_filip.c, multifit/test_fn.c,
	multifit/test_hahn1.c, multifit/test_kirby2.c,
	multifit/test_longley.c, multifit/test_nelson.c,
	multifit/test_pontius.c, multifit/work.c, multimin/ChangeLog,
	multimin/Makefile.am, multimin/Makefile.in, multimin/TODO,
	multimin/conjugate_fr.c, multimin/conjugate_pr.c,
	multimin/convergence.c, multimin/diff.c,
	multimin/directional_minimize.c, multimin/fdfminimizer.c,
	multimin/fminimizer.c, multimin/gsl_multimin.h,
	multimin/linear_minimize.c, multimin/linear_wrapper.c,
	multimin/simplex.c, multimin/steepest_descent.c, multimin/test.c,
	multimin/test_funcs.c, multimin/test_funcs.h, multimin/vector_bfgs.c,
	multimin/vector_bfgs2.c, multiroots/ChangeLog,
	multiroots/Makefile.am, multiroots/Makefile.in, multiroots/broyden.c,
	multiroots/convergence.c, multiroots/dnewton.c, multiroots/dogleg.c,
	multiroots/enorm.c, multiroots/fdfsolver.c, multiroots/fdjac.c,
	multiroots/fsolver.c, multiroots/gnewton.c,
	multiroots/gsl_multiroots.h, multiroots/hybrid.c,
	multiroots/hybridj.c, multiroots/newton.c, multiroots/test.c,
	multiroots/test_funcs.c, multiroots/test_funcs.h, ntuple/ChangeLog,
	ntuple/Makefile.am, ntuple/Makefile.in, ntuple/gsl_ntuple.h,
	ntuple/ntuple.c, ntuple/test.c, ode-initval/ChangeLog,
	ode-initval/Makefile.am, ode-initval/Makefile.in, ode-initval/TODO,
	ode-initval/bsimp.c, ode-initval/control.c, ode-initval/cscal.c,
	ode-initval/cstd.c, ode-initval/evolve.c, ode-initval/gear1.c,
	ode-initval/gear2.c, ode-initval/gsl_odeiv.h,
	ode-initval/odeiv_util.h, ode-initval/rk2.c, ode-initval/rk2imp.c,
	ode-initval/rk2simp.c, ode-initval/rk4.c, ode-initval/rk4imp.c,
	ode-initval/rk8pd.c, ode-initval/rkck.c, ode-initval/rkf45.c,
	ode-initval/step.c, ode-initval/test.c, permutation/ChangeLog,
	permutation/Makefile.am, permutation/Makefile.in,
	permutation/canonical.c, permutation/file.c,
	permutation/gsl_permutation.h, permutation/gsl_permute.h,
	permutation/gsl_permute_char.h,
	permutation/gsl_permute_complex_double.h,
	permutation/gsl_permute_complex_float.h,
	permutation/gsl_permute_complex_long_double.h,
	permutation/gsl_permute_double.h, permutation/gsl_permute_float.h,
	permutation/gsl_permute_int.h, permutation/gsl_permute_long.h,
	permutation/gsl_permute_long_double.h,
	permutation/gsl_permute_short.h, permutation/gsl_permute_uchar.h,
	permutation/gsl_permute_uint.h, permutation/gsl_permute_ulong.h,
	permutation/gsl_permute_ushort.h, permutation/gsl_permute_vector.h,
	permutation/gsl_permute_vector_char.h,
	permutation/gsl_permute_vector_complex_double.h,
	permutation/gsl_permute_vector_complex_float.h,
	permutation/gsl_permute_vector_complex_long_double.h,
	permutation/gsl_permute_vector_double.h,
	permutation/gsl_permute_vector_float.h,
	permutation/gsl_permute_vector_int.h,
	permutation/gsl_permute_vector_long.h,
	permutation/gsl_permute_vector_long_double.h,
	permutation/gsl_permute_vector_short.h,
	permutation/gsl_permute_vector_uchar.h,
	permutation/gsl_permute_vector_uint.h,
	permutation/gsl_permute_vector_ulong.h,
	permutation/gsl_permute_vector_ushort.h, permutation/init.c,
	permutation/permutation.c, permutation/permute.c,
	permutation/permute_source.c, permutation/test.c, poly/ChangeLog,
	poly/Makefile.am, poly/Makefile.in, poly/TODO, poly/balance.c,
	poly/companion.c, poly/dd.c, poly/eval.c, poly/gsl_poly.h, poly/qr.c,
	poly/solve_cubic.c, poly/solve_quadratic.c, poly/test.c,
	poly/zsolve.c, poly/zsolve_cubic.c, poly/zsolve_init.c,
	poly/zsolve_quadratic.c, qrng/ChangeLog, qrng/Makefile.am,
	qrng/Makefile.in, qrng/TODO, qrng/gsl_qrng.h, qrng/niederreiter-2.c,
	qrng/qrng.c, qrng/sobol.c, qrng/test.c, randist/ChangeLog,
	randist/Makefile.am, randist/Makefile.in, randist/TODO,
	randist/bernoulli.c, randist/beta.c, randist/bigauss.c,
	randist/binomial.c, randist/binomial_tpe.c, randist/cauchy.c,
	randist/chisq.c, randist/dirichlet.c, randist/discrete.c,
	randist/erlang.c, randist/exponential.c, randist/exppow.c,
	randist/fdist.c, randist/flat.c, randist/gamma.c, randist/gauss.c,
	randist/gausstail.c, randist/gausszig.c, randist/geometric.c,
	randist/gsl_randist.h, randist/gumbel.c, randist/hyperg.c,
	randist/landau.c, randist/laplace.c, randist/levy.c,
	randist/logarithmic.c, randist/logistic.c, randist/lognormal.c,
	randist/multinomial.c, randist/nbinomial.c, randist/pareto.c,
	randist/pascal.c, randist/poisson.c, randist/rayleigh.c,
	randist/shuffle.c, randist/sphere.c, randist/tdist.c, randist/test.c,
	randist/weibull.c, rng/ChangeLog, rng/Makefile.am, rng/Makefile.in,
	rng/TODO, rng/borosh13.c, rng/cmrg.c, rng/coveyou.c, rng/default.c,
	rng/file.c, rng/fishman18.c, rng/fishman20.c, rng/fishman2x.c,
	rng/gfsr4.c, rng/gsl_rng.h, rng/knuthran.c, rng/knuthran2.c,
	rng/knuthran2002.c, rng/lecuyer21.c, rng/minstd.c, rng/mrg.c,
	rng/mt.c, rng/r250.c, rng/ran0.c, rng/ran1.c, rng/ran2.c, rng/ran3.c,
	rng/rand.c, rng/rand48.c, rng/random.c, rng/randu.c, rng/ranf.c,
	rng/ranlux.c, rng/ranlxd.c, rng/ranlxs.c, rng/ranmar.c, rng/rng.c,
	rng/schrage.c, rng/slatec.c, rng/taus.c, rng/taus113.c, rng/test.c,
	rng/transputer.c, rng/tt.c, rng/types.c, rng/uni.c, rng/uni32.c,
	rng/vax.c, rng/waterman14.c, rng/zuf.c, roots/ChangeLog,
	roots/Makefile.am, roots/Makefile.in, roots/TODO, roots/bisection.c,
	roots/brent.c, roots/convergence.c, roots/falsepos.c,
	roots/fdfsolver.c, roots/fsolver.c, roots/gsl_roots.h,
	roots/newton.c, roots/roots.h, roots/secant.c, roots/steffenson.c,
	roots/test.c, roots/test.h, roots/test_funcs.c, siman/ChangeLog,
	siman/Makefile.am, siman/Makefile.in, siman/TODO, siman/gsl_siman.h,
	siman/siman.c, siman/siman_test_driver.sh, siman/siman_tsp.c,
	siman/test.c, sort/ChangeLog, sort/Makefile.am, sort/Makefile.in,
	sort/TODO, sort/gsl_heapsort.h, sort/gsl_sort.h,
	sort/gsl_sort_char.h, sort/gsl_sort_double.h, sort/gsl_sort_float.h,
	sort/gsl_sort_int.h, sort/gsl_sort_long.h,
	sort/gsl_sort_long_double.h, sort/gsl_sort_short.h,
	sort/gsl_sort_uchar.h, sort/gsl_sort_uint.h, sort/gsl_sort_ulong.h,
	sort/gsl_sort_ushort.h, sort/gsl_sort_vector.h,
	sort/gsl_sort_vector_char.h, sort/gsl_sort_vector_double.h,
	sort/gsl_sort_vector_float.h, sort/gsl_sort_vector_int.h,
	sort/gsl_sort_vector_long.h, sort/gsl_sort_vector_long_double.h,
	sort/gsl_sort_vector_short.h, sort/gsl_sort_vector_uchar.h,
	sort/gsl_sort_vector_uint.h, sort/gsl_sort_vector_ulong.h,
	sort/gsl_sort_vector_ushort.h, sort/sort.c, sort/sortind.c,
	sort/sortvec.c, sort/sortvec_source.c, sort/sortvecind.c,
	sort/sortvecind_source.c, sort/subset.c, sort/subset_source.c,
	sort/subsetind.c, sort/subsetind_source.c, sort/test.c,
	sort/test_heapsort.c, sort/test_source.c, specfunc/ChangeLog,
	specfunc/Makefile.am, specfunc/Makefile.in, specfunc/TODO,
	specfunc/airy.c, specfunc/airy_der.c, specfunc/airy_zero.c,
	specfunc/atanint.c, specfunc/bessel.c, specfunc/bessel.h,
	specfunc/bessel_I0.c, specfunc/bessel_I1.c, specfunc/bessel_In.c,
	specfunc/bessel_Inu.c, specfunc/bessel_J0.c, specfunc/bessel_J1.c,
	specfunc/bessel_Jn.c, specfunc/bessel_Jnu.c, specfunc/bessel_K0.c,
	specfunc/bessel_K1.c, specfunc/bessel_Kn.c, specfunc/bessel_Knu.c,
	specfunc/bessel_Y0.c, specfunc/bessel_Y1.c, specfunc/bessel_Yn.c,
	specfunc/bessel_Ynu.c, specfunc/bessel_amp_phase.c,
	specfunc/bessel_amp_phase.h, specfunc/bessel_i.c,
	specfunc/bessel_j.c, specfunc/bessel_k.c, specfunc/bessel_olver.c,
	specfunc/bessel_olver.h, specfunc/bessel_sequence.c,
	specfunc/bessel_temme.c, specfunc/bessel_temme.h,
	specfunc/bessel_y.c, specfunc/bessel_zero.c, specfunc/beta.c,
	specfunc/beta_inc.c, specfunc/cheb_eval.c, specfunc/cheb_eval_mode.c,
	specfunc/chebyshev.h, specfunc/check.h, specfunc/clausen.c,
	specfunc/coulomb.c, specfunc/coulomb_bound.c, specfunc/coupling.c,
	specfunc/dawson.c, specfunc/debye.c, specfunc/dilog.c,
	specfunc/elementary.c, specfunc/ellint.c, specfunc/elljac.c,
	specfunc/erfc.c, specfunc/error.h, specfunc/eval.h, specfunc/exp.c,
	specfunc/expint.c, specfunc/expint3.c, specfunc/fermi_dirac.c,
	specfunc/gamma.c, specfunc/gamma_inc.c, specfunc/gegenbauer.c,
	specfunc/gsl_sf.h, specfunc/gsl_sf_airy.h, specfunc/gsl_sf_bessel.h,
	specfunc/gsl_sf_clausen.h, specfunc/gsl_sf_coulomb.h,
	specfunc/gsl_sf_coupling.h, specfunc/gsl_sf_dawson.h,
	specfunc/gsl_sf_debye.h, specfunc/gsl_sf_dilog.h,
	specfunc/gsl_sf_elementary.h, specfunc/gsl_sf_ellint.h,
	specfunc/gsl_sf_elljac.h, specfunc/gsl_sf_erf.h,
	specfunc/gsl_sf_exp.h, specfunc/gsl_sf_expint.h,
	specfunc/gsl_sf_fermi_dirac.h, specfunc/gsl_sf_gamma.h,
	specfunc/gsl_sf_gegenbauer.h, specfunc/gsl_sf_hyperg.h,
	specfunc/gsl_sf_laguerre.h, specfunc/gsl_sf_lambert.h,
	specfunc/gsl_sf_legendre.h, specfunc/gsl_sf_log.h,
	specfunc/gsl_sf_mathieu.h, specfunc/gsl_sf_pow_int.h,
	specfunc/gsl_sf_psi.h, specfunc/gsl_sf_result.h,
	specfunc/gsl_sf_synchrotron.h, specfunc/gsl_sf_transport.h,
	specfunc/gsl_sf_trig.h, specfunc/gsl_sf_zeta.h,
	specfunc/gsl_specfunc.h, specfunc/hyperg.c, specfunc/hyperg.h,
	specfunc/hyperg_0F1.c, specfunc/hyperg_1F1.c, specfunc/hyperg_2F0.c,
	specfunc/hyperg_2F1.c, specfunc/hyperg_U.c, specfunc/laguerre.c,
	specfunc/lambert.c, specfunc/legendre.h, specfunc/legendre_H3d.c,
	specfunc/legendre_Qn.c, specfunc/legendre_con.c,
	specfunc/legendre_poly.c, specfunc/log.c, specfunc/mathieu_angfunc.c,
	specfunc/mathieu_charv.c, specfunc/mathieu_coeff.c,
	specfunc/mathieu_radfunc.c, specfunc/mathieu_workspace.c,
	specfunc/poch.c, specfunc/pow_int.c, specfunc/psi.c,
	specfunc/recurse.h, specfunc/result.c, specfunc/shint.c,
	specfunc/sinint.c, specfunc/synchrotron.c, specfunc/test_airy.c,
	specfunc/test_bessel.c, specfunc/test_coulomb.c,
	specfunc/test_dilog.c, specfunc/test_gamma.c, specfunc/test_hyperg.c,
	specfunc/test_legendre.c, specfunc/test_mathieu.c,
	specfunc/test_sf.c, specfunc/test_sf.h, specfunc/transport.c,
	specfunc/trig.c, specfunc/zeta.c, statistics/ChangeLog,
	statistics/Makefile.am, statistics/Makefile.in, statistics/TODO,
	statistics/absdev.c, statistics/absdev_source.c,
	statistics/covariance.c, statistics/covariance_source.c,
	statistics/gsl_statistics.h, statistics/gsl_statistics_char.h,
	statistics/gsl_statistics_double.h,
	statistics/gsl_statistics_float.h, statistics/gsl_statistics_int.h,
	statistics/gsl_statistics_long.h,
	statistics/gsl_statistics_long_double.h,
	statistics/gsl_statistics_short.h, statistics/gsl_statistics_uchar.h,
	statistics/gsl_statistics_uint.h, statistics/gsl_statistics_ulong.h,
	statistics/gsl_statistics_ushort.h, statistics/kurtosis.c,
	statistics/kurtosis_source.c, statistics/lag1.c,
	statistics/lag1_source.c, statistics/mean.c,
	statistics/mean_source.c, statistics/median.c,
	statistics/median_source.c, statistics/minmax.c,
	statistics/minmax_source.c, statistics/p_variance.c,
	statistics/p_variance_source.c, statistics/quantiles.c,
	statistics/quantiles_source.c, statistics/skew.c,
	statistics/skew_source.c, statistics/test.c,
	statistics/test_float_source.c, statistics/test_int_source.c,
	statistics/test_nist.c, statistics/ttest.c,
	statistics/ttest_source.c, statistics/variance.c,
	statistics/variance_source.c, statistics/wabsdev.c,
	statistics/wabsdev_source.c, statistics/wkurtosis.c,
	statistics/wkurtosis_source.c, statistics/wmean.c,
	statistics/wmean_source.c, statistics/wskew.c,
	statistics/wskew_source.c, statistics/wvariance.c,
	statistics/wvariance_source.c, sum/ChangeLog, sum/Makefile.am,
	sum/Makefile.in, sum/gsl_sum.h, sum/levin_u.c, sum/levin_utrunc.c,
	sum/test.c, sum/work_u.c, sum/work_utrunc.c, sys/ChangeLog,
	sys/Makefile.am, sys/Makefile.in, sys/coerce.c, sys/expm1.c,
	sys/fcmp.c, sys/fdiv.c, sys/gsl_sys.h, sys/hypot.c, sys/infnan.c,
	sys/invhyp.c, sys/ldfrexp.c, sys/log1p.c, sys/minmax.c,
	sys/pow_int.c, sys/prec.c, sys/test.c, test/ChangeLog,
	test/Makefile.am, test/Makefile.in, test/gsl_test.h, test/results.c,
	utils/Makefile.am, utils/Makefile.in, utils/README, utils/memcpy.c,
	utils/memmove.c, utils/placeholder.c, utils/strdup.c, utils/strtol.c,
	utils/strtoul.c, utils/system.h, vector/ChangeLog,
	vector/Makefile.am, vector/Makefile.in, vector/TODO, vector/copy.c,
	vector/copy_source.c, vector/file.c, vector/file_source.c,
	vector/gsl_vector.h, vector/gsl_vector_char.h,
	vector/gsl_vector_complex.h, vector/gsl_vector_complex_double.h,
	vector/gsl_vector_complex_float.h,
	vector/gsl_vector_complex_long_double.h, vector/gsl_vector_double.h,
	vector/gsl_vector_float.h, vector/gsl_vector_int.h,
	vector/gsl_vector_long.h, vector/gsl_vector_long_double.h,
	vector/gsl_vector_short.h, vector/gsl_vector_uchar.h,
	vector/gsl_vector_uint.h, vector/gsl_vector_ulong.h,
	vector/gsl_vector_ushort.h, vector/init.c, vector/init_source.c,
	vector/minmax.c, vector/minmax_source.c, vector/oper.c,
	vector/oper_source.c, vector/prop.c, vector/prop_source.c,
	vector/reim.c, vector/reim_source.c, vector/subvector.c,
	vector/subvector_source.c, vector/swap.c, vector/swap_source.c,
	vector/test.c, vector/test_complex_source.c, vector/test_source.c,
	vector/test_static.c, vector/vector.c, vector/vector_source.c,
	vector/view.c, vector/view.h, vector/view_source.c,
	wavelet/ChangeLog, wavelet/Makefile.am, wavelet/Makefile.in,
	wavelet/TODO, wavelet/bspline.c, wavelet/daubechies.c, wavelet/dwt.c,
	wavelet/gsl_wavelet.h, wavelet/gsl_wavelet2d.h, wavelet/haar.c,
	wavelet/test.c, wavelet/wavelet.c: New files.

1 files changed, 1456 insertions, 0 deletions

diff --git a/gsl-1.9/doc/rng.texi b/gsl-1.9/doc/rng.texi
new file mode 100644
index 0000000..a947f31
--- /dev/null
+++ b/gsl-1.9/doc/rng.texi
@@ -0,0 +1,1456 @@
+@cindex random number generators
+
+The library provides a large collection of random number generators
+which can be accessed through a uniform interface.  Environment
+variables allow you to select different generators and seeds at runtime,
+so that you can easily switch between generators without needing to
+recompile your program.  Each instance of a generator keeps track of its
+own state, allowing the generators to be used in multi-threaded
+programs.  Additional functions are available for transforming uniform
+random numbers into samples from continuous or discrete probability
+distributions such as the Gaussian, log-normal or Poisson distributions.
+
+These functions are declared in the header file @file{gsl_rng.h}.
+
+@comment Need to explain the difference between SERIAL and PARALLEL random 
+@comment number generators here
+
+@menu
+* General comments on random numbers::  
+* The Random Number Generator Interface::  
+* Random number generator initialization::  
+* Sampling from a random number generator::  
+* Auxiliary random number generator functions::  
+* Random number environment variables::  
+* Copying random number generator state::   
+* Reading and writing random number generator state::   
+* Random number generator algorithms::  
+* Unix random number generators::  
+* Other random number generators::  
+* Random Number Generator Performance::  
+* Random Number Generator Examples::  
+* Random Number References and Further Reading::  
+* Random Number Acknowledgements::  
+@end menu
+
+@node General comments on random numbers
+@section General comments on random numbers
+
+In 1988, Park and Miller wrote a paper entitled ``Random number
+generators: good ones are hard to find.'' [Commun.@: ACM, 31, 1192--1201].
+Fortunately, some excellent random number generators are available,
+though poor ones are still in common use.  You may be happy with the
+system-supplied random number generator on your computer, but you should
+be aware that as computers get faster, requirements on random number
+generators increase.  Nowadays, a simulation that calls a random number
+generator millions of times can often finish before you can make it down
+the hall to the coffee machine and back.
+
+A very nice review of random number generators was written by Pierre
+L'Ecuyer, as Chapter 4 of the book: Handbook on Simulation, Jerry Banks,
+ed. (Wiley, 1997).  The chapter is available in postscript from
+L'Ecuyer's ftp site (see references).  Knuth's volume on Seminumerical
+Algorithms (originally published in 1968) devotes 170 pages to random
+number generators, and has recently been updated in its 3rd edition
+(1997).
+@comment is only now starting to show its age.
+@comment Nonetheless, 
+It is brilliant, a classic.  If you don't own it, you should stop reading
+right now, run to the nearest bookstore, and buy it.
+
+A good random number generator will satisfy both theoretical and
+statistical properties.  Theoretical properties are often hard to obtain
+(they require real math!), but one prefers a random number generator
+with a long period, low serial correlation, and a tendency @emph{not} to
+``fall mainly on the planes.''  Statistical tests are performed with
+numerical simulations.  Generally, a random number generator is used to
+estimate some quantity for which the theory of probability provides an
+exact answer.  Comparison to this exact answer provides a measure of
+``randomness''.
+
+@node The Random Number Generator Interface
+@section The Random Number Generator Interface
+
+It is important to remember that a random number generator is not a
+``real'' function like sine or cosine.  Unlike real functions, successive
+calls to a random number generator yield different return values.  Of
+course that is just what you want for a random number generator, but to
+achieve this effect, the generator must keep track of some kind of
+``state'' variable.  Sometimes this state is just an integer (sometimes
+just the value of the previously generated random number), but often it
+is more complicated than that and may involve a whole array of numbers,
+possibly with some indices thrown in.  To use the random number
+generators, you do not need to know the details of what comprises the
+state, and besides that varies from algorithm to algorithm.
+
+The random number generator library uses two special structs,
+@code{gsl_rng_type} which holds static information about each type of
+generator and @code{gsl_rng} which describes an instance of a generator
+created from a given @code{gsl_rng_type}.
+
+The functions described in this section are declared in the header file
+@file{gsl_rng.h}.
+
+@node Random number generator initialization
+@section Random number generator initialization
+
+@deftypefun {gsl_rng *} gsl_rng_alloc (const gsl_rng_type * @var{T})
+This function returns a pointer to a newly-created
+instance of a random number generator of type @var{T}.
+For example, the following code creates an instance of the Tausworthe
+generator,
+
+@example
+gsl_rng * r = gsl_rng_alloc (gsl_rng_taus);
+@end example
+
+If there is insufficient memory to create the generator then the
+function returns a null pointer and the error handler is invoked with an
+error code of @code{GSL_ENOMEM}.
+
+The generator is automatically initialized with the default seed,
+@code{gsl_rng_default_seed}.  This is zero by default but can be changed
+either directly or by using the environment variable @code{GSL_RNG_SEED}
+(@pxref{Random number environment variables}).
+
+The details of the available generator types are
+described later in this chapter.
+@end deftypefun
+
+@deftypefun void gsl_rng_set (const gsl_rng * @var{r}, unsigned long int @var{s})
+This function initializes (or `seeds') the random number generator.  If
+the generator is seeded with the same value of @var{s} on two different
+runs, the same stream of random numbers will be generated by successive
+calls to the routines below.  If different values of @var{s} are
+supplied, then the generated streams of random numbers should be
+completely different.  If the seed @var{s} is zero then the standard seed
+from the original implementation is used instead.  For example, the
+original Fortran source code for the @code{ranlux} generator used a seed
+of 314159265, and so choosing @var{s} equal to zero reproduces this when
+using @code{gsl_rng_ranlux}.
+@end deftypefun
+
+@deftypefun void gsl_rng_free (gsl_rng * @var{r})
+This function frees all the memory associated with the generator
+@var{r}.
+@end deftypefun
+
+@node  Sampling from a random number generator
+@section Sampling from a random number generator
+
+The following functions return uniformly distributed random numbers,
+either as integers or double precision floating point numbers.  To obtain
+non-uniform distributions @pxref{Random Number Distributions}.
+
+@deftypefun {unsigned long int} gsl_rng_get (const gsl_rng * @var{r})
+This function returns a random integer from the generator @var{r}.  The
+minimum and maximum values depend on the algorithm used, but all
+integers in the range [@var{min},@var{max}] are equally likely.  The
+values of @var{min} and @var{max} can determined using the auxiliary
+functions @code{gsl_rng_max (r)} and @code{gsl_rng_min (r)}.
+@end deftypefun
+
+@deftypefun double gsl_rng_uniform (const gsl_rng * @var{r})
+This function returns a double precision floating point number uniformly
+distributed in the range [0,1).  The range includes 0.0 but excludes 1.0.
+The value is typically obtained by dividing the result of
+@code{gsl_rng_get(r)} by @code{gsl_rng_max(r) + 1.0} in double
+precision.  Some generators compute this ratio internally so that they
+can provide floating point numbers with more than 32 bits of randomness
+(the maximum number of bits that can be portably represented in a single
+@code{unsigned long int}).
+@end deftypefun
+
+@deftypefun double gsl_rng_uniform_pos (const gsl_rng * @var{r})
+This function returns a positive double precision floating point number
+uniformly distributed in the range (0,1), excluding both 0.0 and 1.0.
+The number is obtained by sampling the generator with the algorithm of
+@code{gsl_rng_uniform} until a non-zero value is obtained.  You can use
+this function if you need to avoid a singularity at 0.0.
+@end deftypefun
+
+@deftypefun {unsigned long int} gsl_rng_uniform_int (const gsl_rng * @var{r}, unsigned long int @var{n})
+This function returns a random integer from 0 to @math{n-1} inclusive
+by scaling down and/or discarding samples from the generator @var{r}.
+All integers in the range @math{[0,n-1]} are produced with equal
+probability.  For generators with a non-zero minimum value an offset
+is applied so that zero is returned with the correct probability.
+
+Note that this function is designed for sampling from ranges smaller
+than the range of the underlying generator.  The parameter @var{n}
+must be less than or equal to the range of the generator @var{r}.
+If @var{n} is larger than the range of the generator then the function
+calls the error handler with an error code of @code{GSL_EINVAL} and
+returns zero.
+
+In particular, this function is not intended for generating the full range of
+unsigned integer values @c{$[0,2^{32}-1]$} 
+@math{[0,2^32-1]}. Instead
+choose a generator with the maximal integer range and zero mimimum
+value, such as @code{gsl_rng_ranlxd1}, @code{gsl_rng_mt19937} or
+@code{gsl_rng_taus}, and sample it directly using
+@code{gsl_rng_get}.  The range of each generator can be found using
+the auxiliary functions described in the next section.
+@end deftypefun
+
+@node Auxiliary random number generator functions
+@section Auxiliary random number generator functions
+The following functions provide information about an existing
+generator.  You should use them in preference to hard-coding the generator
+parameters into your own code.
+
+@deftypefun {const char *} gsl_rng_name (const gsl_rng * @var{r})
+This function returns a pointer to the name of the generator.
+For example,
+
+@example
+printf ("r is a '%s' generator\n", 
+        gsl_rng_name (r));
+@end example
+
+@noindent
+would print something like @code{r is a 'taus' generator}.
+@end deftypefun
+
+@deftypefun {unsigned long int} gsl_rng_max (const gsl_rng * @var{r})
+@code{gsl_rng_max} returns the largest value that @code{gsl_rng_get}
+can return.
+@end deftypefun
+
+@deftypefun {unsigned long int} gsl_rng_min (const gsl_rng * @var{r})
+@code{gsl_rng_min} returns the smallest value that @code{gsl_rng_get}
+can return.  Usually this value is zero.  There are some generators with
+algorithms that cannot return zero, and for these generators the minimum
+value is 1.
+@end deftypefun
+
+@deftypefun {void *} gsl_rng_state (const gsl_rng * @var{r})
+@deftypefunx size_t gsl_rng_size (const gsl_rng * @var{r})
+These functions return a pointer to the state of generator @var{r} and
+its size.  You can use this information to access the state directly.  For
+example, the following code will write the state of a generator to a
+stream,
+
+@example
+void * state = gsl_rng_state (r);
+size_t n = gsl_rng_size (r);
+fwrite (state, n, 1, stream);
+@end example
+@end deftypefun
+
+@deftypefun {const gsl_rng_type **} gsl_rng_types_setup (void)
+This function returns a pointer to an array of all the available
+generator types, terminated by a null pointer. The function should be
+called once at the start of the program, if needed.  The following code
+fragment shows how to iterate over the array of generator types to print
+the names of the available algorithms,
+
+@example
+const gsl_rng_type **t, **t0;
+
+t0 = gsl_rng_types_setup ();
+
+printf ("Available generators:\n");
+
+for (t = t0; *t != 0; t++)
+  @{
+    printf ("%s\n", (*t)->name);
+  @}
+@end example
+@end deftypefun
+
+@node Random number environment variables
+@section Random number environment variables
+
+The library allows you to choose a default generator and seed from the
+environment variables @code{GSL_RNG_TYPE} and @code{GSL_RNG_SEED} and
+the function @code{gsl_rng_env_setup}.  This makes it easy try out
+different generators and seeds without having to recompile your program.
+
+@deftypefun {const gsl_rng_type *} gsl_rng_env_setup (void)
+This function reads the environment variables @code{GSL_RNG_TYPE} and
+@code{GSL_RNG_SEED} and uses their values to set the corresponding
+library variables @code{gsl_rng_default} and
+@code{gsl_rng_default_seed}.  These global variables are defined as
+follows,
+
+@example
+extern const gsl_rng_type *gsl_rng_default
+extern unsigned long int gsl_rng_default_seed
+@end example
+
+The environment variable @code{GSL_RNG_TYPE} should be the name of a
+generator, such as @code{taus} or @code{mt19937}.  The environment
+variable @code{GSL_RNG_SEED} should contain the desired seed value.  It
+is converted to an @code{unsigned long int} using the C library function
+@code{strtoul}.
+
+If you don't specify a generator for @code{GSL_RNG_TYPE} then
+@code{gsl_rng_mt19937} is used as the default.  The initial value of
+@code{gsl_rng_default_seed} is zero.
+
+@end deftypefun
+
+@noindent
+@need 2000
+Here is a short program which shows how to create a global
+generator using the environment variables @code{GSL_RNG_TYPE} and
+@code{GSL_RNG_SEED},
+
+@example
+@verbatiminclude examples/rng.c
+@end example
+
+@noindent
+Running the program without any environment variables uses the initial
+defaults, an @code{mt19937} generator with a seed of 0,
+
+@example
+$ ./a.out 
+@verbatiminclude examples/rng.out
+@end example
+
+@noindent
+By setting the two variables on the command line we can
+change the default generator and the seed,
+
+@example
+$ GSL_RNG_TYPE="taus" GSL_RNG_SEED=123 ./a.out 
+GSL_RNG_TYPE=taus
+GSL_RNG_SEED=123
+generator type: taus
+seed = 123
+first value = 2720986350
+@end example
+
+@node Copying random number generator state
+@section Copying random number generator state
+
+The above methods do not expose the random number `state' which changes
+from call to call.  It is often useful to be able to save and restore
+the state.  To permit these practices, a few somewhat more advanced
+functions are supplied.  These include:
+
+@deftypefun int gsl_rng_memcpy (gsl_rng * @var{dest}, const gsl_rng * @var{src})
+This function copies the random number generator @var{src} into the
+pre-existing generator @var{dest}, making @var{dest} into an exact copy
+of @var{src}.  The two generators must be of the same type.
+@end deftypefun
+
+@deftypefun {gsl_rng *} gsl_rng_clone (const gsl_rng * @var{r})
+This function returns a pointer to a newly created generator which is an
+exact copy of the generator @var{r}.
+@end deftypefun
+
+@node Reading and writing random number generator state 
+@section Reading and writing random number generator state
+
+The library provides functions for reading and writing the random
+number state to a file as binary data or formatted text.
+
+@deftypefun int gsl_rng_fwrite (FILE * @var{stream}, const gsl_rng * @var{r})
+This function writes the random number state of the random number
+generator @var{r} to the stream @var{stream} in binary format.  The
+return value is 0 for success and @code{GSL_EFAILED} if there was a
+problem writing to the file.  Since the data is written in the native
+binary format it may not be portable between different architectures.
+@end deftypefun
+
+@deftypefun int gsl_rng_fread (FILE * @var{stream}, gsl_rng * @var{r})
+This function reads the random number state into the random number
+generator @var{r} from the open stream @var{stream} in binary format.
+The random number generator @var{r} must be preinitialized with the
+correct random number generator type since type information is not
+saved.  The return value is 0 for success and @code{GSL_EFAILED} if
+there was a problem reading from the file.  The data is assumed to
+have been written in the native binary format on the same
+architecture.
+@end deftypefun
+
+@node Random number generator algorithms
+@section Random number generator algorithms
+
+The functions described above make no reference to the actual algorithm
+used.  This is deliberate so that you can switch algorithms without
+having to change any of your application source code.  The library
+provides a large number of generators of different types, including
+simulation quality generators, generators provided for compatibility
+with other libraries and historical generators from the past.
+
+The following generators are recommended for use in simulation.  They
+have extremely long periods, low correlation and pass most statistical
+tests.  For the most reliable source of uncorrelated numbers, the
+second-generation @sc{ranlux} generators have the strongest proof of
+randomness.
+
+@deffn {Generator} gsl_rng_mt19937
+@cindex MT19937 random number generator
+The MT19937 generator of Makoto Matsumoto and Takuji Nishimura is a
+variant of the twisted generalized feedback shift-register algorithm,
+and is known as the ``Mersenne Twister'' generator.  It has a Mersenne
+prime period of 
+@comment
+@c{$2^{19937} - 1$} 
+@math{2^19937 - 1} (about 
+@c{$10^{6000}$}
+@math{10^6000}) and is
+equi-distributed in 623 dimensions.  It has passed the @sc{diehard}
+statistical tests.  It uses 624 words of state per generator and is
+comparable in speed to the other generators.  The original generator used
+a default seed of 4357 and choosing @var{s} equal to zero in
+@code{gsl_rng_set} reproduces this.  Later versions switched to 5489
+as the default seed, you can choose this explicitly via @code{gsl_rng_set} 
+instead if you require it.
+
+For more information see,
+@itemize @asis
+@item
+Makoto Matsumoto and Takuji Nishimura, ``Mersenne Twister: A
+623-dimensionally equidistributed uniform pseudorandom number
+generator''. @cite{ACM Transactions on Modeling and Computer
+Simulation}, Vol.@: 8, No.@: 1 (Jan. 1998), Pages 3--30
+@end itemize
+
+@noindent
+The generator @code{gsl_rng_mt19937} uses the second revision of the
+seeding procedure published by the two authors above in 2002.  The
+original seeding procedures could cause spurious artifacts for some seed
+values. They are still available through the alternative generators
+@code{gsl_rng_mt19937_1999} and @code{gsl_rng_mt19937_1998}.
+@end deffn
+
+@deffn {Generator} gsl_rng_ranlxs0
+@deffnx {Generator} gsl_rng_ranlxs1
+@deffnx {Generator} gsl_rng_ranlxs2
+@cindex RANLXS random number generator
+
+The generator @code{ranlxs0} is a second-generation version of the
+@sc{ranlux} algorithm of L@"uscher, which produces ``luxury random
+numbers''.  This generator provides single precision output (24 bits) at
+three luxury levels @code{ranlxs0}, @code{ranlxs1} and @code{ranlxs2}, 
+in increasing order of strength.
+It uses double-precision floating point arithmetic internally and can be
+significantly faster than the integer version of @code{ranlux},
+particularly on 64-bit architectures.  The period of the generator is
+about @c{$10^{171}$} 
+@math{10^171}.  The algorithm has mathematically proven properties and
+can provide truly decorrelated numbers at a known level of randomness.
+The higher luxury levels provide increased decorrelation between samples
+as an additional safety margin.
+@end deffn
+
+@deffn {Generator} gsl_rng_ranlxd1
+@deffnx {Generator} gsl_rng_ranlxd2
+@cindex RANLXD random number generator
+
+These generators produce double precision output (48 bits) from the
+@sc{ranlxs} generator.  The library provides two luxury levels
+@code{ranlxd1} and @code{ranlxd2}, in increasing order of strength.
+@end deffn
+
+
+@deffn {Generator} gsl_rng_ranlux
+@deffnx {Generator} gsl_rng_ranlux389
+
+@cindex RANLUX random number generator
+The @code{ranlux} generator is an implementation of the original
+algorithm developed by L@"uscher.  It uses a
+lagged-fibonacci-with-skipping algorithm to produce ``luxury random
+numbers''.  It is a 24-bit generator, originally designed for
+single-precision IEEE floating point numbers.  This implementation is
+based on integer arithmetic, while the second-generation versions
+@sc{ranlxs} and @sc{ranlxd} described above provide floating-point
+implementations which will be faster on many platforms.
+The period of the generator is about @c{$10^{171}$} 
+@math{10^171}.  The algorithm has mathematically proven properties and
+it can provide truly decorrelated numbers at a known level of
+randomness.  The default level of decorrelation recommended by L@"uscher
+is provided by @code{gsl_rng_ranlux}, while @code{gsl_rng_ranlux389}
+gives the highest level of randomness, with all 24 bits decorrelated.
+Both types of generator use 24 words of state per generator.
+
+For more information see,
+@itemize @asis
+@item
+M. L@"uscher, ``A portable high-quality random number generator for
+lattice field theory calculations'', @cite{Computer Physics
+Communications}, 79 (1994) 100--110.
+@item
+F. James, ``RANLUX: A Fortran implementation of the high-quality
+pseudo-random number generator of L@"uscher'', @cite{Computer Physics
+Communications}, 79 (1994) 111--114
+@end itemize
+@end deffn
+
+
+@deffn {Generator} gsl_rng_cmrg
+@cindex CMRG, combined multiple recursive random number generator
+This is a combined multiple recursive generator by L'Ecuyer. 
+Its sequence is,
+@tex
+\beforedisplay
+$$
+z_n = (x_n - y_n) \,\hbox{mod}\, m_1
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+z_n = (x_n - y_n) mod m_1
+@end example
+
+@end ifinfo
+@noindent
+where the two underlying generators @math{x_n} and @math{y_n} are,
+@tex
+\beforedisplay
+$$
+\eqalign{ 
+x_n & = (a_1 x_{n-1} + a_2 x_{n-2} + a_3 x_{n-3}) \,\hbox{mod}\, m_1 \cr
+y_n & = (b_1 y_{n-1} + b_2 y_{n-2} + b_3 y_{n-3}) \,\hbox{mod}\, m_2
+}
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_n = (a_1 x_@{n-1@} + a_2 x_@{n-2@} + a_3 x_@{n-3@}) mod m_1
+y_n = (b_1 y_@{n-1@} + b_2 y_@{n-2@} + b_3 y_@{n-3@}) mod m_2
+@end example
+
+@end ifinfo
+@noindent
+with coefficients 
+@math{a_1 = 0}, 
+@math{a_2 = 63308}, 
+@math{a_3 = -183326},
+@math{b_1 = 86098}, 
+@math{b_2 = 0},
+@math{b_3 = -539608},
+and moduli 
+@c{$m_1 = 2^{31} - 1 = 2147483647$} 
+@math{m_1 = 2^31 - 1 = 2147483647}
+and 
+@c{$m_2 = 2145483479$}
+@math{m_2 = 2145483479}.
+
+The period of this generator is  
+@c{$\hbox{lcm}(m_1^3-1, m_2^3-1)$}
+@math{lcm(m_1^3-1, m_2^3-1)},
+which is approximately
+@c{$2^{185}$}
+@math{2^185} 
+(about 
+@c{$10^{56}$}
+@math{10^56}).  It uses
+6 words of state per generator.  For more information see,
+
+@itemize @asis
+@item
+P. L'Ecuyer, ``Combined Multiple Recursive Random Number
+Generators'', @cite{Operations Research}, 44, 5 (1996), 816--822.
+@end itemize
+@end deffn
+
+@deffn {Generator} gsl_rng_mrg
+@cindex MRG, multiple recursive random number generator
+This is a fifth-order multiple recursive generator by L'Ecuyer, Blouin
+and Coutre.  Its sequence is,
+@tex
+\beforedisplay
+$$
+x_n = (a_1 x_{n-1} + a_5 x_{n-5}) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_n = (a_1 x_@{n-1@} + a_5 x_@{n-5@}) mod m
+@end example
+
+@end ifinfo
+@noindent
+with 
+@math{a_1 = 107374182}, 
+@math{a_2 = a_3 = a_4 = 0}, 
+@math{a_5 = 104480}
+and 
+@c{$m = 2^{31}-1$}
+@math{m = 2^31 - 1}.
+
+The period of this generator is about 
+@c{$10^{46}$}
+@math{10^46}.  It uses 5 words
+of state per generator.  More information can be found in the following
+paper,
+@itemize @asis
+@item
+P. L'Ecuyer, F. Blouin, and R. Coutre, ``A search for good multiple
+recursive random number generators'', @cite{ACM Transactions on Modeling and
+Computer Simulation} 3, 87--98 (1993).
+@end itemize
+@end deffn
+
+@deffn {Generator} gsl_rng_taus
+@deffnx {Generator} gsl_rng_taus2
+@cindex Tausworthe random number generator
+This is a maximally equidistributed combined Tausworthe generator by
+L'Ecuyer.  The sequence is,
+@tex
+\beforedisplay
+$$
+x_n = (s^1_n \oplus s^2_n \oplus s^3_n) 
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_n = (s1_n ^^ s2_n ^^ s3_n) 
+@end example
+
+@end ifinfo
+@noindent
+where,
+@tex
+\beforedisplay
+$$
+\eqalign{
+s^1_{n+1} &= (((s^1_n \& 4294967294)\ll 12) \oplus (((s^1_n\ll 13) \oplus s^1_n)\gg 19)) \cr
+s^2_{n+1} &= (((s^2_n \& 4294967288)\ll 4) \oplus (((s^2_n\ll 2) \oplus s^2_n)\gg 25)) \cr
+s^3_{n+1} &= (((s^3_n \& 4294967280)\ll 17) \oplus (((s^3_n\ll 3) \oplus s^3_n)\gg 11))
+}
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+s1_@{n+1@} = (((s1_n&4294967294)<<12)^^(((s1_n<<13)^^s1_n)>>19))
+s2_@{n+1@} = (((s2_n&4294967288)<< 4)^^(((s2_n<< 2)^^s2_n)>>25))
+s3_@{n+1@} = (((s3_n&4294967280)<<17)^^(((s3_n<< 3)^^s3_n)>>11))
+@end example
+
+@end ifinfo
+@noindent
+computed modulo 
+@c{$2^{32}$}
+@math{2^32}.  In the formulas above 
+@c{$\oplus$}
+@math{^^}
+denotes ``exclusive-or''.  Note that the algorithm relies on the properties
+of 32-bit unsigned integers and has been implemented using a bitmask
+of @code{0xFFFFFFFF} to make it work on 64 bit machines.
+
+The period of this generator is @c{$2^{88}$}
+@math{2^88} (about
+@c{$10^{26}$}
+@math{10^26}).  It uses 3 words of state per generator.  For more
+information see,
+
+@itemize @asis
+@item
+P. L'Ecuyer, ``Maximally Equidistributed Combined Tausworthe
+Generators'', @cite{Mathematics of Computation}, 65, 213 (1996), 203--213.
+@end itemize
+
+@noindent
+The generator @code{gsl_rng_taus2} uses the same algorithm as
+@code{gsl_rng_taus} but with an improved seeding procedure described in
+the paper,
+
+@itemize @asis
+@item
+P. L'Ecuyer, ``Tables of Maximally Equidistributed Combined LFSR
+Generators'', @cite{Mathematics of Computation}, 68, 225 (1999), 261--269
+@end itemize
+
+@noindent
+The generator @code{gsl_rng_taus2} should now be used in preference to
+@code{gsl_rng_taus}.
+@end deffn
+
+@deffn {Generator} gsl_rng_gfsr4
+@cindex Four-tap Generalized Feedback Shift Register
+The @code{gfsr4} generator is like a lagged-fibonacci generator, and 
+produces each number as an @code{xor}'d sum of four previous values.
+@tex
+\beforedisplay
+$$
+r_n = r_{n-A} \oplus r_{n-B} \oplus r_{n-C} \oplus r_{n-D}
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+r_n = r_@{n-A@} ^^ r_@{n-B@} ^^ r_@{n-C@} ^^ r_@{n-D@}
+@end example
+@end ifinfo
+
+Ziff (ref below) notes that ``it is now widely known'' that two-tap
+registers (such as R250, which is described below)
+have serious flaws, the most obvious one being the three-point
+correlation that comes from the definition of the generator.  Nice
+mathematical properties can be derived for GFSR's, and numerics bears
+out the claim that 4-tap GFSR's with appropriately chosen offsets are as
+random as can be measured, using the author's test.
+
+This implementation uses the values suggested the example on p392 of
+Ziff's article: @math{A=471}, @math{B=1586}, @math{C=6988}, @math{D=9689}.
+
+
+If the offsets are appropriately chosen (such as the one ones in this
+implementation), then the sequence is said to be maximal; that means
+that the period is @math{2^D - 1}, where @math{D} is the longest lag.
+(It is one less than @math{2^D} because it is not permitted to have all
+zeros in the @code{ra[]} array.)  For this implementation with
+@math{D=9689} that works out to about @c{$10^{2917}$}
+@math{10^2917}.
+
+Note that the implementation of this generator using a 32-bit
+integer amounts to 32 parallel implementations of one-bit
+generators.  One consequence of this is that the period of this
+32-bit generator is the same as for the one-bit generator.
+Moreover, this independence means that all 32-bit patterns are
+equally likely, and in particular that 0 is an allowed random
+value.  (We are grateful to Heiko Bauke for clarifying for us these
+properties of GFSR random number generators.)
+
+For more information see,
+@itemize @asis
+@item
+Robert M. Ziff, ``Four-tap shift-register-sequence random-number 
+generators'', @cite{Computers in Physics}, 12(4), Jul/Aug
+1998, pp 385--392.
+@end itemize
+@end deffn
+
+@node Unix random number generators
+@section Unix random number generators
+
+The standard Unix random number generators @code{rand}, @code{random}
+and @code{rand48} are provided as part of GSL. Although these
+generators are widely available individually often they aren't all
+available on the same platform.  This makes it difficult to write
+portable code using them and so we have included the complete set of
+Unix generators in GSL for convenience.  Note that these generators
+don't produce high-quality randomness and aren't suitable for work
+requiring accurate statistics.  However, if you won't be measuring
+statistical quantities and just want to introduce some variation into
+your program then these generators are quite acceptable.
+
+@cindex rand, BSD random number generator
+@cindex Unix random number generators, rand
+@cindex Unix random number generators, rand48
+
+@deffn {Generator} gsl_rng_rand
+@cindex BSD random number generator
+This is the BSD @code{rand} generator.  Its sequence is
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n + c) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n + c) mod m
+@end example
+
+@end ifinfo
+@noindent
+with 
+@math{a = 1103515245}, 
+@math{c = 12345} and 
+@c{$m = 2^{31}$}
+@math{m = 2^31}.
+The seed specifies the initial value, 
+@math{x_1}.  The period of this
+generator is 
+@c{$2^{31}$}
+@math{2^31}, and it uses 1 word of storage per
+generator.
+@end deffn
+
+@deffn {Generator} gsl_rng_random_bsd
+@deffnx {Generator} gsl_rng_random_libc5
+@deffnx {Generator} gsl_rng_random_glibc2
+These generators implement the @code{random} family of functions, a
+set of linear feedback shift register generators originally used in BSD
+Unix.  There are several versions of @code{random} in use today: the
+original BSD version (e.g. on SunOS4), a libc5 version (found on
+older GNU/Linux systems) and a glibc2 version.  Each version uses a
+different seeding procedure, and thus produces different sequences.
+
+The original BSD routines accepted a variable length buffer for the
+generator state, with longer buffers providing higher-quality
+randomness.  The @code{random} function implemented algorithms for
+buffer lengths of 8, 32, 64, 128 and 256 bytes, and the algorithm with
+the largest length that would fit into the user-supplied buffer was
+used.  To support these algorithms additional generators are available
+with the following names,
+
+@example
+gsl_rng_random8_bsd
+gsl_rng_random32_bsd
+gsl_rng_random64_bsd
+gsl_rng_random128_bsd
+gsl_rng_random256_bsd
+@end example
+
+@noindent
+where the numeric suffix indicates the buffer length.  The original BSD
+@code{random} function used a 128-byte default buffer and so
+@code{gsl_rng_random_bsd} has been made equivalent to
+@code{gsl_rng_random128_bsd}.  Corresponding versions of the @code{libc5}
+and @code{glibc2} generators are also available, with the names
+@code{gsl_rng_random8_libc5}, @code{gsl_rng_random8_glibc2}, etc.
+@end deffn
+
+@deffn {Generator} gsl_rng_rand48
+@cindex rand48 random number generator
+This is the Unix @code{rand48} generator.  Its sequence is
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n + c) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n + c) mod m
+@end example
+
+@end ifinfo
+@noindent
+defined on 48-bit unsigned integers with 
+@math{a = 25214903917}, 
+@math{c = 11} and 
+@c{$m = 2^{48}$} 
+@math{m = 2^48}. 
+The seed specifies the upper 32 bits of the initial value, @math{x_1},
+with the lower 16 bits set to @code{0x330E}.  The function
+@code{gsl_rng_get} returns the upper 32 bits from each term of the
+sequence.  This does not have a direct parallel in the original
+@code{rand48} functions, but forcing the result to type @code{long int}
+reproduces the output of @code{mrand48}.  The function
+@code{gsl_rng_uniform} uses the full 48 bits of internal state to return
+the double precision number @math{x_n/m}, which is equivalent to the
+function @code{drand48}.  Note that some versions of the GNU C Library
+contained a bug in @code{mrand48} function which caused it to produce
+different results (only the lower 16-bits of the return value were set).
+@end deffn
+
+@node Other random number generators
+@section Other random number generators
+
+The generators in this section are provided for compatibility with
+existing libraries.  If you are converting an existing program to use GSL
+then you can select these generators to check your new implementation
+against the original one, using the same random number generator.  After
+verifying that your new program reproduces the original results you can
+then switch to a higher-quality generator.
+
+Note that most of the generators in this section are based on single
+linear congruence relations, which are the least sophisticated type of
+generator.  In particular, linear congruences have poor properties when
+used with a non-prime modulus, as several of these routines do (e.g.
+with a power of two modulus, 
+@c{$2^{31}$}
+@math{2^31} or 
+@c{$2^{32}$}
+@math{2^32}).  This
+leads to periodicity in the least significant bits of each number,
+with only the higher bits having any randomness.  Thus if you want to
+produce a random bitstream it is best to avoid using the least
+significant bits.
+
+@deffn {Generator} gsl_rng_ranf
+@cindex RANF random number generator
+@cindex CRAY random number generator, RANF
+This is the CRAY random number generator @code{RANF}.  Its sequence is
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n) mod m
+@end example
+
+@end ifinfo
+@noindent
+defined on 48-bit unsigned integers with @math{a = 44485709377909} and
+@c{$m = 2^{48}$}
+@math{m = 2^48}.  The seed specifies the lower
+32 bits of the initial value, 
+@math{x_1}, with the lowest bit set to
+prevent the seed taking an even value.  The upper 16 bits of 
+@math{x_1}
+are set to 0. A consequence of this procedure is that the pairs of seeds
+2 and 3, 4 and 5, etc produce the same sequences.
+
+The generator compatible with the CRAY MATHLIB routine RANF. It
+produces double precision floating point numbers which should be
+identical to those from the original RANF.
+
+There is a subtlety in the implementation of the seeding.  The initial
+state is reversed through one step, by multiplying by the modular
+inverse of @math{a} mod @math{m}.  This is done for compatibility with
+the original CRAY implementation.
+
+Note that you can only seed the generator with integers up to
+@c{$2^{32}$}
+@math{2^32}, while the original CRAY implementation uses
+non-portable wide integers which can cover all 
+@c{$2^{48}$}
+@math{2^48} states of the generator.
+
+The function @code{gsl_rng_get} returns the upper 32 bits from each term
+of the sequence.  The function @code{gsl_rng_uniform} uses the full 48
+bits to return the double precision number @math{x_n/m}.
+
+The period of this generator is @c{$2^{46}$}
+@math{2^46}.
+@end deffn
+
+@deffn {Generator} gsl_rng_ranmar
+@cindex RANMAR random number generator
+This is the RANMAR lagged-fibonacci generator of Marsaglia, Zaman and
+Tsang.  It is a 24-bit generator, originally designed for
+single-precision IEEE floating point numbers.  It was included in the
+CERNLIB high-energy physics library.
+@end deffn
+
+@deffn {Generator} gsl_rng_r250
+@cindex shift-register random number generator
+@cindex R250 shift-register random number generator
+This is the shift-register generator of Kirkpatrick and Stoll.  The
+sequence is based on the recurrence
+@tex
+\beforedisplay
+$$ 
+x_n = x_{n-103} \oplus x_{n-250}
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_n = x_@{n-103@} ^^ x_@{n-250@}
+@end example
+
+@end ifinfo
+@noindent
+where 
+@c{$\oplus$}
+@math{^^} denotes ``exclusive-or'', defined on
+32-bit words.  The period of this generator is about @c{$2^{250}$}
+@math{2^250} and it
+uses 250 words of state per generator.
+
+For more information see,
+@itemize @asis
+@item
+S. Kirkpatrick and E. Stoll, ``A very fast shift-register sequence random
+number generator'', @cite{Journal of Computational Physics}, 40, 517--526
+(1981)
+@end itemize
+@end deffn
+
+@deffn {Generator} gsl_rng_tt800
+@cindex TT800 random number generator
+This is an earlier version of the twisted generalized feedback
+shift-register generator, and has been superseded by the development of
+MT19937.  However, it is still an acceptable generator in its own
+right.  It has a period of 
+@c{$2^{800}$}
+@math{2^800} and uses 33 words of storage
+per generator.
+
+For more information see,
+@itemize @asis
+@item
+Makoto Matsumoto and Yoshiharu Kurita, ``Twisted GFSR Generators
+II'', @cite{ACM Transactions on Modelling and Computer Simulation},
+Vol.@: 4, No.@: 3, 1994, pages 254--266.
+@end itemize
+@end deffn
+
+@comment The following generators are included only for historical reasons, so
+@comment that you can reproduce results from old programs which might have used
+@comment them.  These generators should not be used for real simulations since
+@comment they have poor statistical properties by modern standards.
+
+@deffn {Generator} gsl_rng_vax
+@cindex VAX random number generator
+This is the VAX generator @code{MTH$RANDOM}.  Its sequence is,
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n + c) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n + c) mod m
+@end example
+
+@end ifinfo
+@noindent
+with 
+@math{a = 69069}, @math{c = 1} and 
+@c{$m = 2^{32}$}
+@math{m = 2^32}.  The seed specifies the initial value, 
+@math{x_1}.  The
+period of this generator is 
+@c{$2^{32}$}
+@math{2^32} and it uses 1 word of storage per
+generator.
+@end deffn
+
+@deffn {Generator} gsl_rng_transputer
+This is the random number generator from the INMOS Transputer
+Development system.  Its sequence is,
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n) mod m
+@end example
+
+@end ifinfo
+@noindent
+with @math{a = 1664525} and 
+@c{$m = 2^{32}$}
+@math{m = 2^32}.
+The seed specifies the initial value, 
+@c{$x_1$}
+@math{x_1}.
+@end deffn
+
+@deffn {Generator} gsl_rng_randu
+@cindex RANDU random number generator
+This is the IBM @code{RANDU} generator.  Its sequence is
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n) mod m
+@end example
+
+@end ifinfo
+@noindent
+with @math{a = 65539} and 
+@c{$m = 2^{31}$}
+@math{m = 2^31}.  The
+seed specifies the initial value, 
+@math{x_1}.  The period of this
+generator was only 
+@c{$2^{29}$}
+@math{2^29}.  It has become a textbook example of a
+poor generator.
+@end deffn
+
+@deffn {Generator} gsl_rng_minstd
+@cindex RANMAR random number generator
+This is Park and Miller's ``minimal standard'' @sc{minstd} generator, a
+simple linear congruence which takes care to avoid the major pitfalls of
+such algorithms.  Its sequence is,
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n) mod m
+@end example
+
+@end ifinfo
+@noindent
+with @math{a = 16807} and 
+@c{$m = 2^{31} - 1 = 2147483647$}
+@math{m = 2^31 - 1 = 2147483647}. 
+The seed specifies the initial value, 
+@c{$x_1$}
+@math{x_1}.  The period of this
+generator is about 
+@c{$2^{31}$}
+@math{2^31}.
+
+This generator is used in the IMSL Library (subroutine RNUN) and in
+MATLAB (the RAND function).  It is also sometimes known by the acronym
+``GGL'' (I'm not sure what that stands for).
+
+For more information see,
+@itemize @asis
+@item
+Park and Miller, ``Random Number Generators: Good ones are hard to find'',
+@cite{Communications of the ACM}, October 1988, Volume 31, No 10, pages
+1192--1201.
+@end itemize
+@end deffn
+
+@deffn {Generator} gsl_rng_uni
+@deffnx {Generator} gsl_rng_uni32
+This is a reimplementation of the 16-bit SLATEC random number generator
+RUNIF. A generalization of the generator to 32 bits is provided by
+@code{gsl_rng_uni32}.  The original source code is available from NETLIB.
+@end deffn
+
+@deffn {Generator} gsl_rng_slatec
+This is the SLATEC random number generator RAND. It is ancient.  The
+original source code is available from NETLIB.
+@end deffn
+
+
+@deffn {Generator} gsl_rng_zuf
+This is the ZUFALL lagged Fibonacci series generator of Peterson.  Its
+sequence is,
+@tex
+\beforedisplay
+$$ 
+\eqalign{
+t &= u_{n-273} + u_{n-607} \cr
+u_n  &= t - \hbox{floor}(t)
+}
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+t = u_@{n-273@} + u_@{n-607@}
+u_n  = t - floor(t)
+@end example
+@end ifinfo
+
+The original source code is available from NETLIB.  For more information
+see,
+@itemize @asis
+@item
+W. Petersen, ``Lagged Fibonacci Random Number Generators for the NEC
+SX-3'', @cite{International Journal of High Speed Computing} (1994).
+@end itemize
+@end deffn
+
+@deffn {Generator} gsl_rng_knuthran2
+This is a second-order multiple recursive generator described by Knuth
+in @cite{Seminumerical Algorithms}, 3rd Ed., page 108.  Its sequence is,
+@tex
+\beforedisplay
+$$
+x_n = (a_1 x_{n-1} + a_2 x_{n-2}) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_n = (a_1 x_@{n-1@} + a_2 x_@{n-2@}) mod m
+@end example
+
+@end ifinfo
+@noindent
+with 
+@math{a_1 = 271828183}, 
+@math{a_2 = 314159269}, 
+and 
+@c{$m = 2^{31}-1$}
+@math{m = 2^31 - 1}.
+@end deffn
+
+@deffn {Generator} gsl_rng_knuthran2002
+@deffnx {Generator} gsl_rng_knuthran
+This is a second-order multiple recursive generator described by Knuth
+in @cite{Seminumerical Algorithms}, 3rd Ed., Section 3.6.  Knuth
+provides its C code.  The updated routine @code{gsl_rng_knuthran2002}
+is from the revised 9th printing and corrects some weaknesses in the
+earlier version, which is implemented as @code{gsl_rng_knuthran}.
+@end deffn
+
+@deffn {Generator} gsl_rng_borosh13
+@deffnx {Generator} gsl_rng_fishman18
+@deffnx {Generator} gsl_rng_fishman20
+@deffnx {Generator} gsl_rng_lecuyer21
+@deffnx {Generator} gsl_rng_waterman14
+These multiplicative generators are taken from Knuth's
+@cite{Seminumerical Algorithms}, 3rd Ed., pages 106--108. Their sequence
+is,
+@tex
+\beforedisplay
+$$
+x_{n+1} = (a x_n) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (a x_n) mod m
+@end example
+
+@end ifinfo
+@noindent
+where the seed specifies the initial value, @c{$x_1$}
+@math{x_1}.
+The parameters @math{a} and @math{m} are as follows,
+Borosh-Niederreiter: 
+@math{a = 1812433253}, @c{$m = 2^{32}$}
+@math{m = 2^32},
+Fishman18:
+@math{a = 62089911},
+@c{$m = 2^{31}-1$}
+@math{m = 2^31 - 1},
+Fishman20:
+@math{a = 48271},
+@c{$m = 2^{31}-1$}
+@math{m = 2^31 - 1},
+L'Ecuyer:
+@math{a = 40692},
+@c{$m = 2^{31}-249$}
+@math{m = 2^31 - 249},
+Waterman:
+@math{a = 1566083941},
+@c{$m = 2^{32}$}
+@math{m = 2^32}.
+@end deffn
+
+@deffn {Generator} gsl_rng_fishman2x
+This is the L'Ecuyer--Fishman random number generator. It is taken from
+Knuth's @cite{Seminumerical Algorithms}, 3rd Ed., page 108. Its sequence
+is,
+@tex
+\beforedisplay
+$$
+z_{n+1} = (x_n - y_n) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+z_@{n+1@} = (x_n - y_n) mod m
+@end example
+
+@end ifinfo
+@noindent
+with @c{$m = 2^{31}-1$}
+@math{m = 2^31 - 1}.
+@math{x_n} and @math{y_n} are given by the @code{fishman20} 
+and @code{lecuyer21} algorithms.
+The seed specifies the initial value, 
+@c{$x_1$}
+@math{x_1}.
+
+@end deffn
+
+
+@deffn {Generator} gsl_rng_coveyou
+This is the Coveyou random number generator. It is taken from Knuth's
+@cite{Seminumerical Algorithms}, 3rd Ed., Section 3.2.2. Its sequence
+is,
+@tex
+\beforedisplay
+$$
+x_{n+1} = (x_n (x_n + 1)) \,\hbox{mod}\, m
+$$
+\afterdisplay
+@end tex
+@ifinfo
+
+@example
+x_@{n+1@} = (x_n (x_n + 1)) mod m
+@end example
+
+@end ifinfo
+@noindent
+with @c{$m = 2^{32}$}
+@math{m = 2^32}.
+The seed specifies the initial value, 
+@c{$x_1$}
+@math{x_1}.
+@end deffn
+
+
+
+
+
+@node Random Number Generator Performance
+@section Performance
+
+@comment
+@comment I made the original plot like this
+@comment ./benchmark > tmp; cat tmp | perl -n -e '($n,$s) = split(" ",$_); printf("%17s ",$n); print "-" x ($s/1e5), "\n";'
+@comment
+
+The following table shows the relative performance of a selection the
+available random number generators.  The fastest simulation quality
+generators are @code{taus}, @code{gfsr4} and @code{mt19937}.  The
+generators which offer the best mathematically-proven quality are those
+based on the @sc{ranlux} algorithm.
+
+@comment The large number of generators based on single linear congruences are
+@comment represented by the @code{random} generator below.  These generators are
+@comment fast but have the lowest statistical quality.
+
+@example
+1754 k ints/sec,    870 k doubles/sec, taus
+1613 k ints/sec,    855 k doubles/sec, gfsr4
+1370 k ints/sec,    769 k doubles/sec, mt19937
+ 565 k ints/sec,    571 k doubles/sec, ranlxs0
+ 400 k ints/sec,    405 k doubles/sec, ranlxs1
+ 490 k ints/sec,    389 k doubles/sec, mrg
+ 407 k ints/sec,    297 k doubles/sec, ranlux
+ 243 k ints/sec,    254 k doubles/sec, ranlxd1
+ 251 k ints/sec,    253 k doubles/sec, ranlxs2
+ 238 k ints/sec,    215 k doubles/sec, cmrg
+ 247 k ints/sec,    198 k doubles/sec, ranlux389
+ 141 k ints/sec,    140 k doubles/sec, ranlxd2
+
+1852 k ints/sec,    935 k doubles/sec, ran3
+ 813 k ints/sec,    575 k doubles/sec, ran0
+ 787 k ints/sec,    476 k doubles/sec, ran1
+ 379 k ints/sec,    292 k doubles/sec, ran2
+@end example
+
+@node Random Number Generator Examples
+@section Examples
+
+The following program demonstrates the use of a random number generator
+to produce uniform random numbers in the range [0.0, 1.0),
+
+@example
+@verbatiminclude examples/rngunif.c
+@end example
+
+@noindent
+Here is the output of the program,
+
+@example
+$ ./a.out 
+@verbatiminclude examples/rngunif.out
+@end example
+
+@noindent
+The numbers depend on the seed used by the generator.  The default seed
+can be changed with the @code{GSL_RNG_SEED} environment variable to
+produce a different stream of numbers.  The generator itself can be
+changed using the environment variable @code{GSL_RNG_TYPE}.  Here is the
+output of the program using a seed value of 123 and the
+multiple-recursive generator @code{mrg},
+
+@example
+$ GSL_RNG_SEED=123 GSL_RNG_TYPE=mrg ./a.out 
+@verbatiminclude examples/rngunif.2.out
+@end example
+
+@node Random Number References and Further Reading
+@section References and Further Reading
+
+The subject of random number generation and testing is reviewed
+extensively in Knuth's @cite{Seminumerical Algorithms}.
+
+@itemize @asis
+@item
+Donald E. Knuth, @cite{The Art of Computer Programming: Seminumerical
+Algorithms} (Vol 2, 3rd Ed, 1997), Addison-Wesley, ISBN 0201896842.
+@end itemize
+
+@noindent
+Further information is available in the review paper written by Pierre
+L'Ecuyer,
+
+@itemize @asis
+P. L'Ecuyer, ``Random Number Generation'', Chapter 4 of the
+Handbook on Simulation, Jerry Banks Ed., Wiley, 1998, 93--137.
+
+@uref{http://www.iro.umontreal.ca/~lecuyer/papers.html}
+in the file @file{handsim.ps}.
+@end itemize
+
+@noindent
+The source code for the @sc{diehard} random number generator tests is also
+available online,
+
+@itemize @asis
+@item
+@cite{DIEHARD source code} G. Marsaglia,
+@item
+@uref{http://stat.fsu.edu/pub/diehard/}
+@end itemize
+
+@noindent
+A comprehensive set of random number generator tests is available from
+@sc{nist},
+
+@itemize @asis
+@item
+NIST Special Publication 800-22, ``A Statistical Test Suite for the
+Validation of Random Number Generators and Pseudo Random Number
+Generators for Cryptographic Applications''.
+@item
+@uref{http://csrc.nist.gov/rng/}
+@end itemize
+
+@node Random Number Acknowledgements
+@section Acknowledgements
+
+Thanks to Makoto Matsumoto, Takuji Nishimura and Yoshiharu Kurita for
+making the source code to their generators (MT19937, MM&TN; TT800,
+MM&YK) available under the GNU General Public License.  Thanks to Martin
+L@"uscher for providing notes and source code for the @sc{ranlxs} and
+@sc{ranlxd} generators.
+
+@comment lcg
+@comment [ LCG(n) := n * 69069 mod (2^32) ]
+@comment First 6: [69069, 475559465, 2801775573, 1790562961, 3104832285, 4238970681]
+@comment %2^31-1   69069, 475559465, 654291926, 1790562961, 957348638, 2091487034
+@comment mrg
+@comment [q([x1, x2, x3, x4, x5]) := [107374182 mod 2147483647 * x1 + 104480 mod 2147483647 * x5, x1, x2, x3, x4]]
+@comment
+@comment cmrg
+@comment [q1([x1,x2,x3]) := [63308 mod 2147483647 * x2 -183326 mod 2147483647 * x3, x1, x2],
+@comment  q2([x1,x2,x3]) := [86098 mod 2145483479 * x1 -539608 mod 2145483479 * x3, x1, x2] ]
+@comment  initial for q1 is [69069, 475559465, 654291926]
+@comment  initial for q2 is  [1790562961, 959348806, 2093487202]
+
+@comment tausworthe
+@comment    [ b1(x) := rsh(xor(lsh(x, 13), x), 19),
+@comment      q1(x) := xor(lsh(and(x, 4294967294), 12), b1(x)),
+@comment      b2(x) := rsh(xor(lsh(x, 2), x), 25),
+@comment      q2(x) := xor(lsh(and(x, 4294967288), 4), b2(x)),
+@comment      b3(x) := rsh(xor(lsh(x, 3), x), 11),
+@comment      q3(x) := xor(lsh(and(x, 4294967280), 17), b3(x)) ]
+@comment      [s1, s2, s3] = [600098857, 1131373026, 1223067536] 
+@comment [2948905028, 441213979, 394017882]