rb-gsl 1.16.0.2 → 1.16.0.3.rc1

data/rdoc/min.rdoc

@@ -1,54 +1,54 @@
 #
 # = One dimensional Minimization
 #
-# This chapter describes routines for finding minima of arbitrary 
+# This chapter describes routines for finding minima of arbitrary
 # one-dimensional functions.
 #
 #
 # Contents:
-# 1. {Introduction}[link:rdoc/min_rdoc.html#1]
-# 1. {GSL::Min::FMinimizer class}[link:rdoc/min_rdoc.html#2]
-# 1. {Iteration}[link:rdoc/min_rdoc.html#3]
-# 1. {Stopping Parameters}[link:rdoc/min_rdoc.html#4]
-# 1. {Examples}[link:rdoc/min_rdoc.html#5]
+# 1. {Introduction}[link:min_rdoc.html#label-Introduction]
+# 1. {GSL::Min::FMinimizer class}[link:min_rdoc.html#label-Minimizer+class]
+# 1. {Iteration}[link:min_rdoc.html#label-Iteration]
+# 1. {Stopping Parameters}[link:min_rdoc.html#label-Stopping+Parameters]
+# 1. {Examples}[link:min_rdoc.html#label-Example]
 #
-# == {}[link:index.html"name="1] Introduction
+# == Introduction
 #
-# The minimization algorithms begin with a bounded region known to contain 
-# a minimum. The region is described by <tt>a</tt> lower bound a and an upper bound 
+# The minimization algorithms begin with a bounded region known to contain
+# a minimum. The region is described by <tt>a</tt> lower bound a and an upper bound
 # <tt>b</tt>, with an estimate of the location of the minimum <tt>x</tt>.
 #
-# The value of the function at <tt>x</tt> must be less than the value of the 
+# The value of the function at <tt>x</tt> must be less than the value of the
 # function at the ends of the interval,
 #   f(a) > f(x) < f(b)
-# This condition guarantees that a minimum is contained somewhere within the 
+# This condition guarantees that a minimum is contained somewhere within the
 # interval. On each iteration a new point <tt>x'</tt> is selected using one of the
-# available algorithms. If the new point is a better estimate of the minimum, 
-# <tt>f(x') < f(x)</tt>, then the current estimate of the minimum <tt>x</tt> is 
-# updated. The new point also allows the size of the bounded interval to be 
-# reduced, by choosing the most compact set of points which satisfies the 
-# constraint <tt>f(a) > f(x) < f(b)</tt>. The interval is reduced until it 
-# encloses the true minimum to a desired tolerance. This provides a best 
+# available algorithms. If the new point is a better estimate of the minimum,
+# <tt>f(x') < f(x)</tt>, then the current estimate of the minimum <tt>x</tt> is
+# updated. The new point also allows the size of the bounded interval to be
+# reduced, by choosing the most compact set of points which satisfies the
+# constraint <tt>f(a) > f(x) < f(b)</tt>. The interval is reduced until it
+# encloses the true minimum to a desired tolerance. This provides a best
 # estimate of the location of the minimum and a rigorous error estimate.
 #
-# Several bracketing algorithms are available within a single framework. 
-# The user provides a high-level driver for the algorithm, and the library 
-# provides the individual functions necessary for each of the steps. There 
+# Several bracketing algorithms are available within a single framework.
+# The user provides a high-level driver for the algorithm, and the library
+# provides the individual functions necessary for each of the steps. There
 # are three main phases of the iteration. The steps are,
 # * initialize minimizer (or <tt>solver</tt>) state, <tt>s</tt>, for algorithm <tt>T</tt>
 # * update <tt>s</tt> using the iteration <tt>T</tt>
 # * test <tt>s</tt> for convergence, and repeat iteration if necessary
 #
-# The state of the minimizers is held in a <tt>GSL::Min::FMinimizer</tt> object. 
+# The state of the minimizers is held in a <tt>GSL::Min::FMinimizer</tt> object.
 # The updating procedure use only function evaluations (not derivatives).
-# The function to minimize is given as an instance of the {GSL::Function}[link:rdoc/function_rdoc.html] class to the minimizer.
+# The function to minimize is given as an instance of the {GSL::Function}[link:function_rdoc.html] class to the minimizer.
 #
 #
