rb-gsl 1.15.3.1 → 1.15.3.2

data/rdoc/hist2d.rdoc

@@ -57,7 +57,7 @@
 # * GSL::Histogram2d#set_ranges(vx, vy)
 #
 #   This sets the ranges of the existing histogram using 
-#   two {GSL::Vector}[link:files/rdoc/vector_rdoc.html] objects or arrays.
+#   two {GSL::Vector}[link:rdoc/vector_rdoc.html] objects or arrays.
 # ---
 # * GSL::Histogram2d#set_ranges_uniform(xmin, xmax, ymin, ymax)
 # * GSL::Histogram2d#set_ranges_uniform([xmin, xmax], [ymin, ymax])
@@ -271,9 +271,9 @@
 #   GSL::graph(hx, hy, "-T X -C -g 3")
 #
 #
-# {prev}[link:files/rdoc/hist_rdoc.html]
-# {next}[link:files/rdoc/hist3d_rdoc.html]
+# {prev}[link:rdoc/hist_rdoc.html]
+# {next}[link:rdoc/hist3d_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #

data/rdoc/hist3d.rdoc

@@ -104,9 +104,9 @@
 #   Creates a <tt>GSL::Histogram2d</tt> object by projecting the 3D histogram 
 #   <tt>self</tt> onto the yz-plane over the x-range from <tt>istart</tt> to <tt>iend</tt>.
 #
-# {prev}[link:files/rdoc/hist2d_rdoc.html]
-# {next}[link:files/rdoc/ntuple_rdoc.html]
+# {prev}[link:rdoc/hist2d_rdoc.html]
+# {next}[link:rdoc/ntuple_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #

data/rdoc/index.rdoc

@@ -1,5 +1,5 @@
 #
-# = {Ruby/GSL}[link:files/rdoc/index_rdoc.html"target="_parent]
+# = {Ruby/GSL}[link:doc/rdoc/index_rdoc.html"target="_parent]
 #
 # Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License.
 #
@@ -10,7 +10,7 @@
 # === {}[link:index.html"name="3.1] Using the gem command
 # Ruby/GSL may now be installed as a Ruby Gem by simply running
 #
-#   gem install gsl
+#   gem install rb-gsl
 #
 # Note that the GSL libraries must already be installed before Ruby/GSL
 # can be installed.
@@ -33,11 +33,11 @@
 #
 # == {}[link:index.html"name="4] Screenshot
 #
-# Ruby/GSL can be seen in action in these {screenshots}[link:files/rdoc/screenshot_rdoc.html].
+# Ruby/GSL can be seen in action in these {screenshots}[link:doc/rdoc/screenshot_rdoc.html].
 #
 # == {}[link:index.html"name="5] Reference
 #
-# The {Ruby/GSL reference manual}[link:files/rdoc/ref_rdoc.html] follows and borrows
+# The {Ruby/GSL reference manual}[link:doc/rdoc/ref_rdoc.html] follows and borrows
 # large parts of the GSL reference manual.
 #
 # == {}[link:index.html"name="6] Examples

data/rdoc/integration.rdoc

@@ -1,23 +1,23 @@
 #
 # = Numerical Integration
 # Contents:
