rb-gsl 1.16.0.2 → 1.16.0.3.rc1

data/rdoc/qrng.rdoc

@@ -2,37 +2,37 @@
 # = Quasi-Random Sequences
 #
 # This chapter describes the quasi-random sequence generator <tt>GSL::QRng</tt>
-# of arbitrary dimensions. A quasi-random sequence progressively covers 
-# a d-dimensional space with a set of points that are uniformly distributed. 
+# of arbitrary dimensions. A quasi-random sequence progressively covers
+# a d-dimensional space with a set of points that are uniformly distributed.
 # Quasi-random sequences are also known as low-discrepancy sequences.
-# The quasi-random sequence generators use an interface that is similar 
+# The quasi-random sequence generators use an interface that is similar
 # to the interface for random number generators.
 #
 # Contents:
-# 1. {Quasi-random number generator initialization}[link:rdoc/qrng_rdoc.html#1]
-# 1. {Sampling from a quasi-random number generator}[link:rdoc/qrng_rdoc.html#2]
-# 1. {Auxiliary quasi-random number generator functions}[link:rdoc/qrng_rdoc.html#3]
-# 1. {Saving and resorting quasi-random number generator state}[link:rdoc/qrng_rdoc.html#4]
-# 1. {Quasi-random number generator algorithms}[link:rdoc/qrng_rdoc.html#5]
+# 1. {Quasi-random number generator initialization}[link:qrng_rdoc.html#label-Quasi-random+number+generator+initialization]
+# 1. {Sampling from a quasi-random number generator}[link:qrng_rdoc.html#label-Sampling+from+a+quasi-random+number+generator]
+# 1. {Auxiliary quasi-random number generator functions}[link:qrng_rdoc.html#label-Auxiliary+quasi-random+number+generator+functions]
+# 1. {Saving and resorting quasi-random number generator state}[link:qrng_rdoc.html#label-Saving+and+resorting+quasi-random+number+generator+state]
+# 1. {Quasi-random number generator algorithms}[link:qrng_rdoc.html#label-Quasi-random+number+generator+algorithms]
 #
-# == {}[link:index.html"name="1] Quasi-random number generator initialization
+# == Quasi-random number generator initialization
 #
 # ---
 # * GSL::QRng.alloc(T, d)
 #
-#   This returns a GSL::QRng object, a quasi-random sequence generator of type <tt>T</tt> and dimension <tt>d</tt>. 
+#   This returns a GSL::QRng object, a quasi-random sequence generator of type <tt>T</tt> and dimension <tt>d</tt>.
 #
 # ---
 # * GSL::QRng::init
 #
-#   This reinitializes the generator to its starting point. 
+#   This reinitializes the generator to its starting point.
 #
-# == {}[link:index.html"name="2] Sampling from a quasi-random number generator 
+# == Sampling from a quasi-random number generator
 #
 # ---
 # * GSL::QRng::get(x)
 #
-#   This calculate the next point <tt>x</tt> from the sequence generator. Here <tt>x</tt> is an instance of the {GSL::Vector}[link:rdoc/vector_rdoc.html] class. The space available for <tt>x</tt> must match the dimension of the generator. The point <tt>x</tt> will lie in the range 0 < x_i < 1 for each x_i. 
+#   This calculate the next point <tt>x</tt> from the sequence generator. Here <tt>x</tt> is an instance of the {GSL::Vector}[link:vector_rdoc.html] class. The space available for <tt>x</tt> must match the dimension of the generator. The point <tt>x</tt> will lie in the range 0 < x_i < 1 for each x_i.
 #
 #   This is used as
 #     q = QRng.alloc(QRng::SOBOL, dim)
@@ -42,7 +42,7 @@
 #       printf("%.5f %.5f\n", v[0], v[1])
 #     end
 #
-# == {}[link:index.html"name="3] Auxiliary quasi-random number generator functions 
+# == Auxiliary quasi-random number generator functions
 #
 # ---
 # * GSL::QRng::name