-# == {}[link:index.html"name="2] GSL::Min::FMinimizer class
+# == FMinimizer class
 # ---
 # * GSL::Min::FMinimizer.alloc(t)
 #
-#   These method create an instance of the <tt>GSL::Min::FMinimizer</tt> class of 
+#   These method create an instance of the <tt>GSL::Min::FMinimizer</tt> class of
 #   type <tt>t</tt>. The type <tt>t</tt> is given by a String,
 #   * "goldensection"
 #   * "brent"
@@ -65,52 +65,52 @@
 # ---
 # * GSL::Min::FMinimizer#set(f, xmin, xlow, xup)
 #
-#   This method sets, or resets, an existing minimizer <tt>self</tt> to use 
+#   This method sets, or resets, an existing minimizer <tt>self</tt> to use
 #   the function <tt>f</tt> (given by a <tt>GSL::Function</tt>
-#   object) and the initial search interval [<tt>xlow, xup</tt>], 
+#   object) and the initial search interval [<tt>xlow, xup</tt>],
 #   with a guess for the location of the minimum <tt>xmin</tt>.
 #
-#   If the interval given does not contain a minimum, then the 
+#   If the interval given does not contain a minimum, then the
 #   method returns an error code of <tt>GSL::FAILURE</tt>.
 #
 # ---
 # * GSL::Min::FMinimizer#set_with_values(f, xmin, fmin, xlow, flow, xup, fup)
 #
-#   This method is equivalent to <tt>Fminimizer#set</tt> but uses the values 
-#   <tt>fmin, flowe</tt> and <tt>fup</tt> instead of computing 
+#   This method is equivalent to <tt>Fminimizer#set</tt> but uses the values
+#   <tt>fmin, flowe</tt> and <tt>fup</tt> instead of computing
 #   <tt>f(xmin), f(xlow)</tt> and <tt>f(xup)</tt>.
 #
 # ---
 # * GSL::Min::FMinimizer#name
 #
-#   This returns the name of the minimizer. 
+#   This returns the name of the minimizer.
 #
-# == {}[link:index.html"name="3] Iteration
+# == Iteration
 # ---
 # * GSL::Min::FMinimizer#iterate
 #
-#   This method performs a single iteration of the minimizer <tt>self</tt>. 
-#   If the iteration encounters an unexpected problem then an error code 
+#   This method performs a single iteration of the minimizer <tt>self</tt>.
+#   If the iteration encounters an unexpected problem then an error code
 #   will be returned,
-#   * <tt>GSL::EBADFUNC</tt>: the iteration encountered a singular point where the 
+#   * <tt>GSL::EBADFUNC</tt>: the iteration encountered a singular point where the
 #     function evaluated to <tt>Inf</tt> or <tt>NaN</tt>.
-#   * <tt>GSL::FAILURE</tt>: the algorithm could not improve the current best 
+#   * <tt>GSL::FAILURE</tt>: the algorithm could not improve the current best
 #     approximation or bounding interval.
-#   The minimizer maintains a current best estimate of the position of 
-#   the minimum at all times, and the current interval bounding the minimum. 
+#   The minimizer maintains a current best estimate of the position of
+#   the minimum at all times, and the current interval bounding the minimum.
 #   This information can be accessed with the following auxiliary methods
 #
 # ---
 # * GSL::Min::FMinimizer#x_minimum
 #
-#   Returns the current estimate of the position of the minimum 
+#   Returns the current estimate of the position of the minimum
 #   for the minimizer <tt>self</tt>.
 #
 # ---
 # * GSL::Min::FMinimizer#x_upper
 # * GSL::Min::FMinimizer#x_lower
 #
-#   Return the current upper and lower bound of the interval for the 
+#   Return the current upper and lower bound of the interval for the
 #   minimizer <tt>self</tt>.
 #
 # ---
@@ -118,33 +118,33 @@
 # * GSL::Min::FMinimizer#f_upper
 # * GSL::Min::FMinimizer#f_lower
 #
-#   Return the value of the function at the current estimate of the 
-#   minimum and at the upper and lower bounds of interval 
+#   Return the value of the function at the current estimate of the
+#   minimum and at the upper and lower bounds of interval
 #   for the minimizer <tt>self</tt>.
 #