-# 1. {Introduction}[link:files/rdoc/integration_rdoc.html#1]
-# 1. {QNG non-adaptive Gauss-Kronrod integration}[link:files/rdoc/integration_rdoc.html#2]
-# 1. {QAG adaptive integration}[link:files/rdoc/integration_rdoc.html#3]
-#    1. {GSL::Integration::Workspace class}[link:files/rdoc/integration_rdoc.html#3.1]
-#    1. {Methods}[link:files/rdoc/integration_rdoc.html#3.2]
-# 1. {QAGS adaptive integration with singularities}[link:files/rdoc/integration_rdoc.html#4]
-# 1. {QAGP adaptive integration with known singular points}[link:files/rdoc/integration_rdoc.html#5]
-# 1. {QAGI adaptive integration on infinite intervals}[link:files/rdoc/integration_rdoc.html#6]
-# 1. {QAWC adaptive integration for Cauchy principal values}[link:files/rdoc/integration_rdoc.html#7]
-# 1. {QAWS adaptive integration for singular functions}[link:files/rdoc/integration_rdoc.html#8]
-# 1. {QAWO adaptive integration for oscillatory functions}[link:files/rdoc/integration_rdoc.html#9]
-# 1. {QAWF adaptive integration for Fourier integrals}[link:files/rdoc/integration_rdoc.html#10]
+# 1. {Introduction}[link:rdoc/integration_rdoc.html#1]
+# 1. {QNG non-adaptive Gauss-Kronrod integration}[link:rdoc/integration_rdoc.html#2]
+# 1. {QAG adaptive integration}[link:rdoc/integration_rdoc.html#3]
+#    1. {GSL::Integration::Workspace class}[link:rdoc/integration_rdoc.html#3.1]
+#    1. {Methods}[link:rdoc/integration_rdoc.html#3.2]
+# 1. {QAGS adaptive integration with singularities}[link:rdoc/integration_rdoc.html#4]
+# 1. {QAGP adaptive integration with known singular points}[link:rdoc/integration_rdoc.html#5]
+# 1. {QAGI adaptive integration on infinite intervals}[link:rdoc/integration_rdoc.html#6]
+# 1. {QAWC adaptive integration for Cauchy principal values}[link:rdoc/integration_rdoc.html#7]
+# 1. {QAWS adaptive integration for singular functions}[link:rdoc/integration_rdoc.html#8]
+# 1. {QAWO adaptive integration for oscillatory functions}[link:rdoc/integration_rdoc.html#9]
+# 1. {QAWF adaptive integration for Fourier integrals}[link:rdoc/integration_rdoc.html#10]
 #
 # == {}[link:index.html"name="1] Introduction
 # This section describes how to compute numerical integration of a function 
 # in one dimension. In Ruby/GSL, all the GSL routines for numerical integration 
-# is provided as methods of {GSL::Function}[link:files/rdoc/function_rdoc.html] objects.
+# is provided as methods of {GSL::Function}[link:rdoc/function_rdoc.html] objects.
 # For example, a <tt>GSL::Function</tt> object which represents the sine function 
 # <tt>sin(x)</tt> can be expressed as
 #   f = GSL::Function.alloc { |x| sin(x) }
@@ -389,10 +389,10 @@
 #
 #   Applies the Gauss-Legendre integration rule contained in table <tt>t</tt> and returns the result.
 #
-# {prev}[link:files/rdoc/wavelet_rdoc.html]
-# {next}[link:files/rdoc/rng_rdoc.html]
+# {prev}[link:rdoc/wavelet_rdoc.html]
+# {next}[link:rdoc/rng_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/interp.rdoc

@@ -8,14 +8,14 @@
 # functions are available for computing derivatives and integrals of 
 # interpolating functions. 
 #
-# 1. {Interpolation classes}[link:files/rdoc/interp_rdoc.html#1]
-# 1. {Initializing interpolation objects}[link:files/rdoc/interp_rdoc.html#2]
-# 1. {Index Look-up and Acceleration}[link:files/rdoc/interp_rdoc.html#3]
-# 1. {Evaluation of Interpolating Functions}[link:files/rdoc/interp_rdoc.html#4]
-# 1. {Higher level interface: GSL::Spline class}[link:files/rdoc/interp_rdoc.html#5]
-#    1. {Class initialization}[link:files/rdoc/interp_rdoc.html#5.1]
-#    1. {Evaluation}[link:files/rdoc/interp_rdoc.html#5.2]
-#    1. {Finding and acceleration}[link:files/rdoc/interp_rdoc.html#5.3]
+# 1. {Interpolation classes}[link:rdoc/interp_rdoc.html#1]
+# 1. {Initializing interpolation objects}[link:rdoc/interp_rdoc.html#2]
+# 1. {Index Look-up and Acceleration}[link:rdoc/interp_rdoc.html#3]
+# 1. {Evaluation of Interpolating Functions}[link:rdoc/interp_rdoc.html#4]
+# 1. {Higher level interface: GSL::Spline class}[link:rdoc/interp_rdoc.html#5]
+#    1. {Class initialization}[link:rdoc/interp_rdoc.html#5.1]
+#    1. {Evaluation}[link:rdoc/interp_rdoc.html#5.2]
+#    1. {Finding and acceleration}[link:rdoc/interp_rdoc.html#5.3]
 #
 # == {}[link:index.html"name="1] Interpolation Classes
 # * GSL