@@ -53,14 +53,14 @@
 # * GSL::QRng::size
 #
 #
-# == {}[link:index.html"name="4] Saving and resorting quasi-random number generator state
+# == Saving and resorting quasi-random number generator state
 # ---
 # * GSL::QRng::clone
 # * GSL::QRng::duplicate
 #
 #   Return a newly created generator which is an exact copy of the generator <tt>self</tt>.
-# == {}[link:index.html"name="5] Quasi-random number generator algorithms
-# In creating a generator by the method <tt>GSL::QRng.alloc(T, d)</tt>, 
+# == Quasi-random number generator algorithms
+# In creating a generator by the method <tt>GSL::QRng.alloc(T, d)</tt>,
 # the algorithm type <tt>T</tt> is given by a String or a Fixnum constant.
 # The following quasi-random sequence algorithms are available,
 #
@@ -81,10 +81,10 @@
 #
 #   (GSL-1.11 or later) These generators use the Halton and reverse Halton sequences described in J.H. Halton, Numerische Mathematik 2, 84-90 (1960) and B. Vandewoestyne and R. Cools Computational and Applied Mathematics 189, 1&2, 341-361 (2006). They are valid up to 1229 dimensions.
 #
-# {prev}[link:rdoc/rng_rdoc.html]
-# {next}[link:rdoc/randist_rdoc.html]
+# {prev}[link:rng_rdoc.html]
+# {next}[link:randist_rdoc.html]
 #
-# {Reference index}[link:rdoc/ref_rdoc.html]
+# {Reference index}[link:ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/randist.rdoc

@@ -1,79 +1,79 @@
 #
 # = Random Number Distributions
-# This chapter describes functions for generating random variates and computing 
-# their probability distributions. Samples from the distributions described 
-# in this chapter can be obtained using any of the random number generators 
-# in the library as an underlying source of randomness. 
+# This chapter describes functions for generating random variates and computing
+# their probability distributions. Samples from the distributions described
+# in this chapter can be obtained using any of the random number generators
+# in the library as an underlying source of randomness.
 #
-# In the simplest cases a non-uniform distribution can be obtained analytically 
-# from the uniform distribution of a random number generator by applying an 
+# In the simplest cases a non-uniform distribution can be obtained analytically
+# from the uniform distribution of a random number generator by applying an
 # appropriate transformation. This method uses one call to the random number
-# generator. More complicated distributions are created by the 
+# generator. More complicated distributions are created by the
 # acceptance-rejection method, which compares the desired distribution against
-# a distribution which is similar and known analytically. This usually requires 
-# several samples from the generator. 
+# a distribution which is similar and known analytically. This usually requires
+# several samples from the generator.
 #
-# The library also provides cumulative distribution functions and inverse 
-# cumulative distribution functions, sometimes referred to as quantile 
-# functions. The cumulative distribution functions and their inverses are 
-# computed separately for the upper and lower tails of the distribution, 
-# allowing full accuracy to be retained for small results. 
+# The library also provides cumulative distribution functions and inverse
+# cumulative distribution functions, sometimes referred to as quantile
+# functions. The cumulative distribution functions and their inverses are
+# computed separately for the upper and lower tails of the distribution,
+# allowing full accuracy to be retained for small results.
 #
 # Contents:
-# 1. {Introduction}[link:rdoc/randist_rdoc.html#1]
-# 1. {The Gaussian Distribution}[link:rdoc/randist_rdoc.html#2]
-# 1. {The Gaussian Tail Distribution}[link:rdoc/randist_rdoc.html#3]
+# 1. {Introduction}[link:randist_rdoc.html#label-Introduction]
+# 1. {The Gaussian Distribution}[link:randist_rdoc.html#label-The+Gaussian+Distribution]
+# 1. {The Gaussian Tail Distribution}[link:randist_rdoc.html#label-The+Gaussian+Tail+Distribution]
 #  ...