-# == {}[link:index.html"name="4] Stopping Parameters
+# == Stopping Parameters
 # ---
 # * GSL::Min::FMinimizer#test_interval(epsabs, epsrel)
 # * GSL::Min.test_interval(xlow, xup, epsabs, epsrel)
 #
-#   These methoeds test for the convergence of the interval 
-#   [<tt>xlow, xup</tt>] with absolute error <tt>epsabs</tt> and relative 
-#   error <tt>epsrel</tt>. The test returns <tt>GSL::SUCCESS</tt> 
+#   These methoeds test for the convergence of the interval
+#   [<tt>xlow, xup</tt>] with absolute error <tt>epsabs</tt> and relative
+#   error <tt>epsrel</tt>. The test returns <tt>GSL::SUCCESS</tt>
 #   if the following condition is achieved,
-#     |a - b| < epsabs + epsrel min(|a|,|b|) 
-#   when the interval <tt>x = [a,b]</tt> does not include the origin. 
-#   If the interval includes the origin then <tt>min(|a|,|b|)</tt> is 
-#   replaced by zero (which is the minimum value of |x| over the interval). 
-#   This ensures that the relative error is accurately estimated for minima 
+#     |a - b| < epsabs + epsrel min(|a|,|b|)
+#   when the interval <tt>x = [a,b]</tt> does not include the origin.
+#   If the interval includes the origin then <tt>min(|a|,|b|)</tt> is
+#   replaced by zero (which is the minimum value of |x| over the interval).
+#   This ensures that the relative error is accurately estimated for minima
 #   close to the origin.
 #
-#   This condition on the interval also implies that any estimate of the 
-#   minimum x_m in the interval satisfies the same condition with respect 
+#   This condition on the interval also implies that any estimate of the
+#   minimum x_m in the interval satisfies the same condition with respect
 #   to the true minimum x_m^*,
 #     |x_m - x_m^*| < epsabs + epsrel x_m^*
 #   assuming that the true minimum x_m^* is contained within the interval.
 #
-# == {}[link:index.html"name="5] Example
+# == Example
 # To find the minimum of the function f(x) = cos(x) + 1.0:
 #
 #      #!/usr/bin/env ruby
@@ -180,10 +180,10 @@
 #               iter, a, b, m, m - m_expected, b - a);
 #      end while status == GSL::CONTINUE and iter < max_iter
 #
-# {prev}[link:rdoc/roots_rdoc.html]
-# {next}[link:rdoc/multiroot_rdoc.html]
+# {prev}[link:roots_rdoc.html]
+# {next}[link:multiroot_rdoc.html]
 #
-# {Reference index}[link:rdoc/ref_rdoc.html]
+# {Reference index}[link:ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/monte.rdoc

@@ -1,7 +1,7 @@
 #
 # = Monte Carlo Integration
 #
-# == {}[link:index.html"name="1] The GSL::Monte::Function class
+# == The Function class
 # The function to be integrated has its own datatype, the <tt>GSL::Monte::Function</tt> class.
 #
 # ---
@@ -18,7 +18,7 @@
 #       }
 #       dim = 2
 #       mf = Monte::Function.alloc(proc_f, dim)
-#       mf.set_params([3, 2, 1])    
+#       mf.set_params([3, 2, 1])
 #
 # ---
 # * GSL::Munte::Function#set(proc, dim, params)
@@ -32,34 +32,34 @@
 # * GSL::Munte::Function#call
 #
 #
-# == {}[link:index.html"name="2] Monte Carlo plans, alrgorithms 
-# === {}[link:index.html"name="2.1] PLAIN Monte Carlo
+# == Monte Carlo plans, alrgorithms
+# === PLAIN Monte Carlo
 # ---
 # * GSL::Monte::Plain.alloc(dim)
 # * GSL::Monte::Plain#init
 #
-# === {}[link:index.html"name="2.2] Miser
+# === Miser
 # ---
 # * GSL::Monte::Miser.alloc(dim)
 # * GSL::Monte::Miser#init
 #