@@ -221,11 +221,11 @@
 #
 # See also the GSL manual and the examples in <tt>examples/</tt>
 #
-# {prev}[link:files/rdoc/odeiv_rdoc.html]
-# {next}[link:files/rdoc/diff_rdoc.html]
+# {prev}[link:rdoc/odeiv_rdoc.html]
+# {next}[link:rdoc/diff_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #
 #   

data/rdoc/intro.rdoc

@@ -17,11 +17,11 @@
 # * Ruby (1.8 or later recommended)
 #
 # == {}[link:index.html"name="2] Installation
-# See {here}[link:files/rdoc/index_rdoc.html].
+# See {here}[link:index.html].
 #
-# {next}[link:files/rdoc/use_rdoc.html]
+# {next}[link:rdoc/use_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/linalg.rdoc

@@ -2,21 +2,21 @@
 # = Linear Algebra
 #
 # Contents:
-# 1. {LU Decomposition}[link:files/rdoc/linalg_rdoc.html#1]
-# 1. {QR Decomposition}[link:files/rdoc/linalg_rdoc.html#2]
-# 1. {QR Decomposition with Column Pivoting}[link:files/rdoc/linalg_rdoc.html#3]
-# 1. {Singular Value Decomposition}[link:files/rdoc/linalg_rdoc.html#4]
-# 1. {Cholesky Decomposition}[link:files/rdoc/linalg_rdoc.html#5]
-# 1. {Tridiagonal Decomposition of Real Symmetric Matrices}[link:files/rdoc/linalg_rdoc.html#6]
-# 1. {Tridiagonal Decomposition of Hermitian Matrices}[link:files/rdoc/linalg_rdoc.html#7]
-# 1. {Hessenberg Decomposition of Real Matrices}[link:files/rdoc/linalg_rdoc.html#8]
-# 1. {Hessenberg-Triangular Decomposition of Real Matrices}[link:files/rdoc/linalg_rdoc.html#9]
-# 1. {Bidiagonalization}[link:files/rdoc/linalg_rdoc.html#10]
-# 1. {Householder Transformations}[link:files/rdoc/linalg_rdoc.html#11]
-# 1. {Householder solver for linear systems}[link:files/rdoc/linalg_rdoc.html#12]
-# 1. {Tridiagonal Systems}[link:files/rdoc/linalg_rdoc.html#13]
-# 1. {Balancing}[link:files/rdoc/linalg_rdoc.html#14]
-# 1. {NArray}[link:files/rdoc/linalg_rdoc.html#15]
+# 1. {LU Decomposition}[link:rdoc/linalg_rdoc.html#1]
+# 1. {QR Decomposition}[link:rdoc/linalg_rdoc.html#2]
+# 1. {QR Decomposition with Column Pivoting}[link:rdoc/linalg_rdoc.html#3]
+# 1. {Singular Value Decomposition}[link:rdoc/linalg_rdoc.html#4]
+# 1. {Cholesky Decomposition}[link:rdoc/linalg_rdoc.html#5]
+# 1. {Tridiagonal Decomposition of Real Symmetric Matrices}[link:rdoc/linalg_rdoc.html#6]
+# 1. {Tridiagonal Decomposition of Hermitian Matrices}[link:rdoc/linalg_rdoc.html#7]
+# 1. {Hessenberg Decomposition of Real Matrices}[link:rdoc/linalg_rdoc.html#8]
+# 1. {Hessenberg-Triangular Decomposition of Real Matrices}[link:rdoc/linalg_rdoc.html#9]
+# 1. {Bidiagonalization}[link:rdoc/linalg_rdoc.html#10]
+# 1. {Householder Transformations}[link:rdoc/linalg_rdoc.html#11]
+# 1. {Householder solver for linear systems}[link:rdoc/linalg_rdoc.html#12]
+# 1. {Tridiagonal Systems}[link:rdoc/linalg_rdoc.html#13]
+# 1. {Balancing}[link:rdoc/linalg_rdoc.html#14]
+# 1. {NArray}[link:rdoc/linalg_rdoc.html#15]
 #
 # == {}[link:index.html"name="1] LU Decomposition
 # ---