-# and more, see {the GSL reference}[http://www.gnu.org/software/gsl/manual/"target="_top]
-# 1. {Shuffling and Sampling}[link:rdoc/randist_rdoc.html#7]
+# and more, see {the GSL reference}[https://gnu.org/software/gsl/manual/]
+# 1. {Shuffling and Sampling}[link:randist_rdoc.html#label-Shuffling+and+Sampling]
 #
-# == {}[link:index.html"name="1] Introduction
-# Continuous random number distributions are defined by a probability density 
-# function, p(x), such that the probability of x occurring in the 
-# infinitesimal range x to x+dx is p dx. 
+# == Introduction
+# Continuous random number distributions are defined by a probability density
+# function, p(x), such that the probability of x occurring in the
+# infinitesimal range x to x+dx is p dx.
 #
-# The cumulative distribution function for the lower tail P(x) is defined by the 
-# integral, and gives the probability of a variate taking a value less than x. 
+# The cumulative distribution function for the lower tail P(x) is defined by the
+# integral, and gives the probability of a variate taking a value less than x.
 #
-# The cumulative distribution function for the upper tail Q(x) is defined by the 
-# integral, and gives the probability of a variate taking a value greater than 
-# x. 
+# The cumulative distribution function for the upper tail Q(x) is defined by the
+# integral, and gives the probability of a variate taking a value greater than
+# x.
 #
-# The upper and lower cumulative distribution functions are related 
-# by P(x) + Q(x) = 1 and satisfy 0 <= P(x) <= 1, 0 <= Q(x) <= 1. 
+# The upper and lower cumulative distribution functions are related
+# by P(x) + Q(x) = 1 and satisfy 0 <= P(x) <= 1, 0 <= Q(x) <= 1.
 #
-# The inverse cumulative distributions, x=P^{-1}(P) and x=Q^{-1}(Q) give the 
-# values of x which correspond to a specific value of P or Q. They can be used 
-# to find confidence limits from probability values. 
+# The inverse cumulative distributions, x=P^{-1}(P) and x=Q^{-1}(Q) give the
+# values of x which correspond to a specific value of P or Q. They can be used
+# to find confidence limits from probability values.
 #
-# For discrete distributions the probability of sampling the integer value k is 
-# given by p(k), where \sum_k p(k) = 1. The cumulative distribution for the 
-# lower tail P(k) of a discrete distribution is defined as, where the sum is 
-# over the allowed range of the distribution less than or equal to k. 
+# For discrete distributions the probability of sampling the integer value k is
+# given by p(k), where \sum_k p(k) = 1. The cumulative distribution for the
+# lower tail P(k) of a discrete distribution is defined as, where the sum is
+# over the allowed range of the distribution less than or equal to k.
 #
 # The cumulative distribution for the upper tail of a discrete distribution Q(k)
-# is defined as giving the sum of probabilities for all values greater than k. 
-# These two definitions satisfy the identity P(k)+Q(k)=1. 
+# is defined as giving the sum of probabilities for all values greater than k.
+# These two definitions satisfy the identity P(k)+Q(k)=1.
 #
-# If the range of the distribution is 1 to n inclusive then P(n)=1, Q(n)=0 
-# while P(1) = p(1), Q(1)=1-p(1). 
+# If the range of the distribution is 1 to n inclusive then P(n)=1, Q(n)=0
+# while P(1) = p(1), Q(1)=1-p(1).
 #
 #
 #
-# == {}[link:index.html"name="2] The Gaussian Distribution
+# == The Gaussian Distribution
 # ---
 # * GSL::Rng#gaussian(sigma = 1)
 # * GSL::Ran::gaussian(rng, sigma = 1)
 # * GSL::Rng#ugaussian
 # * GSL::Ran::ugaussian
 #