-# === {}[link:index.html"name="2.3] Vegas
+# === Vegas
 # ---
 # * GSL::Monte::Vegas.alloc(dim)
 # * GSL::Monte::Vegas#init
 #
 #
-# == {}[link:index.html"name="3] Integration
+# == Integration
 # ---
 # * GSL:Monte::Function#integrate(xl, xu, dim, calls, rng, s)
 # * GSL:Monte::Function#integrate(xl, xu, dim, calls, s)
 # * GSL:Monte::Function#integrate(xl, xu, calls, rng, s)
 # * GSL:Monte::Function#integrate(xl, xu, calls, s)
 #
-#   This method performs Monte-Carlo integration of the function <tt>self</tt> 
-#   using the algorithm <tt>s</tt>, over the <tt>dim</tt>-dimensional hypercubic 
-#   region defined by the lower and upper 
-#   limits in the arrays <tt>xl</tt> and <tt>xu</tt>, each of size <tt>dim</tt>. 
+#   This method performs Monte-Carlo integration of the function <tt>self</tt>
+#   using the algorithm <tt>s</tt>, over the <tt>dim</tt>-dimensional hypercubic
+#   region defined by the lower and upper
+#   limits in the arrays <tt>xl</tt> and <tt>xu</tt>, each of size <tt>dim</tt>.
 #   The integration uses a fixed number of function calls <tt>calls</tt>.
 #   The argument <tt>rng</tt> is a random number generator (optional). If it is not
 #   given, a new generator is created internally and freed when the calculation
@@ -67,7 +67,7 @@
 #
 #   See sample scripts <tt>sample/monte*.rb</tt> for more details.
 #
-# == {}[link:index.html"name="4] Accessing internal state of the Monte Carlo classes
+# == Accessing internal state of the Monte Carlo classes
 # ---
 # * GSL::Monte::Miser#estimate_frac
 # * GSL::Monte::Miser#estimate_frac=
@@ -102,7 +102,7 @@
 # * GSL::Monte::Vegas#verbose=
 #
 #
-# == {}[link:index.html"name="5] Miser Parameters (GSL-1.13 or later)
+# == Miser Parameters (GSL-1.13 or later)
 # ---
 # * GSL::Monte::Miser#params_get
 #
@@ -111,7 +111,7 @@
 # * GSL::Monte::Miser#params_set(params)
 #
 #   Sets the integrator parameters based on values provided in an object of the <tt>GSL::Monte::Miser::Params</tt> class <tt>params</tt>.
-# === {}[link:index.html"name="5.1] Accessors of <tt>GSL::Monte::Miser::Params</tt>
+# === Accessors of Miser <tt>Params</tt>
 # ---
 # * GSL::Monte::Miser::Params#estimate_frac
 # * GSL::Monte::Miser::Params#estimate_frac=
@@ -138,7 +138,7 @@
 #
 # This parameter introduces a random fractional variation of size dither into each bisection, which can be used to break the symmetry of integrands which are concentrated near the exact center of the hypercubic integration region. The default value of dither is zero, so no variation is introduced. If needed, a typical value of dither is 0.1.
 #
-# == {}[link:index.html"name="6] Vegas Parameters (GSL-1.13 or later)
+# == Vegas Parameters (GSL-1.13 or later)
 # ---
 # * GSL::Monte::Vegas#params_get
 #
@@ -148,7 +148,7 @@
 #
 #   Sets the integrator parameters based on values provided in an object of the <tt>GSL::Monte::Vegas::Params</tt> class <tt>params</tt>.
 #
-# === {}[link:index.html"name="6.1] Accessors of <tt>GSL::Monte::Vegas::Params</tt>
+# === Accessors of Vegas <tt>Params</tt>
 # ---
 # * GSL::Monte::Vegas::Params#alpha
 # * GSL::Monte::Vegas::Params#alpha=
@@ -175,7 +175,7 @@
 #
 #   Set the level of information printed by VEGAS. All information is written to the stream ostream. The default setting of verbose is -1, which turns off all output. A verbose value of 0 prints summary information about the weighted average and final result, while a value of 1 also displays the grid coordinates. A value of 2 prints information from the rebinning procedure for each iteration.
 #