@@ -102,7 +102,7 @@
 #
 #   These methods return the determinant of the matrix.
 #
-# === {}[link:index.html"name="1.1] {Complex LU decomposition}[link:files/rdoc/linalg_complex_rdoc.html]
+# === {}[link:index.html"name="1.1] {Complex LU decomposition}[link:rdoc/linalg_complex_rdoc.html]
 #
 # == {}[link:index.html"name="2] QR decomposition
 #
@@ -366,7 +366,7 @@
 #   These methods solve the system <tt>A x = b</tt> using the Cholesky decomposition 
 #   of <tt>A</tt> into the matrix <tt>cholesky</tt> given by <tt>GSL::Linalg::Cholesky.decomp</tt>.
 #
-# === {}[link:index.html"name="5.1] {Complex Cholesky decomposition}[link:files/rdoc/cholesky_complex_rdoc.html]
+# === {}[link:index.html"name="5.1] {Complex Cholesky decomposition}[link:rdoc/cholesky_complex_rdoc.html]
 #
 # == {}[link:index.html"name="6] Tridiagonal Decomposition of Real Symmetric Matrices 
 # ---
@@ -672,10 +672,10 @@
 #     * HH.solve(m, b)
 #     * HH.svx(m, bx)
 #
-# {prev}[link:files/rdoc/blas_rdoc.html]
-# {next}[link:files/rdoc/eigen_rdoc.html]
+# {prev}[link:rdoc/blas_rdoc.html]
+# {next}[link:rdoc/eigen_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/linalg_complex.rdoc

@@ -83,6 +83,6 @@
 # * GSL::Linalg::Complex::LU::LUMatrix#sgndet(signum)
 #
 #
-# {back}[link:files/rdoc/linalg_rdoc.html]
+# {back}[link:rdoc/linalg_rdoc.html]
 #
 #

data/rdoc/math.rdoc

@@ -1,16 +1,16 @@
 #
 # = Mathematical Functions
 # Contents:
-# 1. {Mathematical Constants}[link:files/rdoc/math_rdoc.html#1]
-#    1. {Infinities and Not-a-number}[link:files/rdoc/math_rdoc.html#2]
-#    1. {Constants}[link:files/rdoc/math_rdoc.html#2.1]
-# 1. {Module functions}[link:files/rdoc/math_rdoc.html#2.2]
-# 1. {Elementary Functions}[link:files/rdoc/math_rdoc.html#3]
-# 1. {Small Integer Powers}[link:files/rdoc/math_rdoc.html#4]
-# 1. {Testing the Sign of Numbers}[link:files/rdoc/math_rdoc.html#5]
-# 1. {Testing for Odd and Even Numbers}[link:files/rdoc/math_rdoc.html#6]
-# 1. {Maximum and Minimum functions}[link:files/rdoc/math_rdoc.html#7]
-# 1. {Approximate Comparison of Floating Point Numbers}[link:files/rdoc/math_rdoc.html#8]
+# 1. {Mathematical Constants}[link:rdoc/math_rdoc.html#1]
+#    1. {Infinities and Not-a-number}[link:rdoc/math_rdoc.html#2]
+#    1. {Constants}[link:rdoc/math_rdoc.html#2.1]
+# 1. {Module functions}[link:rdoc/math_rdoc.html#2.2]
+# 1. {Elementary Functions}[link:rdoc/math_rdoc.html#3]
+# 1. {Small Integer Powers}[link:rdoc/math_rdoc.html#4]
+# 1. {Testing the Sign of Numbers}[link:rdoc/math_rdoc.html#5]
+# 1. {Testing for Odd and Even Numbers}[link:rdoc/math_rdoc.html#6]
+# 1. {Maximum and Minimum functions}[link:rdoc/math_rdoc.html#7]
+# 1. {Approximate Comparison of Floating Point Numbers}[link:rdoc/math_rdoc.html#8]
 #
 # == {}[link:index.html"name="1] Mathematical Constants
 # ---