-#   These return a Gaussian random variate, with mean zero and standard 
-#   deviation <tt>sigma</tt>. 
+#   These return a Gaussian random variate, with mean zero and standard
+#   deviation <tt>sigma</tt>.
 #
 # ---
 # * GSL::Ran::gaussian_pdf(x, sigma = 1)
 #
-#   Computes the probability density p(x) at <tt>x</tt> for a Gaussian distribution 
+#   Computes the probability density p(x) at <tt>x</tt> for a Gaussian distribution
 #   with standard deviation <tt>sigma</tt>.
 #
 # ---
@@ -92,57 +92,57 @@
 # * GSL::Cdf::ugaussian_Pinv(P)
 # * GSL::Cdf::ugaussian_Qinv(Q)
 #
-#   These methods compute the cumulative distribution functions P(x), Q(x) 
-#   and their inverses for the Gaussian distribution with standard 
+#   These methods compute the cumulative distribution functions P(x), Q(x)
+#   and their inverses for the Gaussian distribution with standard
 #   deviation <tt>sigma</tt>.
 #
-# == {}[link:index.html"name="3] The Gaussian Tail Distribution
+# == The Gaussian Tail Distribution
 # ---
 # * GSL::Rng#gaussian_tail(a, sigma = 1)
 # * GSL::Ran#gaussian_tail(rng, a, sigma = 1)
 # * GSL::Rng#ugaussian_tail(a)
 # * GSL::Ran#ugaussian_tail(rng)
 #
-#   These methods provide random variates from the upper tail of a Gaussian 
-#   distribution with standard deviation <tt>sigma</tt>. 
+#   These methods provide random variates from the upper tail of a Gaussian
+#   distribution with standard deviation <tt>sigma</tt>.
 #   The values returned are larger than the lower limit <tt>a</tt>, which must be positive.
 #
 # ---
 # * GSL::Ran::gaussian_tail_pdf(x, a, sigma = 1)
 # * GSL::Ran::ugaussian_tail_pdf(x, a)
 #
-#   These methods compute the probability density p(x) at <tt>x</tt> for a Gaussian 
-#   tail distribution with standard deviation <tt>sigma</tt> 
+#   These methods compute the probability density p(x) at <tt>x</tt> for a Gaussian
+#   tail distribution with standard deviation <tt>sigma</tt>
 #   and lower limit <tt>a</tt>.
 #
-# == {}[link:index.html"name="4] The Bivariate Gaussian Distribution
+# == The Bivariate Gaussian Distribution
 # ---
 # * GSL::Rng#bivariate_gaussian(sigma_x, sigma_y, rho)
 # * GSL::Ran::bivariate_gaussian(rng, sigma_x, sigma_y, rho)
 #
-#   These methods generate a pair of correlated gaussian variates, 
-#   with mean zero, correlation coefficient <tt>rho</tt> and standard deviations 
+#   These methods generate a pair of correlated gaussian variates,
+#   with mean zero, correlation coefficient <tt>rho</tt> and standard deviations
 #   <tt>sigma_x</tt> and <tt>sigma_y</tt> in the x and y directions.
 #
 # ---
 # * GSL::Ran::bivariate_gaussian_pdf(x, y, sigma_x, sigma_y, rho)
 #
-#   This method computes the probability density p(x,y) at <tt>(x,y)</tt> 
-#   for a bivariate gaussian distribution with standard deviations 
+#   This method computes the probability density p(x,y) at <tt>(x,y)</tt>
+#   for a bivariate gaussian distribution with standard deviations
 #   <tt>sigma_x, sigma_y</tt> and correlation coefficient <tt>rho</tt>.
 #
-# == {}[link:index.html"name="5] The Exponential Distribution
+# == The Exponential Distribution
 # ---
 # * GSL::Rng#exponential(mu)
 # * GSL::Ran::exponential(rng, mu)
 #
