bspline.rdoc in rb-gsl-1.16.0.5

- old
+ new

@@ -1,13 +1,13 @@
 #
 # = Basis Splines
 # This chapter describes functions for the computation of smoothing basis splines (B-splines). This is only for GSL-1.9 or later.
 #
-# 1. {Overview}[link:bspline_rdoc.html#label-Overview]
-# 1. {Initializing the B-splines solver}[link:bspline_rdoc.html#label-Initializing+the+B-splines+solver]
-# 1. {Constructing the knots vector}[link:bspline_rdoc.html#label-Constructing+the+knots+vector]
-# 1. {Evaluation of B-splines}[link:bspline_rdoc.html#label-Evaluation+of+B-splines]
+# 1. {Overview}[link:rdoc/bspline_rdoc.html#label-Overview]
+# 1. {Initializing the B-splines solver}[link:rdoc/bspline_rdoc.html#label-Initializing+the+B-splines+solver]
+# 1. {Constructing the knots vector}[link:rdoc/bspline_rdoc.html#label-Constructing+the+knots+vector]
+# 1. {Evaluation of B-splines}[link:rdoc/bspline_rdoc.html#label-Evaluation+of+B-splines]
 #
 # == Overview
 #
 # B-splines are commonly used as basis functions to fit smoothing curves to large data sets. To do this, the abscissa axis is broken up into some number of intervals, where the endpoints of each interval are called breakpoints. These breakpoints are then converted to knots by imposing various continuity and smoothness conditions at each interface. Given a nondecreasing knot vector t = \{t_0, t_1, \dots, t_{n+k-1\, the n basis splines of order k are defined by for i = 0, \dots, n-1. The common case of cubic B-splines is given by k = 4. The above recurrence relation can be evaluated in a numerically stable way by the de Boor algorithm.
 #
@@ -32,11 +32,11 @@
 # ---
 # * GSL::BSpline#eval(x[, B])
 #
 #   This method evaluates all B-spline basis functions at the position <tt>x</tt> and stores them in <tt>B</tt> (if given), so that the ith element of <tt>B</tt> is <tt>B_i(x)</tt>. <tt>B</tt> must be of length <tt>n = nbreak + k - 2</tt>. If <tt>B</tt> is not given, a newly created vector is returned.It is far more efficient to compute all of the basis functions at once than to compute them individually, due to the nature of the defining recurrence relation.
 #
-# {prev}[link:nonlinearfit_rdoc.html]
-# {next}[link:const_rdoc.html]
+# {prev}[link:rdoc/nonlinearfit_rdoc.html]
+# {next}[link:rdoc/const_rdoc.html]
 #
-# {Reference index}[link:ref_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
 # {top}[link:index.html]
 #