@@ -267,10 +267,10 @@
 #
 #   Ruby/GSL version
 #
-# {prev}[link:files/rdoc/ehandling_rdoc.html]
-# {next}[link:files/rdoc/complex_rdoc.html]
+# {prev}[link:rdoc/ehandling_rdoc.html]
+# {next}[link:rdoc/complex_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/matrix.rdoc

@@ -1,22 +1,22 @@
 #
 # = Matrices
 # Contents:
-# 1. {Class methods}[link:files/rdoc/matrix_rdoc.html#1]
-# 1. {Instance methods}[link:files/rdoc/matrix_rdoc.html#2]
-#    1. {Accessing matrix elements}[link:files/rdoc/matrix_rdoc.html#2.1]
-#    1. {Initializing matrix elements}[link:files/rdoc/matrix_rdoc.html#2.2]
-#    1. {IO}[link:files/rdoc/matrix_rdoc.html#2.3]
-#    1. {Matrix views}[link:files/rdoc/matrix_rdoc.html#2.4]
-#    1. {Creating row and column views}[link:files/rdoc/matrix_rdoc.html#2.5]
-#    1. {Iterators}[link:files/rdoc/matrix_rdoc.html#2.6]
-#    1. {Copying matrices}[link:files/rdoc/matrix_rdoc.html#2.7]
-#    1. {Copying rows and columns}[link:files/rdoc/matrix_rdoc.html#2.8]
-#    1. {Exchanging rows and columns}[link:files/rdoc/matrix_rdoc.html#2.9]
-#    1. {Matrix operations}[link:files/rdoc/matrix_rdoc.html#2.10]
-#    1. {Finding maximum and minimum elements of matrices}[link:files/rdoc/matrix_rdoc.html#2.11]
-#    1. {Matrix properties}[link:files/rdoc/matrix_rdoc.html#2.12]
-# 1. {NArray}[link:files/rdoc/matrix_rdoc.html#3]
-# 1. {Special matrices}[link:files/rdoc/matrix_rdoc.html#4]
+# 1. {Class methods}[link:rdoc/matrix_rdoc.html#1]
+# 1. {Instance methods}[link:rdoc/matrix_rdoc.html#2]
+#    1. {Accessing matrix elements}[link:rdoc/matrix_rdoc.html#2.1]
+#    1. {Initializing matrix elements}[link:rdoc/matrix_rdoc.html#2.2]
+#    1. {IO}[link:rdoc/matrix_rdoc.html#2.3]
+#    1. {Matrix views}[link:rdoc/matrix_rdoc.html#2.4]
+#    1. {Creating row and column views}[link:rdoc/matrix_rdoc.html#2.5]
+#    1. {Iterators}[link:rdoc/matrix_rdoc.html#2.6]
+#    1. {Copying matrices}[link:rdoc/matrix_rdoc.html#2.7]
+#    1. {Copying rows and columns}[link:rdoc/matrix_rdoc.html#2.8]
+#    1. {Exchanging rows and columns}[link:rdoc/matrix_rdoc.html#2.9]
+#    1. {Matrix operations}[link:rdoc/matrix_rdoc.html#2.10]
+#    1. {Finding maximum and minimum elements of matrices}[link:rdoc/matrix_rdoc.html#2.11]
+#    1. {Matrix properties}[link:rdoc/matrix_rdoc.html#2.12]
+# 1. {NArray}[link:rdoc/matrix_rdoc.html#3]
+# 1. {Special matrices}[link:rdoc/matrix_rdoc.html#4]
 #
 # == {}[link:index.html"name="1] Class methods
 #
@@ -194,7 +194,7 @@
 #   NOTE: GSL does not provide a matrix copy function that properly copies data
 #   across overlapping memory regions, so watch out if assigning to part of a
 #   Matrix from another part of itself (see <tt>#set</tt> example of