-#   These methods return a random variate from the exponential 
+#   These methods return a random variate from the exponential
 #   distribution with mean <tt>mu</tt>.
 #
 # ---
 # * GSL::Ran::exponential_pdf(x, mu)
 #
-#   This method computes the probability density p(x) at <tt>x</tt> 
+#   This method computes the probability density p(x) at <tt>x</tt>
 #   for an exponential distribution with mean <tt>mu</tt>.
 #
 # ---
@@ -151,21 +151,21 @@
 # * GSL::Cdf::exponential_Pinv(P, mu)
 # * GSL::Cdf::exponential_Qinv(Q, mu)
 #
-#   These methods compute the cumulative distribution functions P(x), Q(x) 
+#   These methods compute the cumulative distribution functions P(x), Q(x)
 #   and their inverses for the exponential distribution with mean <tt>mu</tt>.
 #
-# == {}[link:index.html"name="6] The Laplace Distribution
+# == The Laplace Distribution
 # ---
 # * GSL::Rng#laplace(a)
 # * GSL::Ran::laplace(rng, a)
 #
-#   These methods return a random variate from the Laplace distribution 
+#   These methods return a random variate from the Laplace distribution
 #   with width <tt>a</tt>.
 #
 # ---
 # * GSL::Ran::laplace_pdf(x, a)
 #
-#   This method computes the probability density p(x) at <tt>x</tt> 
+#   This method computes the probability density p(x) at <tt>x</tt>
 #   for a Laplace distribution with width <tt>a</tt>.
 #
 # ---
@@ -174,7 +174,7 @@
 # * GSL::Cdf::laplace_Pinv(P, a)
 # * GSL::Cdf::laplace_Qinv(Q, a)
 #
-#   These methods compute the cumulative distribution functions P(x), Q(x) 
+#   These methods compute the cumulative distribution functions P(x), Q(x)
 #   and their inverses for the Laplace distribution with width <tt>a</tt>.
 #
 # ---
@@ -198,36 +198,36 @@
 #
 # ...
 #
-# and more, see {the GSL reference}[http://www.gnu.org/software/gsl/manual/gsl-ref_19.html#SEC286"target="_top].
+# and more, see {the GSL reference}[https://gnu.org/software/gsl/manual/gsl-ref_19.html#SEC286].
 #
-# == {}[link:index.html"name="7] Shuffling and Sampling
+# == Shuffling and Sampling
 # ---
 # * GSL::Rng#shuffle(v, n)
 #
-#   This randomly shuffles the order of <tt>n</tt> objects, 
-#   stored in the {GSL::Vector}[link:rdoc/vector_rdoc.html] object <tt>v</tt>. 
+#   This randomly shuffles the order of <tt>n</tt> objects,
+#   stored in the {GSL::Vector}[link:vector_rdoc.html] object <tt>v</tt>.
 # ---
 # * GSL::Rng#choose(v, k)
 #
-#   This returns a {GSL::Vector}[link:rdoc/vector_rdoc.html] object with <tt>k</tt> objects 
-#   taken randomly from the {GSL::Vector}[link:rdoc/vector_rdoc.html] object <tt>v</tt>. 
+#   This returns a {GSL::Vector}[link:vector_rdoc.html] object with <tt>k</tt> objects
+#   taken randomly from the {GSL::Vector}[link:vector_rdoc.html] object <tt>v</tt>.
 #
-#   The objects are sampled without replacement, thus each object can only 
-#   appear once in the returned vector. It is required that <tt>k</tt> be less 
-#   than or equal to the length of the vector <tt>v</tt>. 
+#   The objects are sampled without replacement, thus each object can only
+#   appear once in the returned vector. It is required that <tt>k</tt> be less
+#   than or equal to the length of the vector <tt>v</tt>.
 #
 # ---
 # * GSL::Rng#sample(v, k)
 #