-# == {}[link:index.html"name="7] Example
+# == Example
 #
 #      #!/usr/bin/env ruby
 #      require("gsl")
@@ -220,15 +220,15 @@
 #      puts("converging...");
 #      begin
 #        result, error = G.integrate(xl, xu, dim, calls/5, r, vegas)
-#        printf("result = % .6f sigma = % .6f chisq/dof = %.1f\n", 
+#        printf("result = % .6f sigma = % .6f chisq/dof = %.1f\n",
 #                result, error, vegas.chisq)
 #      end while (vegas.chisq-1.0).abs > 0.5
 #      display_results("vegas final", result, error)
 #
-# {prev}[link:rdoc/ntuple_rdoc.html]
-# {next}[link:rdoc/siman_rdoc.html]
+# {prev}[link:ntuple_rdoc.html]
+# {next}[link:siman_rdoc.html]
 #
-# {Reference index}[link:rdoc/ref_rdoc.html]
+# {Reference index}[link:ref_rdoc.html]
 # {top}[link:index.html]
 #
 #

data/rdoc/multimin.rdoc

@@ -1,78 +1,78 @@
 #
 # = Multidimensional Minimization
-# This chapter describes routines for finding minima of arbitrary 
-# multidimensional functions. The library provides low level components for a 
-# variety of iterative minimizers and convergence tests. These can be combined 
-# by the user to achieve the desired solution, while providing full access to 
-# the intermediate steps of the algorithms. Each class of methods uses the 
-# same framework, so that you can switch between minimizers at runtime without 
-# needing to recompile your program. Each instance of a minimizer keeps track 
-# of its own state, allowing the minimizers to be used in multi-threaded 
-# programs. 
+# This chapter describes routines for finding minima of arbitrary
+# multidimensional functions. The library provides low level components for a
+# variety of iterative minimizers and convergence tests. These can be combined
+# by the user to achieve the desired solution, while providing full access to
+# the intermediate steps of the algorithms. Each class of methods uses the
+# same framework, so that you can switch between minimizers at runtime without
+# needing to recompile your program. Each instance of a minimizer keeps track
+# of its own state, allowing the minimizers to be used in multi-threaded
+# programs.
 #
 # Contents:
-# 1. {Overview}[link:rdoc/multimin_rdoc.html#1]
-# 1. {Caveats}[link:rdoc/multimin_rdoc.html#2]
-# 1. {Initializing the Multidimensional Minimizer}[link:rdoc/multimin_rdoc.html#3]
-# 1. {Providing a function to minimize}[link:rdoc/multimin_rdoc.html#4]
-# 1. {Iteration}[link:rdoc/multimin_rdoc.html#5]
-# 1. {Stopping Criteria}[link:rdoc/multimin_rdoc.html#6]
-# 1. {Examples}[link:rdoc/multimin_rdoc.html#7]
-#    1. {FdfMinimizer}[link:rdoc/multimin_rdoc.html#7.1]
-#    1. {FMinimizer}[link:rdoc/multimin_rdoc.html#7.2]
-#
-# == {}[link:index.html"name="1] Overview
-# The problem of multidimensional minimization requires finding a point x such 
-# that the scalar function, takes a value which is lower than at any neighboring 
-# point. For smooth functions the gradient g = \nabla f vanishes at the minimum. 
-# In general there are no bracketing methods available for the minimization of 
-# n-dimensional functions. The algorithms proceed from an initial guess using a 
-# search algorithm which attempts to move in a downhill direction. 
-#
-# Algorithms making use of the gradient of the function perform a 
-# one-dimensional line minimisation along this direction until the lowest point 
-# is found to a suitable tolerance. The search direction is then updated with 
-# local information from the function and its derivatives, and the whole process 
-# repeated until the true n-dimensional minimum is found. 
-#
-# The Nelder-Mead Simplex algorithm applies a different strategy. It maintains 
-# n+1 trial parameter vectors as the vertices of a n-dimensional simplex. 
-# In each iteration step it tries to improve the worst vertex by a simple 
-# geometrical transformation until the size of the simplex falls below a given 
-# tolerance. 
-#
-# Both types of algorithms use a standard framework. The user provides a 
-# high-level driver for the algorithms, and the library provides the individual 
-# functions necessary for each of the steps. There are three main phases of the 
-# iteration. The steps are, 
-#
-# * initialize minimizer state, s, for algorithm T 
-# * update s using the iteration T 
-# * test s for convergence, and repeat iteration if necessary 
-#
-# Each iteration step consists either of an improvement to the line-minimisation 
-# in the current direction or an update to the search direction itself. The 
-# state for the minimizers is held in a <tt>GSL::MultiMin::FdfMinimizer</tt> or 
+# 1. {Overview}[link:multimin_rdoc.html#label-Overview]
+# 1. {Caveats}[link:multimin_rdoc.html#label-Caveats]
+# 1. {Initializing the Multidimensional Minimizer}[link:multimin_rdoc.html#label-Initializing+the+Multidimensional+Minimizer]
+# 1. {Providing a function to minimize}[link:multimin_rdoc.html#label-Providing+a+function+to+minimize]
+# 1. {Iteration}[link:multimin_rdoc.html#label-Iteration]
+# 1. {Stopping Criteria}[link:multimin_rdoc.html#label-Stopping+Criteria]
+# 1. {Examples}[link:multimin_rdoc.html#label-Examples]
+#    1. {FdfMinimizer}[link:multimin_rdoc.html#label-FdfMinimizer]
+#    1. {FMinimizer}[link:multimin_rdoc.html#label-FMinimizer]
+#
+# == Overview
+# The problem of multidimensional minimization requires finding a point x such
+# that the scalar function, takes a value which is lower than at any neighboring
+# point. For smooth functions the gradient g = \nabla f vanishes at the minimum.
+# In general there are no bracketing methods available for the minimization of
+# n-dimensional functions. The algorithms proceed from an initial guess using a
+# search algorithm which attempts to move in a downhill direction.
+#
+# Algorithms making use of the gradient of the function perform a
+# one-dimensional line minimisation along this direction until the lowest point
+# is found to a suitable tolerance. The search direction is then updated with
+# local information from the function and its derivatives, and the whole process
+# repeated until the true n-dimensional minimum is found.
+#
+# The Nelder-Mead Simplex algorithm applies a different strategy. It maintains
+# n+1 trial parameter vectors as the vertices of a n-dimensional simplex.
+# In each iteration step it tries to improve the worst vertex by a simple
+# geometrical transformation until the size of the simplex falls below a given
+# tolerance.
+#
+# Both types of algorithms use a standard framework. The user provides a
+# high-level driver for the algorithms, and the library provides the individual
+# functions necessary for each of the steps. There are three main phases of the
+# iteration. The steps are,
+#
+# * initialize minimizer state, s, for algorithm T
+# * update s using the iteration T
+# * test s for convergence, and repeat iteration if necessary
+#
+# Each iteration step consists either of an improvement to the line-minimisation
+# in the current direction or an update to the search direction itself. The
+# state for the minimizers is held in a <tt>GSL::MultiMin::FdfMinimizer</tt> or
 # a <tt>GSL::MultiMin::FMinimizer</tt> object.
 #
-# == {}[link:index.html"name="2] Caveats
-# Note that the minimization algorithms can only search for one local minimum 
-# at a time. When there are several local minima in the search area, the first 
-# minimum to be found will be returned; however it is difficult to predict which 
-# of the minima this will be. In most cases, no error will be reported if you 
-# try to find a local minimum in an area where there is more than one. 
+# == Caveats
+# Note that the minimization algorithms can only search for one local minimum
+# at a time. When there are several local minima in the search area, the first
+# minimum to be found will be returned; however it is difficult to predict which
+# of the minima this will be. In most cases, no error will be reported if you
+# try to find a local minimum in an area where there is more than one.
 #
-# It is also important to note that the minimization algorithms find local 
-# minima; there is no way to determine whether a minimum is a global minimum of 
-# the function in question. 
+# It is also important to note that the minimization algorithms find local
+# minima; there is no way to determine whether a minimum is a global minimum of
+# the function in question.
 #
 #
-# == {}[link:index.html"name="3] Initializing the Multidimensional Minimizer
+# == Initializing the Multidimensional Minimizer
 # ---
 # * GSL::MultiMin::FdfMinimizer.alloc(type, n)
 # * GSL::MultiMin::FMinimizer.alloc(type, n)
 #