-#   {GSL::Vector}[link:files/rdoc/vector_rdoc.html]).
+#   {GSL::Vector}[link:rdoc/vector_rdoc.html]).
 #
 # ---
 # * GSL::Matrix#get(args)
@@ -1084,10 +1084,10 @@
 #         2 3 4 1 
 #         1 2 3 4 ]
 #
-# {prev}[link:files/rdoc/vector_rdoc.html]
-# {next}[link:files/rdoc/perm_rdoc.html]
+# {prev}[link:rdoc/vector_rdoc.html]
+# {next}[link:rdoc/perm_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #   
 #

data/rdoc/min.rdoc

@@ -6,11 +6,11 @@
 #
 #
 # Contents:
-# 1. {Introduction}[link:files/rdoc/min_rdoc.html#1]
-# 1. {GSL::Min::FMinimizer class}[link:files/rdoc/min_rdoc.html#2]
-# 1. {Iteration}[link:files/rdoc/min_rdoc.html#3]
-# 1. {Stopping Parameters}[link:files/rdoc/min_rdoc.html#4]
-# 1. {Examples}[link:files/rdoc/min_rdoc.html#5]
+# 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]
 #
 # == {}[link:index.html"name="1] Introduction
 #
@@ -41,7 +41,7 @@
 #
 # 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:files/rdoc/function_rdoc.html] class to the minimizer.
+# The function to minimize is given as an instance of the {GSL::Function}[link:rdoc/function_rdoc.html] class to the minimizer.
 #
 #
 # == {}[link:index.html"name="2] GSL::Min::FMinimizer class
@@ -180,10 +180,10 @@
 #               iter, a, b, m, m - m_expected, b - a);
 #      end while status == GSL::CONTINUE and iter < max_iter
 #
-# {prev}[link:files/rdoc/roots_rdoc.html]
-# {next}[link:files/rdoc/multiroot_rdoc.html]
+# {prev}[link:rdoc/roots_rdoc.html]
+# {next}[link:rdoc/multiroot_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/monte.rdoc

@@ -225,10 +225,10 @@
 #      end while (vegas.chisq-1.0).abs > 0.5
 #      display_results("vegas final", result, error)
 #
-# {prev}[link:files/rdoc/ntuple_rdoc.html]
-# {next}[link:files/rdoc/siman_rdoc.html]
+# {prev}[link:rdoc/ntuple_rdoc.html]
+# {next}[link:rdoc/siman_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #

data/rdoc/multimin.rdoc

@@ -11,15 +11,15 @@
 # programs. 
 #
 # Contents:
-# 1. {Overview}[link:files/rdoc/multimin_rdoc.html#1]
-# 1. {Caveats}[link:files/rdoc/multimin_rdoc.html#2]
-# 1. {Initializing the Multidimensional Minimizer}[link:files/rdoc/multimin_rdoc.html#3]
-# 1. {Providing a function to minimize}[link:files/rdoc/multimin_rdoc.html#4]
-# 1. {Iteration}[link:files/rdoc/multimin_rdoc.html#5]
-# 1. {Stopping Criteria}[link:files/rdoc/multimin_rdoc.html#6]
-# 1. {Examples}[link:files/rdoc/multimin_rdoc.html#7]
-#    1. {FdfMinimizer}[link:files/rdoc/multimin_rdoc.html#7.1]
-#    1. {FMinimizer}[link:files/rdoc/multimin_rdoc.html#7.2]
+# 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 
@@ -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:files/rdoc/multiroot_rdoc.html]
-# {next}[link:files/rdoc/fit_rdoc.html]
+# {prev}[link:rdoc/multiroot_rdoc.html]
+# {next}[link:rdoc/fit_rdoc.html]
 #
-# {Reference index}[link:files/rdoc/ref_rdoc.html]
-# {top}[link:files/rdoc/index_rdoc.html]
+# {Reference index}[link:rdoc/ref_rdoc.html]
+# {top}[link:index.html]
 #
 #