-#   This method is like the method <tt>choose</tt> but samples <tt>k</tt> items 
-#   from the original vector <tt>v</tt> with replacement, so the same object 
-#   can appear more than once in the output sequence. There is no requirement 
+#   This method is like the method <tt>choose</tt> but samples <tt>k</tt> items
+#   from the original vector <tt>v</tt> with replacement, so the same object
+#   can appear more than once in the output sequence. There is no requirement
 #   that <tt>k</tt> be less than the length of <tt>v</tt>.
 #
-# {prev}[link:rdoc/qrng_rdoc.html]
-# {next}[link:rdoc/stats_rdoc.html]
+# {prev}[link:qrng_rdoc.html]
+# {next}[link:stats_rdoc.html]
 #
-# {Reference index}[link:rdoc/ref_rdoc.html]
+# {Reference index}[link:ref_rdoc.html]
 # {top}[link:index.html]
-#   
+#
 #

data/rdoc/ref.rdoc

@@ -1,14 +1,14 @@
 #
-# = {Ruby/GSL Reference}[link:rdoc/ref_rdoc.html"target="_parent]
-# (See also {Gnu Scientific Library -- Reference Manual}[http://www.gnu.org/software/gsl/manual/html_node/"target="_top])
+# = {Ruby/GSL Reference}[link:ref_rdoc.html]
+# (See also {Gnu Scientific Library -- Reference Manual}[https://gnu.org/software/gsl/manual/html_node/])
 #
-# == {}[link:index.html"name="1] Front Matter
+# == Front Matter
 # This document describes the modules, classes and the methods of Ruby/GSL.  This
 # includes cut-and-paste from the
-# {GNU Scientific Library -- Reference Manual}[http://www.gnu.org/software/gsl/manual/html_node/"target="_top],
+# {GNU Scientific Library -- Reference Manual}[https://gnu.org/software/gsl/manual/html_node/],
 # and documents of the extention libraries.
 #
-# === {}[link:index.html"name="1.1] Copyright of the GSL Reference
+# === Copyright of the GSL Reference
 #
 # Copyright 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
 # 2007, 2008 The GSL Team.
@@ -22,72 +22,72 @@
 # Free Documentation License".  (a) The Back-Cover Text is: "You have the freedom
 # to copy and modify this GNU Manual."
 #
-# === {}[link:index.html"name="1.2] Copyright of this reference
+# === Copyright of this reference
 #
 # 2009,2010 Yoshiki Tsunesada, David MacMahon
 #
 # Permission is granted to copy, distribute and/or modify this document under
 # the terms of the GNU Free Documentation License.
 #
-# == {}[link:index.html"name="2] Ruby/GSL Reference
+# == Ruby/GSL Reference
 #
-# 1. {Introduction}[link:rdoc/intro_rdoc.html]
-# 1. {Using Ruby/GSL}[link:rdoc/use_rdoc.html]
-# 1. {Error Handling}[link:rdoc/ehandling_rdoc.html]
-# 1. {Mathematical Functions}[link:rdoc/math_rdoc.html]
-# 1. {Complex Numbers}[link:rdoc/complex_rdoc.html]
-# 1. {Polynomials}[link:rdoc/poly_rdoc.html]
-# 1. {Special Functions}[link:rdoc/sf_rdoc.html]
-# 1. {Vectors}[link:rdoc/vector_rdoc.html] and {Matrices}[link:files/rdoc/matrix_rdoc.html]
-# 1. {Permutations}[link:rdoc/perm_rdoc.html]
-# 1. {Combinations}[link:rdoc/combi_rdoc.html]
+# 1. {Introduction}[link:intro_rdoc.html]
+# 1. {Using Ruby/GSL}[link:use_rdoc.html]
+# 1. {Error Handling}[link:ehandling_rdoc.html]
+# 1. {Mathematical Functions}[link:math_rdoc.html]
+# 1. {Complex Numbers}[link:complex_rdoc.html]
+# 1. {Polynomials}[link:poly_rdoc.html]
+# 1. {Special Functions}[link:sf_rdoc.html]
+# 1. {Vectors}[link:vector_rdoc.html] and {Matrices}[link:matrix_rdoc.html]
+# 1. {Permutations}[link:perm_rdoc.html]
+# 1. {Combinations}[link:combi_rdoc.html]
 --