-#   These method create a minimizer of type <tt>type</tt> for an <tt>n</tt>-dimension function. 
+#   These method create a minimizer of type <tt>type</tt> for an <tt>n</tt>-dimension function.
 #   The type is given by a string, or by a Ruby constant.
 #
 #   * <tt>GSL::MultiMin::FdfMinimizer::CONJUGATE_FR</tt> or <tt>"conjugate_fr"</tt>
@@ -93,17 +93,17 @@
 # ---
 # * GSL::MultiMin::FdfMinimizer#set(func, x, step_size, tol)
 #
-#   This method initializes the minimizer <tt>self</tt> to minimize the function 
-#   <tt>fdf</tt> (the <tt>GSL::MultiMin::Function_fdf</tt> class, see below) starting from 
-#   the initial point <tt>x</tt> (<tt>GSL::Vector</tt>). The size of the first trial step is 
-#   given by <tt>step_size</tt> (<tt>Vector</tt>). The accuracy of the line minimization is 
+#   This method initializes the minimizer <tt>self</tt> to minimize the function
+#   <tt>fdf</tt> (the <tt>GSL::MultiMin::Function_fdf</tt> class, see below) starting from
+#   the initial point <tt>x</tt> (<tt>GSL::Vector</tt>). The size of the first trial step is
+#   given by <tt>step_size</tt> (<tt>Vector</tt>). The accuracy of the line minimization is
 #   specified by <tt>tol</tt>.
 #
 # ---
 # * GSL::MultiMin::FMinimizer#set(func, x, step_size)
 #
-#   This method initializes the minimizer <tt>self</tt> to minimize the function <tt>func</tt>, 
-#   starting from the initial point <tt>x</tt> (Vector). The size of the initial trial steps 
+#   This method initializes the minimizer <tt>self</tt> to minimize the function <tt>func</tt>,
+#   starting from the initial point <tt>x</tt> (Vector). The size of the initial trial steps
 #   is given in vector <tt>step_size</tt>.
 #
 # ---
@@ -112,10 +112,10 @@
 #
 #   These return the name of the minimizer <tt>self</tt>.
 #
-# == {}[link:index.html"name="4] Providing a function to minimize
-# You must provide a parametric function of <tt>n</tt> variables for the minimizers to 
-# operate on. You may also need to provide a routine which calculates the gradient of the 
-# function. In order to allow for general parameters the functions are defined by the 
+# == Providing a function to minimize
+# You must provide a parametric function of <tt>n</tt> variables for the minimizers to
+# operate on. You may also need to provide a routine which calculates the gradient of the
+# function. In order to allow for general parameters the functions are defined by the
 # classes, <tt>GSL::MultiMin::Function_fdf</tt> and <tt>GSL::MultiMin::Function</tt>.
 #
 # ---
@@ -166,14 +166,14 @@
 #     my_func = Function.alloc(my_f, np)
 #     my_func.set_params([1.0, 2.0])      # parameters
 #
-# == {}[link:index.html"name="5] Iteration
+# == Iteration
 # ---
 # * GSL::MultiMin::FdfMinimizer#iterate
 # * GSL::MultiMin::FMinimizer#iterate
 #
-#   These methods perform a single iteration of the minimizer <tt>self</tt>. 
+#   These methods perform a single iteration of the minimizer <tt>self</tt>.
 #   If the iteration encounters an unexpected problem then an error code will be returned.
-#   The minimizer maintains a current best estimate of the minimum at all times. 
+#   The minimizer maintains a current best estimate of the minimum at all times.
 #   This information can be accessed with the following methods,
 #
 # ---
@@ -184,48 +184,48 @@
 # * GSL::MultiMin::FMinimizer#minimum
 # * GSL::MultiMin::FMinimizer#size
 #
-#   These method return the current best estimate of the location of the minimum, 
-#   the value of the function at that point, its gradient, and minimizer specific 
+#   These method return the current best estimate of the location of the minimum,
+#   the value of the function at that point, its gradient, and minimizer specific
 #   characteristic size for the minimizer <tt>self</tt>.
 #
 # ---
 # * GSL::MultiMin::FdfMinimizer#restart
 #