-# 1. {Multiset}[link:rdoc/sort_rdoc.html] (GSL-1.14)
+# 1. {Multiset}[link:sort_rdoc.html] (GSL-1.14)
 ++
-# 1. {Sorting}[link:rdoc/sort_rdoc.html]
-# 1. {BLAS Support}[link:rdoc/blas_rdoc.html]
-# 1. {Linear Algebra}[link:rdoc/linalg_rdoc.html]
-# 1. {Eigen Systems}[link:rdoc/eigen_rdoc.html]
-# 1. {Fast Fourier Transform}[link:rdoc/fft_rdoc.html]
-# 1. {Numerical Integration}[link:rdoc/integration_rdoc.html]
-# 1. {Random Number Generation}[link:rdoc/rng_rdoc.html]
-# 1. {Quasi-Random Sequences}[link:rdoc/qrng_rdoc.html]
-# 1. {Random Number Distributions}[link:rdoc/randist_rdoc.html]
-# 1. {Statistics}[link:rdoc/stats_rdoc.html]
-# 1. {1d-Histograms}[link:rdoc/hist_rdoc.html], {2d-Histograms}[link:files/rdoc/hist2d_rdoc.html] and {3d-Histograms}[link:files/rdoc/hist3d_rdoc.html]
-# 1. {N-tuples}[link:rdoc/ntuple_rdoc.html]
-# 1. {Monte-Carlo Integration}[link:rdoc/monte_rdoc.html]
-# 1. {Simulated Annealing}[link:rdoc/siman_rdoc.html]
-# 1. {Ordinary Differential Equations}[link:rdoc/odeiv_rdoc.html]
-# 1. {Interpolation}[link:rdoc/interp_rdoc.html]
-# 1. {Numerical Differentiation}[link:rdoc/diff_rdoc.html]
-# 1. {Chebyshev Approximations}[link:rdoc/cheb_rdoc.html]
-# 1. {Series Acceleration}[link:rdoc/sum_rdoc.html]
-# 1. {Wavelet Transforms}[link:rdoc/wavelet_rdoc.html] (GSL-1.6 feature)
-# 1. {Discrete Hankel Transforms}[link:rdoc/dht_rdoc.html]
-# 1. {One dimensional Root-Finding}[link:rdoc/roots_rdoc.html]
-# 1. {One dimensional Minimization}[link:rdoc/min_rdoc.html]
-# 1. {Multidimensional Root-Finding}[link:rdoc/multiroot_rdoc.html]
-# 1. {Multidimensional Minimization}[link:rdoc/multimin_rdoc.html]
-# 1. {Least-Squares Fitting}[link:rdoc/fit_rdoc.html]
-# 1. {Nonlinear Least-Squares Fitting}[link:rdoc/nonlinearfit_rdoc.html]
-# 1. {Basis Splines}[link:rdoc/bspline_rdoc.html]  
-# 1. {Physical Constants}[link:rdoc/const_rdoc.html]
-# 1. {Graphics}[link:rdoc/graph_rdoc.html]
+# 1. {Sorting}[link:sort_rdoc.html]
+# 1. {BLAS Support}[link:blas_rdoc.html]
+# 1. {Linear Algebra}[link:linalg_rdoc.html]
+# 1. {Eigen Systems}[link:eigen_rdoc.html]
+# 1. {Fast Fourier Transform}[link:fft_rdoc.html]
+# 1. {Numerical Integration}[link:integration_rdoc.html]
+# 1. {Random Number Generation}[link:rng_rdoc.html]
+# 1. {Quasi-Random Sequences}[link:qrng_rdoc.html]
+# 1. {Random Number Distributions}[link:randist_rdoc.html]
+# 1. {Statistics}[link:stats_rdoc.html]
+# 1. {1d-Histograms}[link:hist_rdoc.html], {2d-Histograms}[link:hist2d_rdoc.html] and {3d-Histograms}[link:hist3d_rdoc.html]
+# 1. {N-tuples}[link:ntuple_rdoc.html]
+# 1. {Monte-Carlo Integration}[link:monte_rdoc.html]
+# 1. {Simulated Annealing}[link:siman_rdoc.html]
+# 1. {Ordinary Differential Equations}[link:odeiv_rdoc.html]
+# 1. {Interpolation}[link:interp_rdoc.html]
+# 1. {Numerical Differentiation}[link:diff_rdoc.html]
+# 1. {Chebyshev Approximations}[link:cheb_rdoc.html]
+# 1. {Series Acceleration}[link:sum_rdoc.html]
+# 1. {Wavelet Transforms}[link:wavelet_rdoc.html] (GSL-1.6 feature)
+# 1. {Discrete Hankel Transforms}[link:dht_rdoc.html]
+# 1. {One dimensional Root-Finding}[link:roots_rdoc.html]
+# 1. {One dimensional Minimization}[link:min_rdoc.html]
+# 1. {Multidimensional Root-Finding}[link:multiroot_rdoc.html]
+# 1. {Multidimensional Minimization}[link:multimin_rdoc.html]
+# 1. {Least-Squares Fitting}[link:fit_rdoc.html]
+# 1. {Nonlinear Least-Squares Fitting}[link:nonlinearfit_rdoc.html]
+# 1. {Basis Splines}[link:bspline_rdoc.html]
+# 1. {Physical Constants}[link:const_rdoc.html]
+# 1. {Graphics}[link:graph_rdoc.html]
 # 1. Supported GSL add-on packages