-#   This method resets the minimizer <tt>self</tt> to use the current point as a new 
+#   This method resets the minimizer <tt>self</tt> to use the current point as a new
 #   starting point.
 #
-# == {}[link:index.html"name="6] Stopping Criteria
+# == Stopping Criteria
 # A minimization procedure should stop when one of the following conditions is true:
 # * A minimum has been found to within the user-specified precision.
 # * A user-specified maximum number of iterations has been reached.
 # * An error has occurred.
-# The handling of these conditions is under user control. The methods below allow the 
+# The handling of these conditions is under user control. The methods below allow the
 # user to test the precision of the current result.
 #
 # ---
 # * GSL::MultiMin::FdfMinimizer#test_gradient(epsabs)
 # * GSL::MultiMin::FdfMinimizer.test_gradient(g, epsabs)
 #
-#   These method test the norm of the gradient <tt>g</tt> against the absolute tolerance 
-#   <tt>epsabs</tt>. The gradient of a multidimensional function goes to zero at a minimum. 
+#   These method test the norm of the gradient <tt>g</tt> against the absolute tolerance
+#   <tt>epsabs</tt>. The gradient of a multidimensional function goes to zero at a minimum.
 #   The tests return <tt>GSL::SUCCESS</tt> if the following condition is achieved,
 #     |g| < epsabs
-#   and returns <tt>GSL::CONTINUE</tt> otherwise. A suitable choice of <tt>epsabs</tt> can 
-#   be made from the desired accuracy in the function for small variations in <tt>x</tt>. 
+#   and returns <tt>GSL::CONTINUE</tt> otherwise. A suitable choice of <tt>epsabs</tt> can
+#   be made from the desired accuracy in the function for small variations in <tt>x</tt>.
 #   The relationship between these quantities is given by <tt>\delta f = g \delta x</tt>.
 #
 # ---
 # * GSL::MultiMin::FdfMinimizer#test_size(epsabs)
 # * GSL::MultiMin::FdfMinimizer.test_size(size, epsabs)
 #
-#   These method test the minimizer specific characteristic <tt>size</tt> 
-#   (if applicable to the used minimizer) against absolute tolerance <tt>epsabs</tt>. 
-#   The tests return (<tt>GSL::SUCCESS</tt> if the size is smaller than tolerance, 
+#   These method test the minimizer specific characteristic <tt>size</tt>
+#   (if applicable to the used minimizer) against absolute tolerance <tt>epsabs</tt>.
+#   The tests return (<tt>GSL::SUCCESS</tt> if the size is smaller than tolerance,
 #   otherwise <tt>GSL::CONTINUE</tt> is returned.
 #
-# == {}[link:index.html"name="7] Examples
+# == Examples
 #
-# === {}[link:index.html"name="7.1] FdfMinimizer
+# === FdfMinimizer
 #      #!/usr/bin/env ruby
 #      require("gsl")
 #      include GSL::MultiMin
@@ -264,13 +264,13 @@
 #        printf("%5d %.5f %.5f %10.5f\n", iter, x[0], x[1], f)
 #      end while status == GSL::CONTINUE and iter < 100
 #
-# === {}[link:index.html"name="7.2] FMinimizer
+# === FMinimizer
 #      #!/usr/bin/env ruby
 #      require("gsl")
 #      include GSL::MultiMin
 #
 #      np = 2
-#  
+#
 #      my_f = Proc.new { |v, params|
 #        x = v[0]; y = v[1]
 #        p0 = params[0]; p1 = params[1]
@@ -303,10 +303,10 @@
 #        printf("f() = %7.3f size = %.3f\n", minimizer.fval, minimizer.size);
 #      end while status == GSL::CONTINUE and iter < 100
 #
-# {prev}[link:rdoc/multiroot_rdoc.html]
-# {next}[link:rdoc/fit_rdoc.html]
+# {prev}[link:multiroot_rdoc.html]
+# {next}[link:fit_rdoc.html]
 #
-# {Reference index}[link:rdoc/ref_rdoc.html]
+# {Reference index}[link:ref_rdoc.html]
 # {top}[link:index.html]
 #
 #