-#    1. {rngextra}[link:rdoc/rngextra_rdoc.html]
-#    1. {Tensor manipulations}[link:rdoc/tensor_rdoc.html]
+#    1. {rngextra}[link:rng_rdoc.html#label-Random+number+generator+initialization]
+#    1. {Tensor manipulations}[link:tensor_rdoc.html]
 #    1. OOL: Open Optimization library (see examples/ool/*.rb)
 #    1. CQP and Bundle (see examples/multimin/cqp.rb, bundle.rb)
 #    1. quartic
 #    1. jacobi (see examples/jacobi/*.rb)
-#    1. {NDLINEAR: multi-linear, multi-parameter least squares fitting}[link:rdoc/ndlinear_rdoc.html]
-#    1. {ALF: associated Legendre polynomials}[link:rdoc/alf_rdoc.html]
-# 1. {NArray compatibilities}[link:rdoc/narray_rdoc.html]
-# 1. {Changes since Ruby/GSL 1.10.3}[link:rdoc/changes_rdoc.html]
-# 1. {GNU Free Documentation Licence}[http://www.gnu.org/software/gsl/manual/html_node/GNU-Free-Documentation-License.html"target="_top]
+#    1. {NDLINEAR: multi-linear, multi-parameter least squares fitting}[link:ndlinear_rdoc.html]
+#    1. {ALF: associated Legendre polynomials}[link:alf_rdoc.html]
+# 1. {NArray compatibilities}[link:narray_rdoc.html]
+# 1. {Changes since Ruby/GSL 1.10.3}[link:changes_rdoc.html]
+# 1. {GNU Free Documentation Licence}[https://gnu.org/software/gsl/manual/html_node/GNU-Free-Documentation-License.html]
 #
-# {next}[link:rdoc/intro_rdoc.html]
+# {next}[link:intro_rdoc.html]
 #
 # {top}[link:index.html]
 #