[libmath-gsl-perl] 11/13: Refresh 0002-Fixed-spelling-errors-in-man.patch.
gregor herrmann
gregoa at debian.org
Mon Oct 3 22:16:11 UTC 2016
This is an automated email from the git hooks/post-receive script.
gregoa pushed a commit to branch master
in repository libmath-gsl-perl.
commit b563295895ed345c8dcf6b16ceda31594809370d
Author: gregor herrmann <gregoa at debian.org>
Date: Mon Oct 3 23:58:47 2016 +0200
Refresh 0002-Fixed-spelling-errors-in-man.patch.
---
.../0002-Fixed-spelling-errors-in-man.patch | 7823 ++++++++++----------
1 file changed, 3785 insertions(+), 4038 deletions(-)
diff --git a/debian/patches/0002-Fixed-spelling-errors-in-man.patch b/debian/patches/0002-Fixed-spelling-errors-in-man.patch
index b1e416d..c6f09a1 100644
--- a/debian/patches/0002-Fixed-spelling-errors-in-man.patch
+++ b/debian/patches/0002-Fixed-spelling-errors-in-man.patch
@@ -1,297 +1,22 @@
Description: Fixed spelling errors in man
-Forwarded: no
Author: Wolfgang Fütterer <debian at wlf-online.de>
-Last-Update: 2016-03-27
+Reviewed-by: gregor herrmann <gregoa at debian.org>
+Last-Update: 2016-10-03
+Forwarded: https://rt.cpan.org/Ticket/Display.html?id=118244
+Bug: https://rt.cpan.org/Ticket/Display.html?id=118244
----
- lib/Math/GSL.pm | 2 +-
- lib/Math/GSL/BLAS.pm | 54 +++++++++++++++++++--------------------
- lib/Math/GSL/BSpline.pm | 2 +-
- lib/Math/GSL/CBLAS.pm | 2 +-
- lib/Math/GSL/CDF.pm | 2 +-
- lib/Math/GSL/Chebyshev.pm | 2 +-
- lib/Math/GSL/Combination.pm | 2 +-
- lib/Math/GSL/Deriv.pm | 2 +-
- lib/Math/GSL/Eigen.pm | 2 +-
- lib/Math/GSL/FFT.pm | 2 +-
- lib/Math/GSL/Fit.pm | 2 +-
- lib/Math/GSL/Heapsort.pm | 2 +-
- lib/Math/GSL/Histogram2D.pm | 4 +--
- lib/Math/GSL/Integration.pm | 2 +-
- lib/Math/GSL/Linalg.pm | 30 +++++++++++-----------
- lib/Math/GSL/Matrix.pm | 18 ++++++-------
- lib/Math/GSL/MatrixComplex.pm | 2 +-
- lib/Math/GSL/Min.pm | 2 +-
- lib/Math/GSL/Monte.pm | 2 +-
- lib/Math/GSL/Multifit.pm | 2 +-
- lib/Math/GSL/Multimin.pm | 2 +-
- lib/Math/GSL/Multiroots.pm | 2 +-
- lib/Math/GSL/NTuple.pm | 2 +-
- lib/Math/GSL/ODEIV.pm | 2 +-
- lib/Math/GSL/Permutation.pm | 16 ++++++------
- lib/Math/GSL/Poly.pm | 2 +-
- lib/Math/GSL/QRNG.pm | 2 +-
- lib/Math/GSL/RNG.pm | 2 +-
- lib/Math/GSL/Randist.pm | 2 +-
- lib/Math/GSL/SF.pm | 4 +--
- lib/Math/GSL/Siman.pm | 2 +-
- lib/Math/GSL/Sort.pm | 2 +-
- lib/Math/GSL/Spline.pm | 2 +-
- lib/Math/GSL/Statistics.pm | 4 +--
- lib/Math/GSL/Sys.pm | 2 +-
- lib/Math/GSL/Vector.pm | 24 ++++++++---------
- pm/Math/GSL/BLAS.pm.1.11 | 54 +++++++++++++++++++--------------------
- pm/Math/GSL/BLAS.pm.1.12 | 54 +++++++++++++++++++--------------------
- pm/Math/GSL/BLAS.pm.1.13 | 54 +++++++++++++++++++--------------------
- pm/Math/GSL/BLAS.pm.1.14 | 54 +++++++++++++++++++--------------------
- pm/Math/GSL/BLAS.pm.1.15 | 54 +++++++++++++++++++--------------------
- pm/Math/GSL/BLAS.pm.1.16 | 54 +++++++++++++++++++--------------------
- pm/Math/GSL/BSpline.pm.1.11 | 2 +-
- pm/Math/GSL/BSpline.pm.1.12 | 2 +-
- pm/Math/GSL/BSpline.pm.1.13 | 2 +-
- pm/Math/GSL/BSpline.pm.1.14 | 2 +-
- pm/Math/GSL/BSpline.pm.1.15 | 2 +-
- pm/Math/GSL/BSpline.pm.1.16 | 2 +-
- pm/Math/GSL/CBLAS.pm.1.11 | 2 +-
- pm/Math/GSL/CBLAS.pm.1.12 | 2 +-
- pm/Math/GSL/CBLAS.pm.1.13 | 2 +-
- pm/Math/GSL/CBLAS.pm.1.14 | 2 +-
- pm/Math/GSL/CBLAS.pm.1.15 | 2 +-
- pm/Math/GSL/CBLAS.pm.1.16 | 2 +-
- pm/Math/GSL/CDF.pm.1.11 | 2 +-
- pm/Math/GSL/CDF.pm.1.12 | 2 +-
- pm/Math/GSL/CDF.pm.1.13 | 2 +-
- pm/Math/GSL/CDF.pm.1.14 | 2 +-
- pm/Math/GSL/CDF.pm.1.15 | 2 +-
- pm/Math/GSL/CDF.pm.1.16 | 2 +-
- pm/Math/GSL/Chebyshev.pm.1.11 | 2 +-
- pm/Math/GSL/Chebyshev.pm.1.12 | 2 +-
- pm/Math/GSL/Chebyshev.pm.1.13 | 2 +-
- pm/Math/GSL/Chebyshev.pm.1.14 | 2 +-
- pm/Math/GSL/Chebyshev.pm.1.15 | 2 +-
- pm/Math/GSL/Chebyshev.pm.1.16 | 2 +-
- pm/Math/GSL/Combination.pm.1.11 | 2 +-
- pm/Math/GSL/Combination.pm.1.12 | 2 +-
- pm/Math/GSL/Combination.pm.1.13 | 2 +-
- pm/Math/GSL/Combination.pm.1.14 | 2 +-
- pm/Math/GSL/Combination.pm.1.15 | 2 +-
- pm/Math/GSL/Combination.pm.1.16 | 2 +-
- pm/Math/GSL/Deriv.pm.1.11 | 2 +-
- pm/Math/GSL/Deriv.pm.1.12 | 2 +-
- pm/Math/GSL/Deriv.pm.1.13 | 2 +-
- pm/Math/GSL/Deriv.pm.1.14 | 2 +-
- pm/Math/GSL/Deriv.pm.1.15 | 2 +-
- pm/Math/GSL/Deriv.pm.1.16 | 2 +-
- pm/Math/GSL/Eigen.pm.1.11 | 2 +-
- pm/Math/GSL/Eigen.pm.1.12 | 2 +-
- pm/Math/GSL/Eigen.pm.1.13 | 2 +-
- pm/Math/GSL/Eigen.pm.1.14 | 2 +-
- pm/Math/GSL/Eigen.pm.1.15 | 2 +-
- pm/Math/GSL/Eigen.pm.1.16 | 2 +-
- pm/Math/GSL/FFT.pm.1.11 | 2 +-
- pm/Math/GSL/FFT.pm.1.12 | 2 +-
- pm/Math/GSL/FFT.pm.1.13 | 2 +-
- pm/Math/GSL/FFT.pm.1.14 | 2 +-
- pm/Math/GSL/FFT.pm.1.15 | 2 +-
- pm/Math/GSL/FFT.pm.1.16 | 2 +-
- pm/Math/GSL/Fit.pm.1.11 | 2 +-
- pm/Math/GSL/Fit.pm.1.12 | 2 +-
- pm/Math/GSL/Fit.pm.1.13 | 2 +-
- pm/Math/GSL/Fit.pm.1.14 | 2 +-
- pm/Math/GSL/Fit.pm.1.15 | 2 +-
- pm/Math/GSL/Fit.pm.1.16 | 2 +-
- pm/Math/GSL/Heapsort.pm.1.11 | 2 +-
- pm/Math/GSL/Heapsort.pm.1.12 | 2 +-
- pm/Math/GSL/Heapsort.pm.1.13 | 2 +-
- pm/Math/GSL/Heapsort.pm.1.14 | 2 +-
- pm/Math/GSL/Heapsort.pm.1.15 | 2 +-
- pm/Math/GSL/Heapsort.pm.1.16 | 2 +-
- pm/Math/GSL/Histogram2D.pm.1.11 | 4 +--
- pm/Math/GSL/Histogram2D.pm.1.12 | 4 +--
- pm/Math/GSL/Histogram2D.pm.1.13 | 4 +--
- pm/Math/GSL/Histogram2D.pm.1.14 | 4 +--
- pm/Math/GSL/Histogram2D.pm.1.15 | 4 +--
- pm/Math/GSL/Histogram2D.pm.1.16 | 4 +--
- pm/Math/GSL/Integration.pm.1.11 | 2 +-
- pm/Math/GSL/Integration.pm.1.12 | 2 +-
- pm/Math/GSL/Integration.pm.1.13 | 2 +-
- pm/Math/GSL/Integration.pm.1.14 | 2 +-
- pm/Math/GSL/Integration.pm.1.15 | 2 +-
- pm/Math/GSL/Integration.pm.1.16 | 2 +-
- pm/Math/GSL/Linalg.pm.1.11 | 30 +++++++++++-----------
- pm/Math/GSL/Linalg.pm.1.12 | 30 +++++++++++-----------
- pm/Math/GSL/Linalg.pm.1.13 | 30 +++++++++++-----------
- pm/Math/GSL/Linalg.pm.1.14 | 30 +++++++++++-----------
- pm/Math/GSL/Linalg.pm.1.15 | 30 +++++++++++-----------
- pm/Math/GSL/Linalg.pm.1.16 | 30 +++++++++++-----------
- pm/Math/GSL/Matrix.pm.1.11 | 18 ++++++-------
- pm/Math/GSL/Matrix.pm.1.12 | 18 ++++++-------
- pm/Math/GSL/Matrix.pm.1.13 | 18 ++++++-------
- pm/Math/GSL/Matrix.pm.1.14 | 18 ++++++-------
- pm/Math/GSL/Matrix.pm.1.15 | 18 ++++++-------
- pm/Math/GSL/Matrix.pm.1.16 | 18 ++++++-------
- pm/Math/GSL/MatrixComplex.pm.1.11 | 2 +-
- pm/Math/GSL/MatrixComplex.pm.1.12 | 2 +-
- pm/Math/GSL/MatrixComplex.pm.1.13 | 2 +-
- pm/Math/GSL/MatrixComplex.pm.1.14 | 2 +-
- pm/Math/GSL/MatrixComplex.pm.1.15 | 2 +-
- pm/Math/GSL/MatrixComplex.pm.1.16 | 2 +-
- pm/Math/GSL/Min.pm.1.11 | 2 +-
- pm/Math/GSL/Min.pm.1.12 | 2 +-
- pm/Math/GSL/Min.pm.1.13 | 2 +-
- pm/Math/GSL/Min.pm.1.14 | 2 +-
- pm/Math/GSL/Min.pm.1.15 | 2 +-
- pm/Math/GSL/Min.pm.1.16 | 2 +-
- pm/Math/GSL/Monte.pm.1.11 | 2 +-
- pm/Math/GSL/Monte.pm.1.12 | 2 +-
- pm/Math/GSL/Monte.pm.1.13 | 2 +-
- pm/Math/GSL/Monte.pm.1.14 | 2 +-
- pm/Math/GSL/Monte.pm.1.15 | 2 +-
- pm/Math/GSL/Monte.pm.1.16 | 2 +-
- pm/Math/GSL/Multifit.pm.1.11 | 2 +-
- pm/Math/GSL/Multifit.pm.1.12 | 2 +-
- pm/Math/GSL/Multifit.pm.1.13 | 2 +-
- pm/Math/GSL/Multifit.pm.1.14 | 2 +-
- pm/Math/GSL/Multifit.pm.1.15 | 2 +-
- pm/Math/GSL/Multifit.pm.1.16 | 2 +-
- pm/Math/GSL/Multimin.pm.1.11 | 2 +-
- pm/Math/GSL/Multimin.pm.1.12 | 2 +-
- pm/Math/GSL/Multimin.pm.1.13 | 2 +-
- pm/Math/GSL/Multimin.pm.1.14 | 2 +-
- pm/Math/GSL/Multimin.pm.1.15 | 2 +-
- pm/Math/GSL/Multimin.pm.1.16 | 2 +-
- pm/Math/GSL/Multiroots.pm.1.11 | 2 +-
- pm/Math/GSL/Multiroots.pm.1.12 | 2 +-
- pm/Math/GSL/Multiroots.pm.1.13 | 2 +-
- pm/Math/GSL/Multiroots.pm.1.14 | 2 +-
- pm/Math/GSL/Multiroots.pm.1.15 | 2 +-
- pm/Math/GSL/Multiroots.pm.1.16 | 2 +-
- pm/Math/GSL/NTuple.pm.1.11 | 2 +-
- pm/Math/GSL/NTuple.pm.1.12 | 2 +-
- pm/Math/GSL/NTuple.pm.1.13 | 2 +-
- pm/Math/GSL/NTuple.pm.1.14 | 2 +-
- pm/Math/GSL/NTuple.pm.1.15 | 2 +-
- pm/Math/GSL/NTuple.pm.1.16 | 2 +-
- pm/Math/GSL/ODEIV.pm.1.11 | 2 +-
- pm/Math/GSL/ODEIV.pm.1.12 | 2 +-
- pm/Math/GSL/ODEIV.pm.1.13 | 2 +-
- pm/Math/GSL/ODEIV.pm.1.14 | 2 +-
- pm/Math/GSL/ODEIV.pm.1.15 | 2 +-
- pm/Math/GSL/ODEIV.pm.1.16 | 2 +-
- pm/Math/GSL/Permutation.pm.1.11 | 16 ++++++------
- pm/Math/GSL/Permutation.pm.1.12 | 16 ++++++------
- pm/Math/GSL/Permutation.pm.1.13 | 16 ++++++------
- pm/Math/GSL/Permutation.pm.1.14 | 16 ++++++------
- pm/Math/GSL/Permutation.pm.1.15 | 16 ++++++------
- pm/Math/GSL/Permutation.pm.1.16 | 16 ++++++------
- pm/Math/GSL/Poly.pm.1.11 | 2 +-
- pm/Math/GSL/Poly.pm.1.12 | 2 +-
- pm/Math/GSL/Poly.pm.1.13 | 2 +-
- pm/Math/GSL/Poly.pm.1.14 | 2 +-
- pm/Math/GSL/Poly.pm.1.15 | 2 +-
- pm/Math/GSL/Poly.pm.1.16 | 2 +-
- pm/Math/GSL/QRNG.pm.1.11 | 2 +-
- pm/Math/GSL/QRNG.pm.1.12 | 2 +-
- pm/Math/GSL/QRNG.pm.1.13 | 2 +-
- pm/Math/GSL/QRNG.pm.1.14 | 2 +-
- pm/Math/GSL/QRNG.pm.1.15 | 2 +-
- pm/Math/GSL/QRNG.pm.1.16 | 2 +-
- pm/Math/GSL/RNG.pm.1.11 | 2 +-
- pm/Math/GSL/RNG.pm.1.12 | 2 +-
- pm/Math/GSL/RNG.pm.1.13 | 2 +-
- pm/Math/GSL/RNG.pm.1.14 | 2 +-
- pm/Math/GSL/RNG.pm.1.15 | 2 +-
- pm/Math/GSL/RNG.pm.1.16 | 2 +-
- pm/Math/GSL/Randist.pm.1.11 | 2 +-
- pm/Math/GSL/Randist.pm.1.12 | 2 +-
- pm/Math/GSL/Randist.pm.1.13 | 2 +-
- pm/Math/GSL/Randist.pm.1.14 | 2 +-
- pm/Math/GSL/Randist.pm.1.15 | 2 +-
- pm/Math/GSL/Randist.pm.1.16 | 2 +-
- pm/Math/GSL/SF.pm.1.11 | 4 +--
- pm/Math/GSL/SF.pm.1.12 | 4 +--
- pm/Math/GSL/SF.pm.1.13 | 4 +--
- pm/Math/GSL/SF.pm.1.14 | 4 +--
- pm/Math/GSL/SF.pm.1.15 | 4 +--
- pm/Math/GSL/SF.pm.1.16 | 4 +--
- pm/Math/GSL/Siman.pm.1.11 | 2 +-
- pm/Math/GSL/Siman.pm.1.12 | 2 +-
- pm/Math/GSL/Siman.pm.1.13 | 2 +-
- pm/Math/GSL/Siman.pm.1.14 | 2 +-
- pm/Math/GSL/Siman.pm.1.15 | 2 +-
- pm/Math/GSL/Siman.pm.1.16 | 2 +-
- pm/Math/GSL/Sort.pm.1.11 | 2 +-
- pm/Math/GSL/Sort.pm.1.12 | 2 +-
- pm/Math/GSL/Sort.pm.1.13 | 2 +-
- pm/Math/GSL/Sort.pm.1.14 | 2 +-
- pm/Math/GSL/Sort.pm.1.15 | 2 +-
- pm/Math/GSL/Sort.pm.1.16 | 2 +-
- pm/Math/GSL/Spline.pm.1.11 | 2 +-
- pm/Math/GSL/Spline.pm.1.12 | 2 +-
- pm/Math/GSL/Spline.pm.1.13 | 2 +-
- pm/Math/GSL/Spline.pm.1.14 | 2 +-
- pm/Math/GSL/Spline.pm.1.15 | 2 +-
- pm/Math/GSL/Spline.pm.1.16 | 2 +-
- pm/Math/GSL/Statistics.pm.1.11 | 4 +--
- pm/Math/GSL/Statistics.pm.1.12 | 4 +--
- pm/Math/GSL/Statistics.pm.1.13 | 4 +--
- pm/Math/GSL/Statistics.pm.1.14 | 4 +--
- pm/Math/GSL/Statistics.pm.1.15 | 4 +--
- pm/Math/GSL/Statistics.pm.1.16 | 4 +--
- pm/Math/GSL/Sys.pm.1.11 | 2 +-
- pm/Math/GSL/Sys.pm.1.12 | 2 +-
- pm/Math/GSL/Sys.pm.1.13 | 2 +-
- pm/Math/GSL/Sys.pm.1.14 | 2 +-
- pm/Math/GSL/Sys.pm.1.15 | 2 +-
- pm/Math/GSL/Sys.pm.1.16 | 2 +-
- pm/Math/GSL/Vector.pm.1.11 | 24 ++++++++---------
- pm/Math/GSL/Vector.pm.1.12 | 24 ++++++++---------
- pm/Math/GSL/Vector.pm.1.13 | 24 ++++++++---------
- pm/Math/GSL/Vector.pm.1.14 | 24 ++++++++---------
- pm/Math/GSL/Vector.pm.1.15 | 24 ++++++++---------
- pm/Math/GSL/Vector.pm.1.16 | 24 ++++++++---------
- pod/BLAS.pod | 54 +++++++++++++++++++--------------------
- pod/BSpline.pod | 2 +-
- pod/CBLAS.pod | 2 +-
- pod/CDF.pod | 2 +-
- pod/Chebyshev.pod | 2 +-
- pod/Combination.pod | 2 +-
- pod/Deriv.pod | 2 +-
- pod/Eigen.pod | 2 +-
- pod/FFT.pod | 2 +-
- pod/Fit.pod | 2 +-
- pod/Heapsort.pod | 2 +-
- pod/Histogram2D.pod | 4 +--
- pod/Integration.pod | 2 +-
- pod/Linalg.pod | 30 +++++++++++-----------
- pod/Matrix.pod | 18 ++++++-------
- pod/MatrixComplex.pod | 2 +-
- pod/Min.pod | 2 +-
- pod/Monte.pod | 2 +-
- pod/Multifit.pod | 2 +-
- pod/Multimin.pod | 2 +-
- pod/Multiroots.pod | 2 +-
- pod/NTuple.pod | 2 +-
- pod/ODEIV.pod | 2 +-
- pod/Permutation.pod | 16 ++++++------
- pod/Poly.pod | 2 +-
- pod/QRNG.pod | 2 +-
- pod/RNG.pod | 2 +-
- pod/Randist.pod | 2 +-
- pod/SF.pod | 4 +--
- pod/Siman.pod | 2 +-
- pod/Sort.pod | 2 +-
- pod/Spline.pod | 2 +-
- pod/Statistics.pod | 4 +--
- pod/Sys.pod | 2 +-
- pod/Vector.pod | 24 ++++++++---------
- 281 files changed, 833 insertions(+), 833 deletions(-)
-
-diff --git a/lib/Math/GSL.pm b/lib/Math/GSL.pm
-index 9cee4fe..06721df 100644
--- a/lib/Math/GSL.pm
+++ b/lib/Math/GSL.pm
-@@ -153,7 +153,7 @@ L<Math::GSL::Statistics> - Statistics Functions
+@@ -63,7 +63,7 @@ Each GSL subsystem has its own module. F
+ subsystem is Math::GSL::RNG. Many subsystems have a more Perlish and
+ object-oriented frontend which can be used, as the above example shows. The raw
+ GSL object is useful for using the low-level GSL functions, which in the case of
+-the Matrix subsytem, would be of the form gsl_matrix_* . Each module has further
++the Matrix subsystem, would be of the form gsl_matrix_* . Each module has further
+ documentation about the low-level C functions as well as using the more
+ intuitive (but slightly slower) object-oriented interface.
+
+@@ -153,7 +153,7 @@ L<Math::GSL::Statistics> - Statisti
L<Math::GSL::Sum> - Summation
@@ -300,11 +25,9 @@ index 9cee4fe..06721df 100644
L<Math::GSL::Vector> - N-dimensional Vectors
-diff --git a/lib/Math/GSL/BLAS.pm b/lib/Math/GSL/BLAS.pm
-index f581498..2c1133d 100644
--- a/lib/Math/GSL/BLAS.pm
+++ b/lib/Math/GSL/BLAS.pm
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
+@@ -308,7 +308,7 @@ The functions of this module are divised
=item C<gsl_blas_ddot($x, $y)>
This function computes the scalar product x^T y for the vectors $x and $y. The
@@ -313,7 +36,7 @@ index f581498..2c1133d 100644
otherwise and the second value is the result of the computation.
=item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
This function computes the complex scalar product x^T y for the complex vectors
$x and $y, returning the result in the complex number $dotu. The function
@@ -329,7 +52,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_snrm2>
=item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
=item C<gsl_blas_dswap($x, $y)>
@@ -343,7 +66,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_daxpy($alpha, $x, $y)>
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
=item C<gsl_blas_strsv>
@@ -358,7 +81,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_cgemv >
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
=item C<gsl_blas_dsymv>
@@ -370,7 +93,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
=item C<gsl_blas_zhemv >
@@ -384,7 +107,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
=item C<gsl_blas_strsm>
@@ -408,7 +131,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_cgemm>
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
=item C<gsl_blas_ctrsm>
@@ -432,7 +155,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_chemm>
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
=item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
@@ -444,7 +167,15 @@ index f581498..2c1133d 100644
=back
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over 3
+
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
=back
@@ -453,11 +184,9 @@ index f581498..2c1133d 100644
=head1 AUTHORS
-diff --git a/lib/Math/GSL/BSpline.pm b/lib/Math/GSL/BSpline.pm
-index 70c1828..3fd15eb 100644
--- a/lib/Math/GSL/BSpline.pm
+++ b/lib/Math/GSL/BSpline.pm
-@@ -241,7 +241,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
+@@ -388,7 +388,7 @@ gsl_bspline_ncoeffs. It is far more effi
functions at once than to compute them individually, due to the nature of the
defining recurrence relation.
@@ -466,11 +195,9 @@ index 70c1828..3fd15eb 100644
http://www.gnu.org/software/gsl/manual/html_node/
=back
-diff --git a/lib/Math/GSL/CBLAS.pm b/lib/Math/GSL/CBLAS.pm
-index ea3d7e2..d2b5553 100644
--- a/lib/Math/GSL/CBLAS.pm
+++ b/lib/Math/GSL/CBLAS.pm
-@@ -704,7 +704,7 @@ This module also contains the following constants :
+@@ -746,7 +746,7 @@ This module also contains the following
=back
@@ -479,11 +206,9 @@ index ea3d7e2..d2b5553 100644
-diff --git a/lib/Math/GSL/CDF.pm b/lib/Math/GSL/CDF.pm
-index 8286f92..227e281 100644
--- a/lib/Math/GSL/CDF.pm
+++ b/lib/Math/GSL/CDF.pm
-@@ -516,7 +516,7 @@ This is the list of available import tags:
+@@ -558,7 +558,7 @@ This is the list of available import tag
For example the beta tag contains theses functions : gsl_cdf_beta_P,
gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
@@ -492,11 +217,9 @@ index 8286f92..227e281 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Chebyshev.pm b/lib/Math/GSL/Chebyshev.pm
-index 910e9db..6b83fd7 100644
--- a/lib/Math/GSL/Chebyshev.pm
+++ b/lib/Math/GSL/Chebyshev.pm
-@@ -364,7 +364,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
=back
@@ -505,11 +228,9 @@ index 910e9db..6b83fd7 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/Combination.pm b/lib/Math/GSL/Combination.pm
-index b5e7fc5..3fb52cf 100644
--- a/lib/Math/GSL/Combination.pm
+++ b/lib/Math/GSL/Combination.pm
-@@ -325,7 +325,7 @@ sub prev {
+@@ -369,7 +369,7 @@ sub prev {
=head1 MORE INFO
@@ -518,11 +239,9 @@ index b5e7fc5..3fb52cf 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Deriv.pm b/lib/Math/GSL/Deriv.pm
-index 694ec6a..1744f54 100644
--- a/lib/Math/GSL/Deriv.pm
+++ b/lib/Math/GSL/Deriv.pm
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
=back
@@ -531,11 +250,9 @@ index 694ec6a..1744f54 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/Eigen.pm b/lib/Math/GSL/Eigen.pm
-index 6798161..0c2346d 100644
--- a/lib/Math/GSL/Eigen.pm
+++ b/lib/Math/GSL/Eigen.pm
-@@ -1048,7 +1048,7 @@ This module also includes these constants :
+@@ -1090,7 +1090,7 @@ This module also includes these constant
=back
@@ -544,11 +261,9 @@ index 6798161..0c2346d 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/FFT.pm b/lib/Math/GSL/FFT.pm
-index be52e40..53c5f45 100644
--- a/lib/Math/GSL/FFT.pm
+++ b/lib/Math/GSL/FFT.pm
-@@ -943,7 +943,7 @@ This module also includes the following constants :
+@@ -985,7 +985,7 @@ This module also includes the following
=back
@@ -557,11 +272,9 @@ index be52e40..53c5f45 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Fit.pm b/lib/Math/GSL/Fit.pm
-index af3bfbd..b63517c 100644
--- a/lib/Math/GSL/Fit.pm
+++ b/lib/Math/GSL/Fit.pm
-@@ -169,7 +169,7 @@ and y_err.
+@@ -211,7 +211,7 @@ and y_err.
=back
@@ -570,11 +283,9 @@ index af3bfbd..b63517c 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Heapsort.pm b/lib/Math/GSL/Heapsort.pm
-index 4b22a54..aa216d2 100644
--- a/lib/Math/GSL/Heapsort.pm
+++ b/lib/Math/GSL/Heapsort.pm
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
=back
@@ -583,11 +294,9 @@ index 4b22a54..aa216d2 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Histogram2D.pm b/lib/Math/GSL/Histogram2D.pm
-index 7365740..93a1d0c 100644
--- a/lib/Math/GSL/Histogram2D.pm
+++ b/lib/Math/GSL/Histogram2D.pm
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
=item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
@@ -601,11 +310,9 @@ index 7365740..93a1d0c 100644
=item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
-diff --git a/lib/Math/GSL/Integration.pm b/lib/Math/GSL/Integration.pm
-index 9d829b5..7f447b0 100644
--- a/lib/Math/GSL/Integration.pm
+++ b/lib/Math/GSL/Integration.pm
-@@ -781,7 +781,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
=head1 MORE INFO
@@ -614,11 +321,9 @@ index 9d829b5..7f447b0 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/Linalg.pm b/lib/Math/GSL/Linalg.pm
-index 59f29f8..7d6fe33 100644
--- a/lib/Math/GSL/Linalg.pm
+++ b/lib/Math/GSL/Linalg.pm
-@@ -551,7 +551,7 @@ Here is a list of all the functions included in this module :
+@@ -634,7 +634,7 @@ Here is a list of all the functions incl
=item gsl_linalg_complex_householder_transform
@@ -627,7 +332,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-@@ -565,7 +565,7 @@ Here is a list of all the functions included in this module :
+@@ -656,7 +656,7 @@ Performs a Givens rotation on the $i and
=item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
@@ -636,7 +341,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
-@@ -589,9 +589,9 @@ Here is a list of all the functions included in this module :
+@@ -680,9 +680,9 @@ Performs a Givens rotation on the $i and
=item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
@@ -648,7 +353,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-@@ -625,27 +625,27 @@ Here is a list of all the functions included in this module :
+@@ -716,27 +716,27 @@ Performs a Givens rotation on the $i and
=item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
@@ -686,20 +391,30 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
-@@ -758,7 +758,7 @@ Here is a list of all the functions included in this module :
+@@ -847,9 +847,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=back
-diff --git a/lib/Math/GSL/Matrix.pm b/lib/Math/GSL/Matrix.pm
-index 3c27f4d..7d884ef 100644
--- a/lib/Math/GSL/Matrix.pm
+++ b/lib/Math/GSL/Matrix.pm
-@@ -2369,11 +2369,11 @@ Here is a list of all the functions included in this module :
+@@ -1473,7 +1473,7 @@ Math::GSL::Matrix - Mathematical functio
+
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2419,11 +2419,11 @@ Here is a list of all the functions incl
=item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
@@ -714,7 +429,7 @@ index 3c27f4d..7d884ef 100644
=item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
-@@ -2393,7 +2393,7 @@ Here is a list of all the functions included in this module :
+@@ -2443,7 +2443,7 @@ Here is a list of all the functions incl
=item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
@@ -723,7 +438,7 @@ index 3c27f4d..7d884ef 100644
=item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
-@@ -2413,13 +2413,13 @@ Here is a list of all the functions included in this module :
+@@ -2463,13 +2463,13 @@ Here is a list of all the functions incl
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
@@ -741,7 +456,18 @@ index 3c27f4d..7d884ef 100644
=back
-@@ -2721,7 +2721,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+@@ -2754,8 +2754,8 @@ sure if anyone wants these. Please speak
+ =back
+
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over 1
+
+@@ -2771,7 +2771,7 @@ Other tags are also avaible, here is a c
=back
@@ -750,11 +476,9 @@ index 3c27f4d..7d884ef 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/MatrixComplex.pm b/lib/Math/GSL/MatrixComplex.pm
-index 8e82f89..72ff7b2 100644
--- a/lib/Math/GSL/MatrixComplex.pm
+++ b/lib/Math/GSL/MatrixComplex.pm
-@@ -1232,7 +1232,7 @@ sub lndet($)
+@@ -1276,7 +1276,7 @@ sub lndet($)
=back
@@ -763,11 +487,9 @@ index 8e82f89..72ff7b2 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Min.pm b/lib/Math/GSL/Min.pm
-index f5d5d80..9831305 100644
--- a/lib/Math/GSL/Min.pm
+++ b/lib/Math/GSL/Min.pm
-@@ -441,7 +441,7 @@ This module also includes the following constants :
+@@ -483,7 +483,7 @@ This module also includes the following
=back
@@ -776,11 +498,9 @@ index f5d5d80..9831305 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/Monte.pm b/lib/Math/GSL/Monte.pm
-index a147ea9..4ccd404 100644
--- a/lib/Math/GSL/Monte.pm
+++ b/lib/Math/GSL/Monte.pm
-@@ -559,7 +559,7 @@ This module also includes the following constants :
+@@ -559,7 +559,7 @@ This module also includes the following
=back
@@ -789,11 +509,9 @@ index a147ea9..4ccd404 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/Multifit.pm b/lib/Math/GSL/Multifit.pm
-index ef25e4f..f191b78 100644
--- a/lib/Math/GSL/Multifit.pm
+++ b/lib/Math/GSL/Multifit.pm
-@@ -772,7 +772,7 @@ The following functions are not yet implemented. Patches Welcome!
+@@ -1146,7 +1146,7 @@ The following functions are not yet impl
=back
@@ -802,11 +520,9 @@ index ef25e4f..f191b78 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Multimin.pm b/lib/Math/GSL/Multimin.pm
-index dbb0c06..805695e 100644
--- a/lib/Math/GSL/Multimin.pm
+++ b/lib/Math/GSL/Multimin.pm
-@@ -516,7 +516,7 @@ This module also includes the following constants :
+@@ -558,7 +558,7 @@ This module also includes the following
=back
@@ -815,11 +531,9 @@ index dbb0c06..805695e 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Multiroots.pm b/lib/Math/GSL/Multiroots.pm
-index f172322..2fe07f3 100644
--- a/lib/Math/GSL/Multiroots.pm
+++ b/lib/Math/GSL/Multiroots.pm
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -828,11 +542,9 @@ index f172322..2fe07f3 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/NTuple.pm b/lib/Math/GSL/NTuple.pm
-index dc8e0e5..55be67e 100644
--- a/lib/Math/GSL/NTuple.pm
+++ b/lib/Math/GSL/NTuple.pm
-@@ -407,7 +407,7 @@ memory.
+@@ -449,7 +449,7 @@ memory.
=back
@@ -841,11 +553,9 @@ index dc8e0e5..55be67e 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/ODEIV.pm b/lib/Math/GSL/ODEIV.pm
-index 10ec745..edcbfbd 100644
--- a/lib/Math/GSL/ODEIV.pm
+++ b/lib/Math/GSL/ODEIV.pm
-@@ -554,7 +554,7 @@ This module also includes the following constants :
+@@ -596,7 +596,7 @@ This module also includes the following
=back
@@ -854,11 +564,9 @@ index 10ec745..edcbfbd 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Permutation.pm b/lib/Math/GSL/Permutation.pm
-index 5f71f96..9e8010b 100644
--- a/lib/Math/GSL/Permutation.pm
+++ b/lib/Math/GSL/Permutation.pm
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
use Math::GSL::Permutation qw/:all/;
my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
@@ -867,7 +575,7 @@ index 5f71f96..9e8010b 100644
gsl_permutation_swap($permutation->raw, 2,7);
# the raw method is made to use the underlying permutation structure of the permutation object
my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
=item gsl_permutation_free($p) - free all the memory use by the permutaion $p
@@ -876,7 +584,7 @@ index 5f71f96..9e8010b 100644
=item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
=item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
@@ -885,7 +593,7 @@ index 5f71f96..9e8010b 100644
=item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
=item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
@@ -903,20 +611,22 @@ index 5f71f96..9e8010b 100644
=item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
+ =back
+
You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Poly.pm b/lib/Math/GSL/Poly.pm
-index f3d9d07..5c17c45 100644
--- a/lib/Math/GSL/Poly.pm
+++ b/lib/Math/GSL/Poly.pm
-@@ -387,7 +387,7 @@ This function frees all the memory associated with the workspace $w.
+@@ -429,7 +429,7 @@ This function frees all the memory assoc
=back
@@ -925,11 +635,9 @@ index f3d9d07..5c17c45 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/QRNG.pm b/lib/Math/GSL/QRNG.pm
-index 69cc7db..f636132 100644
--- a/lib/Math/GSL/QRNG.pm
+++ b/lib/Math/GSL/QRNG.pm
-@@ -349,7 +349,7 @@ This module also contains the following constants :
+@@ -391,7 +391,7 @@ This module also contains the following
=back
@@ -938,11 +646,18 @@ index 69cc7db..f636132 100644
-diff --git a/lib/Math/GSL/RNG.pm b/lib/Math/GSL/RNG.pm
-index 6bcd38b..5fc1964 100644
--- a/lib/Math/GSL/RNG.pm
+++ b/lib/Math/GSL/RNG.pm
-@@ -886,7 +886,7 @@ __END__
+@@ -750,7 +750,7 @@ __END__
+
+ =item gsl_rng_uniform_pos($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 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.
+
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
+
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
+
+@@ -928,7 +928,7 @@ __END__
=back
@@ -951,11 +666,20 @@ index 6bcd38b..5fc1964 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Randist.pm b/lib/Math/GSL/Randist.pm
-index b97a8f4..522acdc 100644
--- a/lib/Math/GSL/Randist.pm
+++ b/lib/Math/GSL/Randist.pm
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+@@ -997,8 +997,8 @@ De-allocates the gsl_ran_discrete pointe
+ =back
+
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
+
+ =over
+
+@@ -1082,7 +1082,7 @@ De-allocates the gsl_ran_discrete pointe
For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
@@ -964,11 +688,9 @@ index b97a8f4..522acdc 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/SF.pm b/lib/Math/GSL/SF.pm
-index 0441f70..0ba8a98 100644
--- a/lib/Math/GSL/SF.pm
+++ b/lib/Math/GSL/SF.pm
-@@ -2357,7 +2357,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+@@ -2407,7 +2407,7 @@ These functions compute the incomplete e
=over
@@ -977,7 +699,16 @@ index 0441f70..0ba8a98 100644
=item C<gsl_sf_erfc_e($x, $result)>
-@@ -3885,7 +3885,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -3883,7 +3883,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
+
+@@ -3935,7 +3935,7 @@ This module also contains the following
=back
@@ -986,11 +717,9 @@ index 0441f70..0ba8a98 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Siman.pm b/lib/Math/GSL/Siman.pm
-index 5e4dc1c..4dffca0 100644
--- a/lib/Math/GSL/Siman.pm
+++ b/lib/Math/GSL/Siman.pm
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
=back
@@ -999,11 +728,9 @@ index 5e4dc1c..4dffca0 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Sort.pm b/lib/Math/GSL/Sort.pm
-index a1c9564..8dcebda 100644
--- a/lib/Math/GSL/Sort.pm
+++ b/lib/Math/GSL/Sort.pm
-@@ -286,7 +286,7 @@ should be removed in further versions.
+@@ -331,7 +331,7 @@ should be removed in further versions.
=back
@@ -1012,11 +739,9 @@ index a1c9564..8dcebda 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 PERFORMANCE
-diff --git a/lib/Math/GSL/Spline.pm b/lib/Math/GSL/Spline.pm
-index 7915b03..44de917 100644
--- a/lib/Math/GSL/Spline.pm
+++ b/lib/Math/GSL/Spline.pm
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
=back
@@ -1025,11 +750,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Statistics.pm b/lib/Math/GSL/Statistics.pm
-index 5e6685b..76f1ddb 100644
--- a/lib/Math/GSL/Statistics.pm
+++ b/lib/Math/GSL/Statistics.pm
-@@ -364,7 +364,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
+@@ -408,7 +408,7 @@ These functions return the total sum of
=item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
@@ -1038,7 +761,18 @@ index 5e6685b..76f1ddb 100644
=item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-@@ -558,7 +558,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+@@ -589,8 +589,8 @@ The following function are simply varian
+ =back
+
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over
+
+@@ -602,7 +602,7 @@ Other tags are also avaible, here is a c
=back
@@ -1047,11 +781,9 @@ index 5e6685b..76f1ddb 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/lib/Math/GSL/Sys.pm b/lib/Math/GSL/Sys.pm
-index 0fdd86f..8a12e35 100644
--- a/lib/Math/GSL/Sys.pm
+++ b/lib/Math/GSL/Sys.pm
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -1060,11 +792,9 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/lib/Math/GSL/Vector.pm b/lib/Math/GSL/Vector.pm
-index b570be6..1dd9343 100644
--- a/lib/Math/GSL/Vector.pm
+++ b/lib/Math/GSL/Vector.pm
-@@ -1234,7 +1234,7 @@ set all the elements of $v to $x
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
=item C<gsl_vector_set_basis($v, $i)>
set all the elements of $v to 0 except for the $i-th element which is set to 1
@@ -1073,7 +803,7 @@ index b570be6..1dd9343 100644
=item C<gsl_vector_fread($file, $v)>
-@@ -1271,23 +1271,23 @@ success and 1 if there was a problem writing to the file.
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
=item C<gsl_vector_memcpy($dest, $src)>
This function copies the elements of the vector $src into the vector $dest and
@@ -1101,7 +831,7 @@ index b570be6..1dd9343 100644
=item C<gsl_vector_max($v)>
-@@ -1318,32 +1318,32 @@ $v and the second is the position of the maximum value.
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
=item C<gsl_vector_add($v, $v2)>
add the elements of $v2 to the elements of $v, the two vectors must have the
@@ -1110,8 +840,9 @@ index b570be6..1dd9343 100644
=item C<gsl_vector_sub($v, $v2)>
- substract the elements of $v2 from the elements of $v, the two vectors must
+-substract the elements of $v2 from the elements of $v, the two vectors must
-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
+have the same length and return 0 if the operation succeeded, 1 otherwise.
=item C<gsl_vector_mul($v, $v2)>
@@ -1140,7 +871,7 @@ index b570be6..1dd9343 100644
=item C<gsl_vector_isnull($v)>
-@@ -1380,7 +1380,7 @@ leaving the odd elements untouched :
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
=back
@@ -1149,11 +880,9 @@ index b570be6..1dd9343 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 EXAMPLES
-diff --git a/pm/Math/GSL/BLAS.pm.1.11 b/pm/Math/GSL/BLAS.pm.1.11
-index f581498..2c1133d 100644
---- a/pm/Math/GSL/BLAS.pm.1.11
-+++ b/pm/Math/GSL/BLAS.pm.1.11
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
+--- a/pm/Math/GSL/BLAS.pm.1.15
++++ b/pm/Math/GSL/BLAS.pm.1.15
+@@ -308,7 +308,7 @@ The functions of this module are divised
=item C<gsl_blas_ddot($x, $y)>
This function computes the scalar product x^T y for the vectors $x and $y. The
@@ -1162,7 +891,7 @@ index f581498..2c1133d 100644
otherwise and the second value is the result of the computation.
=item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
This function computes the complex scalar product x^T y for the complex vectors
$x and $y, returning the result in the complex number $dotu. The function
@@ -1178,7 +907,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_snrm2>
=item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
=item C<gsl_blas_dswap($x, $y)>
@@ -1192,7 +921,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_daxpy($alpha, $x, $y)>
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
=item C<gsl_blas_strsv>
@@ -1207,7 +936,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_cgemv >
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
=item C<gsl_blas_dsymv>
@@ -1219,7 +948,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
=item C<gsl_blas_zhemv >
@@ -1233,7 +962,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
=item C<gsl_blas_strsm>
@@ -1257,7 +986,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_cgemm>
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
=item C<gsl_blas_ctrsm>
@@ -1281,7 +1010,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_chemm>
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
=item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
@@ -1293,7 +1022,15 @@ index f581498..2c1133d 100644
=back
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over 3
+
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
=back
@@ -1302,11 +1039,9 @@ index f581498..2c1133d 100644
=head1 AUTHORS
-diff --git a/pm/Math/GSL/BLAS.pm.1.12 b/pm/Math/GSL/BLAS.pm.1.12
-index f581498..2c1133d 100644
---- a/pm/Math/GSL/BLAS.pm.1.12
-+++ b/pm/Math/GSL/BLAS.pm.1.12
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
+--- a/pm/Math/GSL/BLAS.pm.1.16
++++ b/pm/Math/GSL/BLAS.pm.1.16
+@@ -308,7 +308,7 @@ The functions of this module are divised
=item C<gsl_blas_ddot($x, $y)>
This function computes the scalar product x^T y for the vectors $x and $y. The
@@ -1315,7 +1050,7 @@ index f581498..2c1133d 100644
otherwise and the second value is the result of the computation.
=item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
This function computes the complex scalar product x^T y for the complex vectors
$x and $y, returning the result in the complex number $dotu. The function
@@ -1331,7 +1066,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_snrm2>
=item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
=item C<gsl_blas_dswap($x, $y)>
@@ -1345,7 +1080,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_daxpy($alpha, $x, $y)>
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
=item C<gsl_blas_strsv>
@@ -1360,7 +1095,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_cgemv >
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
=item C<gsl_blas_dsymv>
@@ -1372,7 +1107,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
=item C<gsl_blas_zhemv >
@@ -1386,7 +1121,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
=item C<gsl_blas_strsm>
@@ -1410,7 +1145,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_cgemm>
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
=item C<gsl_blas_ctrsm>
@@ -1434,7 +1169,7 @@ index f581498..2c1133d 100644
=item C<gsl_blas_chemm>
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
=item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
@@ -1446,7 +1181,15 @@ index f581498..2c1133d 100644
=back
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over 3
+
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
=back
@@ -1455,857 +1198,692 @@ index f581498..2c1133d 100644
=head1 AUTHORS
-diff --git a/pm/Math/GSL/BLAS.pm.1.13 b/pm/Math/GSL/BLAS.pm.1.13
-index f581498..2c1133d 100644
---- a/pm/Math/GSL/BLAS.pm.1.13
-+++ b/pm/Math/GSL/BLAS.pm.1.13
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
- =item C<gsl_blas_ddot($x, $y)>
+--- a/pm/Math/GSL/BSpline.pm.1.15
++++ b/pm/Math/GSL/BSpline.pm.1.15
+@@ -325,7 +325,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
- This function computes the scalar product x^T y for the vectors $x and $y. The
--function returns two values, the first is 0 if the operation suceeded, 1
-+function returns two values, the first is 0 if the operation succeeded, 1
- otherwise and the second value is the result of the computation.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
- =item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+ =back
+--- a/pm/Math/GSL/BSpline.pm.1.16
++++ b/pm/Math/GSL/BSpline.pm.1.16
+@@ -326,7 +326,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
- This function computes the complex scalar product x^T y for the complex vectors
- $x and $y, returning the result in the complex number $dotu. The function
--returns 0 if the operation suceeded, 1 otherwise.
-+returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
- =item C<gsl_blas_zdotc($x, $y, $dotc)>
+ =back
+--- a/pm/Math/GSL/CBLAS.pm.1.15
++++ b/pm/Math/GSL/CBLAS.pm.1.15
+@@ -746,7 +746,7 @@ This module also contains the following
- This function computes the complex conjugate scalar product x^H y for the
- complex vectors $x and $y, returning the result in the complex number $dotc.
--The function returns 0 if the operation suceeded, 1 otherwise.
-+The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_snrm2>
- =item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_dswap($x, $y)>
--This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_dcopy($x, $y)>
+--- a/pm/Math/GSL/CBLAS.pm.1.16
++++ b/pm/Math/GSL/CBLAS.pm.1.16
+@@ -746,7 +746,7 @@ This module also contains the following
--This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_daxpy($alpha, $x, $y)>
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
- =item C<gsl_blas_strsv>
--=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/CDF.pm.1.15
++++ b/pm/Math/GSL/CDF.pm.1.15
+@@ -558,7 +558,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
--=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
-+=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
-+=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
- =item C<gsl_blas_cgemv >
+--- a/pm/Math/GSL/CDF.pm.1.16
++++ b/pm/Math/GSL/CDF.pm.1.16
+@@ -558,7 +558,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_dsymv>
--=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Chebyshev.pm.1.15
++++ b/pm/Math/GSL/Chebyshev.pm.1.15
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
--=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Chebyshev.pm.1.16
++++ b/pm/Math/GSL/Chebyshev.pm.1.16
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
- =item C<gsl_blas_zhemv >
+ =back
--=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_zgerc>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Combination.pm.1.15
++++ b/pm/Math/GSL/Combination.pm.1.15
+@@ -369,7 +369,7 @@ sub prev {
--=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
-+=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+ =head1 MORE INFO
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
- =item C<gsl_blas_strsm>
+--- a/pm/Math/GSL/Combination.pm.1.16
++++ b/pm/Math/GSL/Combination.pm.1.16
+@@ -369,7 +369,7 @@ sub prev {
--=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+ =head1 MORE INFO
--=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
--=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+--- a/pm/Math/GSL/Deriv.pm.1.15
++++ b/pm/Math/GSL/Deriv.pm.1.15
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
--=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+ =back
--=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_cgemm>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Deriv.pm.1.16
++++ b/pm/Math/GSL/Deriv.pm.1.16
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ =back
- =item C<gsl_blas_ctrsm>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
-+=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Eigen.pm.1.15
++++ b/pm/Math/GSL/Eigen.pm.1.15
+@@ -1090,7 +1090,7 @@ This module also includes these constant
--=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
-+=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
+ =back
--=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
-+=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
--=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+--- a/pm/Math/GSL/Eigen.pm.1.16
++++ b/pm/Math/GSL/Eigen.pm.1.16
+@@ -1090,7 +1090,7 @@ This module also includes these constant
--=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+ =back
- =item C<gsl_blas_chemm>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
- =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+--- a/pm/Math/GSL/FFT.pm.1.15
++++ b/pm/Math/GSL/FFT.pm.1.15
+@@ -985,7 +985,7 @@ This module also includes the following
--=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+ =back
--=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
-+=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/FFT.pm.1.16
++++ b/pm/Math/GSL/FFT.pm.1.16
+@@ -985,7 +985,7 @@ This module also includes the following
=back
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/BLAS.pm.1.14 b/pm/Math/GSL/BLAS.pm.1.14
-index f581498..2c1133d 100644
---- a/pm/Math/GSL/BLAS.pm.1.14
-+++ b/pm/Math/GSL/BLAS.pm.1.14
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
- =item C<gsl_blas_ddot($x, $y)>
+--- a/pm/Math/GSL/Fit.pm.1.15
++++ b/pm/Math/GSL/Fit.pm.1.15
+@@ -211,7 +211,7 @@ and y_err.
- This function computes the scalar product x^T y for the vectors $x and $y. The
--function returns two values, the first is 0 if the operation suceeded, 1
-+function returns two values, the first is 0 if the operation succeeded, 1
- otherwise and the second value is the result of the computation.
+ =back
- =item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- This function computes the complex scalar product x^T y for the complex vectors
- $x and $y, returning the result in the complex number $dotu. The function
--returns 0 if the operation suceeded, 1 otherwise.
-+returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_zdotc($x, $y, $dotc)>
+--- a/pm/Math/GSL/Fit.pm.1.16
++++ b/pm/Math/GSL/Fit.pm.1.16
+@@ -211,7 +211,7 @@ and y_err.
- This function computes the complex conjugate scalar product x^H y for the
- complex vectors $x and $y, returning the result in the complex number $dotc.
--The function returns 0 if the operation suceeded, 1 otherwise.
-+The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_snrm2>
- =item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_dswap($x, $y)>
--This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Heapsort.pm.1.15
++++ b/pm/Math/GSL/Heapsort.pm.1.15
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
- =item C<gsl_blas_dcopy($x, $y)>
+ =back
--This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_daxpy($alpha, $x, $y)>
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+--- a/pm/Math/GSL/Heapsort.pm.1.16
++++ b/pm/Math/GSL/Heapsort.pm.1.16
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
- =item C<gsl_blas_strsv>
+ =back
--=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
-+=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
--=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
-+=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
+--- a/pm/Math/GSL/Histogram2D.pm.1.15
++++ b/pm/Math/GSL/Histogram2D.pm.1.15
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
- =item C<gsl_blas_cgemv >
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
- =item C<gsl_blas_dsymv>
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
--=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
--=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
- =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+--- a/pm/Math/GSL/Histogram2D.pm.1.16
++++ b/pm/Math/GSL/Histogram2D.pm.1.16
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
- =item C<gsl_blas_zhemv >
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
--=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
- =item C<gsl_blas_zgerc>
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
--=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
-+=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+--- a/pm/Math/GSL/Integration.pm.1.15
++++ b/pm/Math/GSL/Integration.pm.1.15
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
- =item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ =head1 MORE INFO
- =item C<gsl_blas_strsm>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Integration.pm.1.16
++++ b/pm/Math/GSL/Integration.pm.1.16
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
--=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+ =head1 MORE INFO
--=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Linalg.pm.1.15
++++ b/pm/Math/GSL/Linalg.pm.1.15
+@@ -594,7 +594,7 @@ Here is a list of all the functions incl
--=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+ =item gsl_linalg_complex_householder_transform
--=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_cgemm>
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -616,7 +616,7 @@ Performs a Givens rotation on the $i and
- =item C<gsl_blas_ctrsm>
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
--=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
-+=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
--=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
-+=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
--=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
-+=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+@@ -640,9 +640,9 @@ Performs a Givens rotation on the $i and
--=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
--=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
--=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
- =item C<gsl_blas_chemm>
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -676,27 +676,27 @@ Performs a Givens rotation on the $i and
- =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
--=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
--=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
-+=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
- =back
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
- =back
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
- =head1 AUTHORS
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/BLAS.pm.1.15 b/pm/Math/GSL/BLAS.pm.1.15
-index f581498..2c1133d 100644
---- a/pm/Math/GSL/BLAS.pm.1.15
-+++ b/pm/Math/GSL/BLAS.pm.1.15
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
- =item C<gsl_blas_ddot($x, $y)>
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
- This function computes the scalar product x^T y for the vectors $x and $y. The
--function returns two values, the first is 0 if the operation suceeded, 1
-+function returns two values, the first is 0 if the operation succeeded, 1
- otherwise and the second value is the result of the computation.
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
- This function computes the complex scalar product x^T y for the complex vectors
- $x and $y, returning the result in the complex number $dotu. The function
--returns 0 if the operation suceeded, 1 otherwise.
-+returns 0 if the operation succeeded, 1 otherwise.
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_zdotc($x, $y, $dotc)>
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
- This function computes the complex conjugate scalar product x^H y for the
- complex vectors $x and $y, returning the result in the complex number $dotc.
--The function returns 0 if the operation suceeded, 1 otherwise.
-+The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -807,9 +807,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
- =item C<gsl_blas_snrm2>
- =item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
- =item C<gsl_blas_dswap($x, $y)>
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
--This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_dcopy($x, $y)>
--This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
+--- a/pm/Math/GSL/Linalg.pm.1.16
++++ b/pm/Math/GSL/Linalg.pm.1.16
+@@ -595,7 +595,7 @@ Here is a list of all the functions incl
- =item C<gsl_blas_daxpy($alpha, $x, $y)>
+ =item gsl_linalg_complex_householder_transform
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_strsv>
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
--=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -617,7 +617,7 @@ Performs a Givens rotation on the $i and
--=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
-+=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
--=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
-+=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
- =item C<gsl_blas_cgemv >
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -641,9 +641,9 @@ Performs a Givens rotation on the $i and
- =item C<gsl_blas_dsymv>
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
--=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
--=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
- =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -677,27 +677,27 @@ Performs a Givens rotation on the $i and
- =item C<gsl_blas_zhemv >
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
--=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
- =item C<gsl_blas_zgerc>
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
-+=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_strsm>
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
- =item C<gsl_blas_cgemm>
+@@ -808,9 +808,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
- =item C<gsl_blas_ctrsm>
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
--=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
-+=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
-+=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
--=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
-+=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+ =back
+--- a/pm/Math/GSL/Matrix.pm.1.15
++++ b/pm/Math/GSL/Matrix.pm.1.15
+@@ -1465,7 +1465,7 @@ Math::GSL::Matrix - Mathematical functio
--=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2411,11 +2411,11 @@ Here is a list of all the functions incl
--=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+ =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
--=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+-=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_chemm>
+-=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+ =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
--=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+@@ -2435,7 +2435,7 @@ Here is a list of all the functions incl
--=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
-+=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+ =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
- =back
+-=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
++=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
- =back
+@@ -2455,13 +2455,13 @@ Here is a list of all the functions incl
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
- =head1 AUTHORS
+-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/BLAS.pm.1.16 b/pm/Math/GSL/BLAS.pm.1.16
-index f581498..2c1133d 100644
---- a/pm/Math/GSL/BLAS.pm.1.16
-+++ b/pm/Math/GSL/BLAS.pm.1.16
-@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
- =item C<gsl_blas_ddot($x, $y)>
+-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
- This function computes the scalar product x^T y for the vectors $x and $y. The
--function returns two values, the first is 0 if the operation suceeded, 1
-+function returns two values, the first is 0 if the operation succeeded, 1
- otherwise and the second value is the result of the computation.
+-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_cdotu>
-@@ -277,13 +277,13 @@ otherwise and the second value is the result of the computation.
+-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
- This function computes the complex scalar product x^T y for the complex vectors
- $x and $y, returning the result in the complex number $dotu. The function
--returns 0 if the operation suceeded, 1 otherwise.
-+returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_zdotc($x, $y, $dotc)>
+@@ -2746,8 +2746,8 @@ sure if anyone wants these. Please speak
+ =back
- This function computes the complex conjugate scalar product x^H y for the
- complex vectors $x and $y, returning the result in the complex number $dotc.
--The function returns 0 if the operation suceeded, 1 otherwise.
-+The function returns 0 if the operation succeeded, 1 otherwise.
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
- =item C<gsl_blas_snrm2>
- =item C<gsl_blas_sasum>
-@@ -328,11 +328,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+ =over 1
- =item C<gsl_blas_dswap($x, $y)>
+@@ -2763,7 +2763,7 @@ Other tags are also avaible, here is a c
--This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_dcopy($x, $y)>
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_daxpy($alpha, $x, $y)>
+--- a/pm/Math/GSL/Matrix.pm.1.16
++++ b/pm/Math/GSL/Matrix.pm.1.16
+@@ -1465,7 +1465,7 @@ Math::GSL::Matrix - Mathematical functio
-@@ -394,11 +394,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2411,11 +2411,11 @@ Here is a list of all the functions incl
- =item C<gsl_blas_strsv>
+ =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
--=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
--=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
-+=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
+-=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
--=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
-+=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
+-=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_cgemv >
+ =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
-@@ -422,9 +422,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -2435,7 +2435,7 @@ Here is a list of all the functions incl
- =item C<gsl_blas_dsymv>
+ =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
--=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
++=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
--=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
- =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+@@ -2455,13 +2455,13 @@ Here is a list of all the functions incl
-@@ -440,11 +440,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
- =item C<gsl_blas_zhemv >
+-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_blas_zgerc>
+-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
-+=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_zher2 >
-@@ -467,17 +467,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -2746,8 +2746,8 @@ sure if anyone wants these. Please speak
+ =back
- =item C<gsl_blas_strsm>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
--=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+ =over 1
--=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -2763,7 +2763,7 @@ Other tags are also avaible, here is a c
--=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+ =back
--=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
--=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+--- a/pm/Math/GSL/MatrixComplex.pm.1.15
++++ b/pm/Math/GSL/MatrixComplex.pm.1.15
+@@ -1274,7 +1274,7 @@ sub lndet($)
- =item C<gsl_blas_cgemm>
+ =back
-@@ -491,17 +491,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_ctrsm>
--=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
-+=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+--- a/pm/Math/GSL/MatrixComplex.pm.1.16
++++ b/pm/Math/GSL/MatrixComplex.pm.1.16
+@@ -1274,7 +1274,7 @@ sub lndet($)
--=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
-+=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
+ =back
--=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
-+=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
--=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+--- a/pm/Math/GSL/Min.pm.1.15
++++ b/pm/Math/GSL/Min.pm.1.15
+@@ -483,7 +483,7 @@ This module also includes the following
--=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+ =back
- =item C<gsl_blas_chemm>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -511,9 +511,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Min.pm.1.16
++++ b/pm/Math/GSL/Min.pm.1.16
+@@ -483,7 +483,7 @@ This module also includes the following
- =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+ =back
--=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
-+=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Monte.pm.1.15
++++ b/pm/Math/GSL/Monte.pm.1.15
+@@ -559,7 +559,7 @@ This module also includes the following
=back
-@@ -531,7 +531,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Monte.pm.1.16
++++ b/pm/Math/GSL/Monte.pm.1.16
+@@ -559,7 +559,7 @@ This module also includes the following
=back
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-
-diff --git a/pm/Math/GSL/BSpline.pm.1.11 b/pm/Math/GSL/BSpline.pm.1.11
-index fdf81fc..8188943 100644
---- a/pm/Math/GSL/BSpline.pm.1.11
-+++ b/pm/Math/GSL/BSpline.pm.1.11
-@@ -192,7 +192,7 @@ gsl_bspline_ncoeffs. 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.
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+--- a/pm/Math/GSL/Multifit.pm.1.15
++++ b/pm/Math/GSL/Multifit.pm.1.15
+@@ -688,7 +688,7 @@ The following functions are not yet impl
=back
-diff --git a/pm/Math/GSL/BSpline.pm.1.12 b/pm/Math/GSL/BSpline.pm.1.12
-index fdf81fc..8188943 100644
---- a/pm/Math/GSL/BSpline.pm.1.12
-+++ b/pm/Math/GSL/BSpline.pm.1.12
-@@ -192,7 +192,7 @@ gsl_bspline_ncoeffs. 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.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
-diff --git a/pm/Math/GSL/BSpline.pm.1.13 b/pm/Math/GSL/BSpline.pm.1.13
-index 42aa608..80ce00c 100644
---- a/pm/Math/GSL/BSpline.pm.1.13
-+++ b/pm/Math/GSL/BSpline.pm.1.13
-@@ -193,7 +193,7 @@ gsl_bspline_ncoeffs. 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.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+--- a/pm/Math/GSL/Multifit.pm.1.16
++++ b/pm/Math/GSL/Multifit.pm.1.16
+@@ -688,7 +688,7 @@ The following functions are not yet impl
=back
-diff --git a/pm/Math/GSL/BSpline.pm.1.14 b/pm/Math/GSL/BSpline.pm.1.14
-index 42aa608..80ce00c 100644
---- a/pm/Math/GSL/BSpline.pm.1.14
-+++ b/pm/Math/GSL/BSpline.pm.1.14
-@@ -193,7 +193,7 @@ gsl_bspline_ncoeffs. 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.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
-diff --git a/pm/Math/GSL/BSpline.pm.1.15 b/pm/Math/GSL/BSpline.pm.1.15
-index 70c1828..3fd15eb 100644
---- a/pm/Math/GSL/BSpline.pm.1.15
-+++ b/pm/Math/GSL/BSpline.pm.1.15
-@@ -241,7 +241,7 @@ gsl_bspline_ncoeffs. 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.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+--- a/pm/Math/GSL/Multimin.pm.1.15
++++ b/pm/Math/GSL/Multimin.pm.1.15
+@@ -558,7 +558,7 @@ This module also includes the following
=back
-diff --git a/pm/Math/GSL/BSpline.pm.1.16 b/pm/Math/GSL/BSpline.pm.1.16
-index 70c1828..3fd15eb 100644
---- a/pm/Math/GSL/BSpline.pm.1.16
-+++ b/pm/Math/GSL/BSpline.pm.1.16
-@@ -241,7 +241,7 @@ gsl_bspline_ncoeffs. 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.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
-diff --git a/pm/Math/GSL/CBLAS.pm.1.11 b/pm/Math/GSL/CBLAS.pm.1.11
-index ea3d7e2..d2b5553 100644
---- a/pm/Math/GSL/CBLAS.pm.1.11
-+++ b/pm/Math/GSL/CBLAS.pm.1.11
-@@ -704,7 +704,7 @@ This module also contains the following constants :
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-
-diff --git a/pm/Math/GSL/CBLAS.pm.1.12 b/pm/Math/GSL/CBLAS.pm.1.12
-index ea3d7e2..d2b5553 100644
---- a/pm/Math/GSL/CBLAS.pm.1.12
-+++ b/pm/Math/GSL/CBLAS.pm.1.12
-@@ -704,7 +704,7 @@ This module also contains the following constants :
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-
-diff --git a/pm/Math/GSL/CBLAS.pm.1.13 b/pm/Math/GSL/CBLAS.pm.1.13
-index ea3d7e2..d2b5553 100644
---- a/pm/Math/GSL/CBLAS.pm.1.13
-+++ b/pm/Math/GSL/CBLAS.pm.1.13
-@@ -704,7 +704,7 @@ This module also contains the following constants :
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-
-diff --git a/pm/Math/GSL/CBLAS.pm.1.14 b/pm/Math/GSL/CBLAS.pm.1.14
-index ea3d7e2..d2b5553 100644
---- a/pm/Math/GSL/CBLAS.pm.1.14
-+++ b/pm/Math/GSL/CBLAS.pm.1.14
-@@ -704,7 +704,7 @@ This module also contains the following constants :
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-
-diff --git a/pm/Math/GSL/CBLAS.pm.1.15 b/pm/Math/GSL/CBLAS.pm.1.15
-index ea3d7e2..d2b5553 100644
---- a/pm/Math/GSL/CBLAS.pm.1.15
-+++ b/pm/Math/GSL/CBLAS.pm.1.15
-@@ -704,7 +704,7 @@ This module also contains the following constants :
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-
-diff --git a/pm/Math/GSL/CBLAS.pm.1.16 b/pm/Math/GSL/CBLAS.pm.1.16
-index ea3d7e2..d2b5553 100644
---- a/pm/Math/GSL/CBLAS.pm.1.16
-+++ b/pm/Math/GSL/CBLAS.pm.1.16
-@@ -704,7 +704,7 @@ This module also contains the following constants :
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-
-diff --git a/pm/Math/GSL/CDF.pm.1.11 b/pm/Math/GSL/CDF.pm.1.11
-index 8286f92..227e281 100644
---- a/pm/Math/GSL/CDF.pm.1.11
-+++ b/pm/Math/GSL/CDF.pm.1.11
-@@ -516,7 +516,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/CDF.pm.1.12 b/pm/Math/GSL/CDF.pm.1.12
-index 8286f92..227e281 100644
---- a/pm/Math/GSL/CDF.pm.1.12
-+++ b/pm/Math/GSL/CDF.pm.1.12
-@@ -516,7 +516,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/CDF.pm.1.13 b/pm/Math/GSL/CDF.pm.1.13
-index 8286f92..227e281 100644
---- a/pm/Math/GSL/CDF.pm.1.13
-+++ b/pm/Math/GSL/CDF.pm.1.13
-@@ -516,7 +516,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/CDF.pm.1.14 b/pm/Math/GSL/CDF.pm.1.14
-index 8286f92..227e281 100644
---- a/pm/Math/GSL/CDF.pm.1.14
-+++ b/pm/Math/GSL/CDF.pm.1.14
-@@ -516,7 +516,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/CDF.pm.1.15 b/pm/Math/GSL/CDF.pm.1.15
-index 8286f92..227e281 100644
---- a/pm/Math/GSL/CDF.pm.1.15
-+++ b/pm/Math/GSL/CDF.pm.1.15
-@@ -516,7 +516,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/CDF.pm.1.16 b/pm/Math/GSL/CDF.pm.1.16
-index 8286f92..227e281 100644
---- a/pm/Math/GSL/CDF.pm.1.16
-+++ b/pm/Math/GSL/CDF.pm.1.16
-@@ -516,7 +516,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/Chebyshev.pm.1.11 b/pm/Math/GSL/Chebyshev.pm.1.11
-index 6346cbb..8c151b2 100644
---- a/pm/Math/GSL/Chebyshev.pm.1.11
-+++ b/pm/Math/GSL/Chebyshev.pm.1.11
-@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+
+--- a/pm/Math/GSL/Multimin.pm.1.16
++++ b/pm/Math/GSL/Multimin.pm.1.16
+@@ -558,7 +558,7 @@ This module also includes the following
=back
@@ -2313,25 +1891,10 @@ index 6346cbb..8c151b2 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Chebyshev.pm.1.12 b/pm/Math/GSL/Chebyshev.pm.1.12
-index 6346cbb..8c151b2 100644
---- a/pm/Math/GSL/Chebyshev.pm.1.12
-+++ b/pm/Math/GSL/Chebyshev.pm.1.12
-@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Chebyshev.pm.1.13 b/pm/Math/GSL/Chebyshev.pm.1.13
-index 6346cbb..8c151b2 100644
---- a/pm/Math/GSL/Chebyshev.pm.1.13
-+++ b/pm/Math/GSL/Chebyshev.pm.1.13
-@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+--- a/pm/Math/GSL/Multiroots.pm.1.15
++++ b/pm/Math/GSL/Multiroots.pm.1.15
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -2340,11 +1903,9 @@ index 6346cbb..8c151b2 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Chebyshev.pm.1.14 b/pm/Math/GSL/Chebyshev.pm.1.14
-index 6346cbb..8c151b2 100644
---- a/pm/Math/GSL/Chebyshev.pm.1.14
-+++ b/pm/Math/GSL/Chebyshev.pm.1.14
-@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+--- a/pm/Math/GSL/Multiroots.pm.1.16
++++ b/pm/Math/GSL/Multiroots.pm.1.16
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -2353,11 +1914,9 @@ index 6346cbb..8c151b2 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Chebyshev.pm.1.15 b/pm/Math/GSL/Chebyshev.pm.1.15
-index 910e9db..6b83fd7 100644
---- a/pm/Math/GSL/Chebyshev.pm.1.15
-+++ b/pm/Math/GSL/Chebyshev.pm.1.15
-@@ -364,7 +364,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+--- a/pm/Math/GSL/NTuple.pm.1.15
++++ b/pm/Math/GSL/NTuple.pm.1.15
+@@ -449,7 +449,7 @@ memory.
=back
@@ -2366,11 +1925,9 @@ index 910e9db..6b83fd7 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Chebyshev.pm.1.16 b/pm/Math/GSL/Chebyshev.pm.1.16
-index 910e9db..6b83fd7 100644
---- a/pm/Math/GSL/Chebyshev.pm.1.16
-+++ b/pm/Math/GSL/Chebyshev.pm.1.16
-@@ -364,7 +364,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+--- a/pm/Math/GSL/NTuple.pm.1.16
++++ b/pm/Math/GSL/NTuple.pm.1.16
+@@ -449,7 +449,7 @@ memory.
=back
@@ -2379,180 +1936,151 @@ index 910e9db..6b83fd7 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Combination.pm.1.11 b/pm/Math/GSL/Combination.pm.1.11
-index b5e7fc5..3fb52cf 100644
---- a/pm/Math/GSL/Combination.pm.1.11
-+++ b/pm/Math/GSL/Combination.pm.1.11
-@@ -325,7 +325,7 @@ sub prev {
+--- a/pm/Math/GSL/ODEIV.pm.1.15
++++ b/pm/Math/GSL/ODEIV.pm.1.15
+@@ -596,7 +596,7 @@ This module also includes the following
- =head1 MORE INFO
+ =back
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Combination.pm.1.12 b/pm/Math/GSL/Combination.pm.1.12
-index b5e7fc5..3fb52cf 100644
---- a/pm/Math/GSL/Combination.pm.1.12
-+++ b/pm/Math/GSL/Combination.pm.1.12
-@@ -325,7 +325,7 @@ sub prev {
+--- a/pm/Math/GSL/ODEIV.pm.1.16
++++ b/pm/Math/GSL/ODEIV.pm.1.16
+@@ -596,7 +596,7 @@ This module also includes the following
- =head1 MORE INFO
+ =back
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Combination.pm.1.13 b/pm/Math/GSL/Combination.pm.1.13
-index b5e7fc5..3fb52cf 100644
---- a/pm/Math/GSL/Combination.pm.1.13
-+++ b/pm/Math/GSL/Combination.pm.1.13
-@@ -325,7 +325,7 @@ sub prev {
-
- =head1 MORE INFO
+--- a/pm/Math/GSL/Permutation.pm.1.15
++++ b/pm/Math/GSL/Permutation.pm.1.15
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
-diff --git a/pm/Math/GSL/Combination.pm.1.14 b/pm/Math/GSL/Combination.pm.1.14
-index b5e7fc5..3fb52cf 100644
---- a/pm/Math/GSL/Combination.pm.1.14
-+++ b/pm/Math/GSL/Combination.pm.1.14
-@@ -325,7 +325,7 @@ sub prev {
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- =head1 MORE INFO
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
-diff --git a/pm/Math/GSL/Combination.pm.1.15 b/pm/Math/GSL/Combination.pm.1.15
-index b5e7fc5..3fb52cf 100644
---- a/pm/Math/GSL/Combination.pm.1.15
-+++ b/pm/Math/GSL/Combination.pm.1.15
-@@ -325,7 +325,7 @@ sub prev {
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =head1 MORE INFO
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
-diff --git a/pm/Math/GSL/Combination.pm.1.16 b/pm/Math/GSL/Combination.pm.1.16
-index b5e7fc5..3fb52cf 100644
---- a/pm/Math/GSL/Combination.pm.1.16
-+++ b/pm/Math/GSL/Combination.pm.1.16
-@@ -325,7 +325,7 @@ sub prev {
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =head1 MORE INFO
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
-diff --git a/pm/Math/GSL/Deriv.pm.1.11 b/pm/Math/GSL/Deriv.pm.1.11
-index 694ec6a..1744f54 100644
---- a/pm/Math/GSL/Deriv.pm.1.11
-+++ b/pm/Math/GSL/Deriv.pm.1.11
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Deriv.pm.1.12 b/pm/Math/GSL/Deriv.pm.1.12
-index 694ec6a..1744f54 100644
---- a/pm/Math/GSL/Deriv.pm.1.12
-+++ b/pm/Math/GSL/Deriv.pm.1.12
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
- =back
+--- a/pm/Math/GSL/Permutation.pm.1.16
++++ b/pm/Math/GSL/Permutation.pm.1.16
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Deriv.pm.1.13 b/pm/Math/GSL/Deriv.pm.1.13
-index 694ec6a..1744f54 100644
---- a/pm/Math/GSL/Deriv.pm.1.13
-+++ b/pm/Math/GSL/Deriv.pm.1.13
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
- =back
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Deriv.pm.1.14 b/pm/Math/GSL/Deriv.pm.1.14
-index 694ec6a..1744f54 100644
---- a/pm/Math/GSL/Deriv.pm.1.14
-+++ b/pm/Math/GSL/Deriv.pm.1.14
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
- =back
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Deriv.pm.1.15 b/pm/Math/GSL/Deriv.pm.1.15
-index 694ec6a..1744f54 100644
---- a/pm/Math/GSL/Deriv.pm.1.15
-+++ b/pm/Math/GSL/Deriv.pm.1.15
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
- =back
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Deriv.pm.1.16 b/pm/Math/GSL/Deriv.pm.1.16
-index 694ec6a..1744f54 100644
---- a/pm/Math/GSL/Deriv.pm.1.16
-+++ b/pm/Math/GSL/Deriv.pm.1.16
-@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =back
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Eigen.pm.1.11 b/pm/Math/GSL/Eigen.pm.1.11
-index b903d09..c682a32 100644
---- a/pm/Math/GSL/Eigen.pm.1.11
-+++ b/pm/Math/GSL/Eigen.pm.1.11
-@@ -1047,7 +1047,7 @@ This module also includes these constants :
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
=back
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Eigen.pm.1.12 b/pm/Math/GSL/Eigen.pm.1.12
-index b903d09..c682a32 100644
---- a/pm/Math/GSL/Eigen.pm.1.12
-+++ b/pm/Math/GSL/Eigen.pm.1.12
-@@ -1047,7 +1047,7 @@ This module also includes these constants :
+--- a/pm/Math/GSL/Poly.pm.1.15
++++ b/pm/Math/GSL/Poly.pm.1.15
+@@ -428,7 +428,7 @@ This function frees all the memory assoc
=back
@@ -2560,12 +2088,10 @@ index b903d09..c682a32 100644
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Eigen.pm.1.13 b/pm/Math/GSL/Eigen.pm.1.13
-index b903d09..c682a32 100644
---- a/pm/Math/GSL/Eigen.pm.1.13
-+++ b/pm/Math/GSL/Eigen.pm.1.13
-@@ -1047,7 +1047,7 @@ This module also includes these constants :
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Poly.pm.1.16
++++ b/pm/Math/GSL/Poly.pm.1.16
+@@ -429,7 +429,7 @@ This function frees all the memory assoc
=back
@@ -2573,103 +2099,134 @@ index b903d09..c682a32 100644
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Eigen.pm.1.14 b/pm/Math/GSL/Eigen.pm.1.14
-index b903d09..c682a32 100644
---- a/pm/Math/GSL/Eigen.pm.1.14
-+++ b/pm/Math/GSL/Eigen.pm.1.14
-@@ -1047,7 +1047,7 @@ This module also includes these constants :
+ =head1 AUTHORS
+--- a/pm/Math/GSL/QRNG.pm.1.15
++++ b/pm/Math/GSL/QRNG.pm.1.15
+@@ -391,7 +391,7 @@ This module also contains the following
=back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+
+--- a/pm/Math/GSL/QRNG.pm.1.16
++++ b/pm/Math/GSL/QRNG.pm.1.16
+@@ -391,7 +391,7 @@ This module also contains the following
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Eigen.pm.1.15 b/pm/Math/GSL/Eigen.pm.1.15
-index 6798161..0c2346d 100644
---- a/pm/Math/GSL/Eigen.pm.1.15
-+++ b/pm/Math/GSL/Eigen.pm.1.15
-@@ -1048,7 +1048,7 @@ This module also includes these constants :
+
+--- a/pm/Math/GSL/RNG.pm.1.15
++++ b/pm/Math/GSL/RNG.pm.1.15
+@@ -750,7 +750,7 @@ __END__
+
+ =item gsl_rng_uniform_pos($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 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.
+
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
+
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
+
+@@ -928,7 +928,7 @@ __END__
=back
-For more informations on the functions, we refer you to the GSL offcial documentation:
+For more information on the functions, we refer you to the GSL offcial documentation:
+
L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/RNG.pm.1.16
++++ b/pm/Math/GSL/RNG.pm.1.16
+@@ -750,7 +750,7 @@ __END__
-diff --git a/pm/Math/GSL/Eigen.pm.1.16 b/pm/Math/GSL/Eigen.pm.1.16
-index 6798161..0c2346d 100644
---- a/pm/Math/GSL/Eigen.pm.1.16
-+++ b/pm/Math/GSL/Eigen.pm.1.16
-@@ -1048,7 +1048,7 @@ This module also includes these constants :
+ =item gsl_rng_uniform_pos($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 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.
+
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
+
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
+
+@@ -928,7 +928,7 @@ __END__
=back
-For more informations on the functions, we refer you to the GSL offcial documentation:
+For more information on the functions, we refer you to the GSL offcial documentation:
+
L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/Randist.pm.1.15
++++ b/pm/Math/GSL/Randist.pm.1.15
+@@ -992,8 +992,8 @@ De-allocates the gsl_ran_discrete pointe
+ =back
-diff --git a/pm/Math/GSL/FFT.pm.1.11 b/pm/Math/GSL/FFT.pm.1.11
-index 83bb55d..b5174d7 100644
---- a/pm/Math/GSL/FFT.pm.1.11
-+++ b/pm/Math/GSL/FFT.pm.1.11
-@@ -942,7 +942,7 @@ This module also includes the following constants :
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
- =back
+ =over
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -1077,7 +1077,7 @@ De-allocates the gsl_ran_discrete pointe
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/FFT.pm.1.12 b/pm/Math/GSL/FFT.pm.1.12
-index 83bb55d..b5174d7 100644
---- a/pm/Math/GSL/FFT.pm.1.12
-+++ b/pm/Math/GSL/FFT.pm.1.12
-@@ -942,7 +942,7 @@ This module also includes the following constants :
+--- a/pm/Math/GSL/Randist.pm.1.16
++++ b/pm/Math/GSL/Randist.pm.1.16
+@@ -992,8 +992,8 @@ De-allocates the gsl_ran_discrete pointe
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
+ =over
-diff --git a/pm/Math/GSL/FFT.pm.1.13 b/pm/Math/GSL/FFT.pm.1.13
-index 83bb55d..b5174d7 100644
---- a/pm/Math/GSL/FFT.pm.1.13
-+++ b/pm/Math/GSL/FFT.pm.1.13
-@@ -942,7 +942,7 @@ This module also includes the following constants :
+@@ -1077,7 +1077,7 @@ De-allocates the gsl_ran_discrete pointe
- =back
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/FFT.pm.1.14 b/pm/Math/GSL/FFT.pm.1.14
-index 83bb55d..b5174d7 100644
---- a/pm/Math/GSL/FFT.pm.1.14
-+++ b/pm/Math/GSL/FFT.pm.1.14
-@@ -942,7 +942,7 @@ This module also includes the following constants :
+--- a/pm/Math/GSL/SF.pm.1.15
++++ b/pm/Math/GSL/SF.pm.1.15
+@@ -2394,7 +2394,7 @@ These functions compute the incomplete e
- =back
+ =over
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+ =item C<gsl_sf_erfc_e($x, $result)>
-diff --git a/pm/Math/GSL/FFT.pm.1.15 b/pm/Math/GSL/FFT.pm.1.15
-index be52e40..53c5f45 100644
---- a/pm/Math/GSL/FFT.pm.1.15
-+++ b/pm/Math/GSL/FFT.pm.1.15
-@@ -943,7 +943,7 @@ This module also includes the following constants :
+@@ -3870,7 +3870,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
+
+@@ -3922,7 +3922,7 @@ This module also contains the following
=back
@@ -2678,11 +2235,27 @@ index be52e40..53c5f45 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/FFT.pm.1.16 b/pm/Math/GSL/FFT.pm.1.16
-index be52e40..53c5f45 100644
---- a/pm/Math/GSL/FFT.pm.1.16
-+++ b/pm/Math/GSL/FFT.pm.1.16
-@@ -943,7 +943,7 @@ This module also includes the following constants :
+--- a/pm/Math/GSL/SF.pm.1.16
++++ b/pm/Math/GSL/SF.pm.1.16
+@@ -2394,7 +2394,7 @@ These functions compute the incomplete e
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3870,7 +3870,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
+
+@@ -3922,7 +3922,7 @@ This module also contains the following
=back
@@ -2691,37 +2264,31 @@ index be52e40..53c5f45 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Fit.pm.1.11 b/pm/Math/GSL/Fit.pm.1.11
-index af3bfbd..b63517c 100644
---- a/pm/Math/GSL/Fit.pm.1.11
-+++ b/pm/Math/GSL/Fit.pm.1.11
-@@ -169,7 +169,7 @@ and y_err.
-
+--- a/pm/Math/GSL/Siman.pm.1.15
++++ b/pm/Math/GSL/Siman.pm.1.15
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
=back
+
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Fit.pm.1.12 b/pm/Math/GSL/Fit.pm.1.12
-index af3bfbd..b63517c 100644
---- a/pm/Math/GSL/Fit.pm.1.12
-+++ b/pm/Math/GSL/Fit.pm.1.12
-@@ -169,7 +169,7 @@ and y_err.
-
+--- a/pm/Math/GSL/Siman.pm.1.16
++++ b/pm/Math/GSL/Siman.pm.1.16
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
=back
+
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Fit.pm.1.13 b/pm/Math/GSL/Fit.pm.1.13
-index af3bfbd..b63517c 100644
---- a/pm/Math/GSL/Fit.pm.1.13
-+++ b/pm/Math/GSL/Fit.pm.1.13
-@@ -169,7 +169,7 @@ and y_err.
+--- a/pm/Math/GSL/Sort.pm.1.15
++++ b/pm/Math/GSL/Sort.pm.1.15
+@@ -327,7 +327,7 @@ should be removed in further versions.
=back
@@ -2729,12 +2296,10 @@ index af3bfbd..b63517c 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Fit.pm.1.14 b/pm/Math/GSL/Fit.pm.1.14
-index af3bfbd..b63517c 100644
---- a/pm/Math/GSL/Fit.pm.1.14
-+++ b/pm/Math/GSL/Fit.pm.1.14
-@@ -169,7 +169,7 @@ and y_err.
+ =head1 PERFORMANCE
+--- a/pm/Math/GSL/Sort.pm.1.16
++++ b/pm/Math/GSL/Sort.pm.1.16
+@@ -331,7 +331,7 @@ should be removed in further versions.
=back
@@ -2742,12 +2307,10 @@ index af3bfbd..b63517c 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Fit.pm.1.15 b/pm/Math/GSL/Fit.pm.1.15
-index af3bfbd..b63517c 100644
---- a/pm/Math/GSL/Fit.pm.1.15
-+++ b/pm/Math/GSL/Fit.pm.1.15
-@@ -169,7 +169,7 @@ and y_err.
+ =head1 PERFORMANCE
+--- a/pm/Math/GSL/Spline.pm.1.15
++++ b/pm/Math/GSL/Spline.pm.1.15
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
=back
@@ -2756,11 +2319,9 @@ index af3bfbd..b63517c 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Fit.pm.1.16 b/pm/Math/GSL/Fit.pm.1.16
-index af3bfbd..b63517c 100644
---- a/pm/Math/GSL/Fit.pm.1.16
-+++ b/pm/Math/GSL/Fit.pm.1.16
-@@ -169,7 +169,7 @@ and y_err.
+--- a/pm/Math/GSL/Spline.pm.1.16
++++ b/pm/Math/GSL/Spline.pm.1.16
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
=back
@@ -2769,24 +2330,29 @@ index af3bfbd..b63517c 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Heapsort.pm.1.11 b/pm/Math/GSL/Heapsort.pm.1.11
-index 4b22a54..aa216d2 100644
---- a/pm/Math/GSL/Heapsort.pm.1.11
-+++ b/pm/Math/GSL/Heapsort.pm.1.11
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+--- a/pm/Math/GSL/Statistics.pm.1.15
++++ b/pm/Math/GSL/Statistics.pm.1.15
+@@ -405,7 +405,7 @@ These functions return the total sum of
+
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
+
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
+
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
+@@ -586,8 +586,8 @@ The following function are simply varian
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+ =over
-diff --git a/pm/Math/GSL/Heapsort.pm.1.12 b/pm/Math/GSL/Heapsort.pm.1.12
-index 4b22a54..aa216d2 100644
---- a/pm/Math/GSL/Heapsort.pm.1.12
-+++ b/pm/Math/GSL/Heapsort.pm.1.12
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+@@ -599,7 +599,7 @@ Other tags are also avaible, here is a c
=back
@@ -2795,24 +2361,29 @@ index 4b22a54..aa216d2 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Heapsort.pm.1.13 b/pm/Math/GSL/Heapsort.pm.1.13
-index 4b22a54..aa216d2 100644
---- a/pm/Math/GSL/Heapsort.pm.1.13
-+++ b/pm/Math/GSL/Heapsort.pm.1.13
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+--- a/pm/Math/GSL/Statistics.pm.1.16
++++ b/pm/Math/GSL/Statistics.pm.1.16
+@@ -408,7 +408,7 @@ These functions return the total sum of
+
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
+
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
+
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
+@@ -589,8 +589,8 @@ The following function are simply varian
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+ =over
-diff --git a/pm/Math/GSL/Heapsort.pm.1.14 b/pm/Math/GSL/Heapsort.pm.1.14
-index 4b22a54..aa216d2 100644
---- a/pm/Math/GSL/Heapsort.pm.1.14
-+++ b/pm/Math/GSL/Heapsort.pm.1.14
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+@@ -602,7 +602,7 @@ Other tags are also avaible, here is a c
=back
@@ -2821,11 +2392,9 @@ index 4b22a54..aa216d2 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Heapsort.pm.1.15 b/pm/Math/GSL/Heapsort.pm.1.15
-index 4b22a54..aa216d2 100644
---- a/pm/Math/GSL/Heapsort.pm.1.15
-+++ b/pm/Math/GSL/Heapsort.pm.1.15
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+--- a/pm/Math/GSL/Sys.pm.1.15
++++ b/pm/Math/GSL/Sys.pm.1.15
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -2833,12 +2402,10 @@ index 4b22a54..aa216d2 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Heapsort.pm.1.16 b/pm/Math/GSL/Heapsort.pm.1.16
-index 4b22a54..aa216d2 100644
---- a/pm/Math/GSL/Heapsort.pm.1.16
-+++ b/pm/Math/GSL/Heapsort.pm.1.16
-@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Sys.pm.1.16
++++ b/pm/Math/GSL/Sys.pm.1.16
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -2846,603 +2413,476 @@ index 4b22a54..aa216d2 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Vector.pm.1.15
++++ b/pm/Math/GSL/Vector.pm.1.15
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
-diff --git a/pm/Math/GSL/Histogram2D.pm.1.11 b/pm/Math/GSL/Histogram2D.pm.1.11
-index 7365740..93a1d0c 100644
---- a/pm/Math/GSL/Histogram2D.pm.1.11
-+++ b/pm/Math/GSL/Histogram2D.pm.1.11
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+ =item C<gsl_vector_fread($file, $v)>
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
+ =item C<gsl_vector_memcpy($dest, $src)>
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the operation succeeded, 1 otherwise. The two vectors must have the
+ same length.
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ =item C<gsl_vector_reverse($v)>
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++operation succeeded, 1 otherwise
-diff --git a/pm/Math/GSL/Histogram2D.pm.1.12 b/pm/Math/GSL/Histogram2D.pm.1.12
-index 7365740..93a1d0c 100644
---- a/pm/Math/GSL/Histogram2D.pm.1.12
-+++ b/pm/Math/GSL/Histogram2D.pm.1.12
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+ =item C<gsl_vector_swap($v, $v2)>
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+-swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++swap the values of the vectors $v and $v2 and return 0 if the operation
++succeeded, 1 otherwise
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ =item C<gsl_vector_max($v)>
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
+ =item C<gsl_vector_add($v, $v2)>
-diff --git a/pm/Math/GSL/Histogram2D.pm.1.13 b/pm/Math/GSL/Histogram2D.pm.1.13
-index 7365740..93a1d0c 100644
---- a/pm/Math/GSL/Histogram2D.pm.1.13
-+++ b/pm/Math/GSL/Histogram2D.pm.1.13
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+ =item C<gsl_vector_sub($v, $v2)>
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+-substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
++have the same length and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ =item C<gsl_vector_mul($v, $v2)>
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+ =item C<gsl_vector_div($v, $v2)>
-diff --git a/pm/Math/GSL/Histogram2D.pm.1.14 b/pm/Math/GSL/Histogram2D.pm.1.14
-index 7365740..93a1d0c 100644
---- a/pm/Math/GSL/Histogram2D.pm.1.14
-+++ b/pm/Math/GSL/Histogram2D.pm.1.14
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+ =item C<gsl_vector_scale($v, $x)>
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ =item C<gsl_vector_add_constant($v, $x)>
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+ =item C<gsl_vector_isnull($v)>
-diff --git a/pm/Math/GSL/Histogram2D.pm.1.15 b/pm/Math/GSL/Histogram2D.pm.1.15
-index 7365740..93a1d0c 100644
---- a/pm/Math/GSL/Histogram2D.pm.1.15
-+++ b/pm/Math/GSL/Histogram2D.pm.1.15
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+ =back
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ =head1 EXAMPLES
+--- a/pm/Math/GSL/Vector.pm.1.16
++++ b/pm/Math/GSL/Vector.pm.1.16
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+ =item C<gsl_vector_fread($file, $v)>
-diff --git a/pm/Math/GSL/Histogram2D.pm.1.16 b/pm/Math/GSL/Histogram2D.pm.1.16
-index 7365740..93a1d0c 100644
---- a/pm/Math/GSL/Histogram2D.pm.1.16
-+++ b/pm/Math/GSL/Histogram2D.pm.1.16
-@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
+ =item C<gsl_vector_memcpy($dest, $src)>
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the operation succeeded, 1 otherwise. The two vectors must have the
+ same length.
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+ =item C<gsl_vector_reverse($v)>
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++operation succeeded, 1 otherwise
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ =item C<gsl_vector_swap($v, $v2)>
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+-swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++swap the values of the vectors $v and $v2 and return 0 if the operation
++succeeded, 1 otherwise
-diff --git a/pm/Math/GSL/Integration.pm.1.11 b/pm/Math/GSL/Integration.pm.1.11
-index 3f46f18..3924b1a 100644
---- a/pm/Math/GSL/Integration.pm.1.11
-+++ b/pm/Math/GSL/Integration.pm.1.11
-@@ -631,7 +631,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
- =head1 MORE INFO
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_max($v)>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Integration.pm.1.12 b/pm/Math/GSL/Integration.pm.1.12
-index 3f46f18..3924b1a 100644
---- a/pm/Math/GSL/Integration.pm.1.12
-+++ b/pm/Math/GSL/Integration.pm.1.12
-@@ -631,7 +631,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
+ =item C<gsl_vector_add($v, $v2)>
- =head1 MORE INFO
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_sub($v, $v2)>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Integration.pm.1.13 b/pm/Math/GSL/Integration.pm.1.13
-index 3f46f18..3924b1a 100644
---- a/pm/Math/GSL/Integration.pm.1.13
-+++ b/pm/Math/GSL/Integration.pm.1.13
-@@ -631,7 +631,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+-substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
++have the same length and return 0 if the operation succeeded, 1 otherwise.
- =head1 MORE INFO
+ =item C<gsl_vector_mul($v, $v2)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Integration.pm.1.14 b/pm/Math/GSL/Integration.pm.1.14
-index 7eda36d..060ccc7 100644
---- a/pm/Math/GSL/Integration.pm.1.14
-+++ b/pm/Math/GSL/Integration.pm.1.14
-@@ -679,7 +679,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+ =item C<gsl_vector_div($v, $v2)>
- =head1 MORE INFO
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_scale($v, $x)>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Integration.pm.1.15 b/pm/Math/GSL/Integration.pm.1.15
-index 9d829b5..7f447b0 100644
---- a/pm/Math/GSL/Integration.pm.1.15
-+++ b/pm/Math/GSL/Integration.pm.1.15
-@@ -781,7 +781,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =head1 MORE INFO
+ =item C<gsl_vector_add_constant($v, $x)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Integration.pm.1.16 b/pm/Math/GSL/Integration.pm.1.16
-index 9d829b5..7f447b0 100644
---- a/pm/Math/GSL/Integration.pm.1.16
-+++ b/pm/Math/GSL/Integration.pm.1.16
-@@ -781,7 +781,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+ =item C<gsl_vector_isnull($v)>
- =head1 MORE INFO
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =back
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Linalg.pm.1.11 b/pm/Math/GSL/Linalg.pm.1.11
-index b216d28..1f27f36 100644
---- a/pm/Math/GSL/Linalg.pm.1.11
-+++ b/pm/Math/GSL/Linalg.pm.1.11
-@@ -549,7 +549,7 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item gsl_linalg_complex_householder_transform
+ =head1 EXAMPLES
+--- a/pod/BLAS.pod
++++ b/pod/BLAS.pod
+@@ -100,7 +100,7 @@ The functions of this module are divised
+ =item C<gsl_blas_ddot($x, $y)>
--=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+ This function computes the scalar product x^T y for the vectors $x and $y. The
+-function returns two values, the first is 0 if the operation suceeded, 1
++function returns two values, the first is 0 if the operation succeeded, 1
+ otherwise and the second value is the result of the computation.
- =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+ =item C<gsl_blas_cdotu>
+@@ -111,13 +111,13 @@ otherwise and the second value is the re
-@@ -563,7 +563,7 @@ Here is a list of all the functions included in this module :
+ This function computes the complex scalar product x^T y for the complex vectors
+ $x and $y, returning the result in the complex number $dotu. The function
+-returns 0 if the operation suceeded, 1 otherwise.
++returns 0 if the operation succeeded, 1 otherwise.
- =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+ =item C<gsl_blas_zdotc($x, $y, $dotc)>
--=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-+=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+ This function computes the complex conjugate scalar product x^H y for the
+ complex vectors $x and $y, returning the result in the complex number $dotc.
+-The function returns 0 if the operation suceeded, 1 otherwise.
++The function returns 0 if the operation succeeded, 1 otherwise.
- =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+ =item C<gsl_blas_snrm2>
+ =item C<gsl_blas_sasum>
+@@ -162,11 +162,11 @@ This function computes the sum of the ma
-@@ -587,9 +587,9 @@ Here is a list of all the functions included in this module :
+ =item C<gsl_blas_dswap($x, $y)>
- =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+-This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
--=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+ =item C<gsl_blas_dcopy($x, $y)>
--=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+-This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
- =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+ =item C<gsl_blas_daxpy($alpha, $x, $y)>
-@@ -623,27 +623,27 @@ Here is a list of all the functions included in this module :
+@@ -228,11 +228,11 @@ This function rescales the vector $x by
- =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+ =item C<gsl_blas_strsv>
--=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-+=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+-=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
--=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
++=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
- =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+-=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
++=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
--=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_blas_cgemv >
--=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+@@ -256,9 +256,9 @@ This function rescales the vector $x by
--=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_blas_dsymv>
--=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
--=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
--=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
--=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+@@ -274,11 +274,11 @@ This function rescales the vector $x by
--=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_blas_zhemv >
- =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+-=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
-@@ -756,7 +756,7 @@ Here is a list of all the functions included in this module :
+ =item C<gsl_blas_zgerc>
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+-=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
++=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_zher2 >
+@@ -301,17 +301,17 @@ This function rescales the vector $x by
- =back
-diff --git a/pm/Math/GSL/Linalg.pm.1.12 b/pm/Math/GSL/Linalg.pm.1.12
-index a0060ee..8763587 100644
---- a/pm/Math/GSL/Linalg.pm.1.12
-+++ b/pm/Math/GSL/Linalg.pm.1.12
-@@ -550,7 +550,7 @@ Here is a list of all the functions included in this module :
+ =item C<gsl_blas_strsm>
- =item gsl_linalg_complex_householder_transform
+-=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
--=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
- =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+-=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-@@ -564,7 +564,7 @@ Here is a list of all the functions included in this module :
+-=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
- =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+-=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
--=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-+=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+-=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
- =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+ =item C<gsl_blas_cgemm>
-@@ -588,9 +588,9 @@ Here is a list of all the functions included in this module :
+@@ -325,17 +325,17 @@ This function rescales the vector $x by
- =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+ =item C<gsl_blas_ctrsm>
--=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+-=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
++=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
--=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+-=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
++=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
- =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+-=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
++=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
-@@ -624,27 +624,27 @@ Here is a list of all the functions included in this module :
+-=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
- =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+-=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
--=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-+=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+-=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
--=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_blas_chemm>
- =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+@@ -345,9 +345,9 @@ This function rescales the vector $x by
--=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
--=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
--=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
++=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
--=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+@@ -365,7 +365,7 @@ Other tags are also avaible, here is a c
--=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+ =head1 AUTHORS
- =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+--- a/pod/BSpline.pod
++++ b/pod/BSpline.pod
+@@ -68,7 +68,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
-@@ -757,7 +757,7 @@ Here is a list of all the functions included in this module :
+ =back
+--- a/pod/CBLAS.pod
++++ b/pod/CBLAS.pod
+@@ -491,7 +491,7 @@ This module also contains the following
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+ =back
-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
-diff --git a/pm/Math/GSL/Linalg.pm.1.13 b/pm/Math/GSL/Linalg.pm.1.13
-index a0060ee..8763587 100644
---- a/pm/Math/GSL/Linalg.pm.1.13
-+++ b/pm/Math/GSL/Linalg.pm.1.13
-@@ -550,7 +550,7 @@ Here is a list of all the functions included in this module :
- =item gsl_linalg_complex_householder_transform
+--- a/pod/CDF.pod
++++ b/pod/CDF.pod
+@@ -370,7 +370,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
--=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
-
- =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-
-@@ -564,7 +564,7 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
-
--=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-+=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-
- =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
-
-@@ -588,9 +588,9 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
-
--=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
-
--=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
-
- =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-
-@@ -624,27 +624,27 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
-
--=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-+=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-
--=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
-
- =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
-
--=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
-
- =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
-
-@@ -757,7 +757,7 @@ Here is a list of all the functions included in this module :
-
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pod/Chebyshev.pod
++++ b/pod/Chebyshev.pod
+@@ -93,7 +93,7 @@ in $deriv, which must be pre-allocated.
=back
-diff --git a/pm/Math/GSL/Linalg.pm.1.14 b/pm/Math/GSL/Linalg.pm.1.14
-index a0060ee..8763587 100644
---- a/pm/Math/GSL/Linalg.pm.1.14
-+++ b/pm/Math/GSL/Linalg.pm.1.14
-@@ -550,7 +550,7 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_complex_householder_transform
-
--=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
-
- =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-
-@@ -564,7 +564,7 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
-
--=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-+=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-
- =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
-
-@@ -588,9 +588,9 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
-
--=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
-
--=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
-
- =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-
-@@ -624,27 +624,27 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
-
--=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-+=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-
--=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
-
- =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
-
--=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
-
--=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+ =head1 AUTHORS
+--- a/pod/Combination.pod
++++ b/pod/Combination.pod
+@@ -205,7 +205,7 @@ sub prev {
-@@ -757,7 +757,7 @@ Here is a list of all the functions included in this module :
+ =head1 MORE INFO
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pod/Deriv.pod
++++ b/pod/Deriv.pod
+@@ -84,7 +84,7 @@ function is evaluated at $x and $x+$h.
=back
-diff --git a/pm/Math/GSL/Linalg.pm.1.15 b/pm/Math/GSL/Linalg.pm.1.15
-index 59f29f8..7d6fe33 100644
---- a/pm/Math/GSL/Linalg.pm.1.15
-+++ b/pm/Math/GSL/Linalg.pm.1.15
-@@ -551,7 +551,7 @@ Here is a list of all the functions included in this module :
-
- =item gsl_linalg_complex_householder_transform
-
--=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
-
- =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-
-@@ -565,7 +565,7 @@ Here is a list of all the functions included in this module :
- =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-+=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+ =head1 AUTHORS
+--- a/pod/Eigen.pod
++++ b/pod/Eigen.pod
+@@ -179,7 +179,7 @@ This module also includes these constant
- =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+ =back
-@@ -589,9 +589,9 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
--=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+--- a/pod/FFT.pod
++++ b/pod/FFT.pod
+@@ -277,7 +277,7 @@ This module also includes the following
--=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+ =back
- =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -625,27 +625,27 @@ Here is a list of all the functions included in this module :
- =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+--- a/pod/Fit.pod
++++ b/pod/Fit.pod
+@@ -103,7 +103,7 @@ and y_err.
--=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-+=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+ =back
--=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
--=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pod/Heapsort.pod
++++ b/pod/Heapsort.pod
+@@ -32,7 +32,7 @@ Here is a list of all the functions in t
--=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pod/Histogram2D.pod
++++ b/pod/Histogram2D.pod
+@@ -133,11 +133,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
--=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
--=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
--=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
- =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-@@ -758,7 +758,7 @@ Here is a list of all the functions included in this module :
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+--- a/pod/Integration.pod
++++ b/pod/Integration.pod
+@@ -230,7 +230,7 @@ The integral is divergent, or too slowly
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 MORE INFO
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
-diff --git a/pm/Math/GSL/Linalg.pm.1.16 b/pm/Math/GSL/Linalg.pm.1.16
-index 59f29f8..7d6fe33 100644
---- a/pm/Math/GSL/Linalg.pm.1.16
-+++ b/pm/Math/GSL/Linalg.pm.1.16
-@@ -551,7 +551,7 @@ Here is a list of all the functions included in this module :
+ =head1 AUTHORS
+--- a/pod/Linalg.pod
++++ b/pod/Linalg.pod
+@@ -139,7 +139,7 @@ Here is a list of all the functions incl
=item gsl_linalg_complex_householder_transform
@@ -3451,7 +2891,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-@@ -565,7 +565,7 @@ Here is a list of all the functions included in this module :
+@@ -161,7 +161,7 @@ Performs a Givens rotation on the $i and
=item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
@@ -3460,7 +2900,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
-@@ -589,9 +589,9 @@ Here is a list of all the functions included in this module :
+@@ -185,9 +185,9 @@ Performs a Givens rotation on the $i and
=item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
@@ -3472,7 +2912,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-@@ -625,27 +625,27 @@ Here is a list of all the functions included in this module :
+@@ -221,27 +221,27 @@ Performs a Givens rotation on the $i and
=item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
@@ -3510,7 +2950,7 @@ index 59f29f8..7d6fe33 100644
=item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
-@@ -758,7 +758,7 @@ Here is a list of all the functions included in this module :
+@@ -354,7 +354,7 @@ Performs a Givens rotation on the $i and
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -3519,11 +2959,9 @@ index 59f29f8..7d6fe33 100644
=back
-diff --git a/pm/Math/GSL/Matrix.pm.1.11 b/pm/Math/GSL/Matrix.pm.1.11
-index 177efd9..e9ca947 100644
---- a/pm/Math/GSL/Matrix.pm.1.11
-+++ b/pm/Math/GSL/Matrix.pm.1.11
-@@ -2363,11 +2363,11 @@ Here is a list of all the functions included in this module :
+--- a/pod/Matrix.pod
++++ b/pod/Matrix.pod
+@@ -1234,11 +1234,11 @@ Here is a list of all the functions incl
=item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
@@ -3538,7 +2976,7 @@ index 177efd9..e9ca947 100644
=item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
-@@ -2387,7 +2387,7 @@ Here is a list of all the functions included in this module :
+@@ -1258,7 +1258,7 @@ Here is a list of all the functions incl
=item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
@@ -3547,7 +2985,7 @@ index 177efd9..e9ca947 100644
=item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
-@@ -2407,13 +2407,13 @@ Here is a list of all the functions included in this module :
+@@ -1278,13 +1278,13 @@ Here is a list of all the functions incl
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
@@ -3565,7 +3003,7 @@ index 177efd9..e9ca947 100644
=back
-@@ -2715,7 +2715,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+@@ -1586,7 +1586,7 @@ Other tags are also avaible, here is a c
=back
@@ -3574,364 +3012,368 @@ index 177efd9..e9ca947 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Matrix.pm.1.12 b/pm/Math/GSL/Matrix.pm.1.12
-index 90cb486..6673f47 100644
---- a/pm/Math/GSL/Matrix.pm.1.12
-+++ b/pm/Math/GSL/Matrix.pm.1.12
-@@ -2364,11 +2364,11 @@ Here is a list of all the functions included in this module :
+--- a/pod/MatrixComplex.pod
++++ b/pod/MatrixComplex.pod
+@@ -693,7 +693,7 @@ sub lndet($)
- =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+ =back
--=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
--=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
-
- =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+--- a/pod/Min.pod
++++ b/pod/Min.pod
+@@ -107,7 +107,7 @@ This module also includes the following
-@@ -2388,7 +2388,7 @@ Here is a list of all the functions included in this module :
+ =back
- =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
-+=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
+ =head1 AUTHORS
+--- a/pod/Monte.pod
++++ b/pod/Monte.pod
+@@ -76,7 +76,7 @@ This module also includes the following
- =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
+ =back
-@@ -2408,13 +2408,13 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
+ =head1 AUTHORS
+--- a/pod/Multifit.pod
++++ b/pod/Multifit.pod
+@@ -106,7 +106,7 @@ The following functions are not yet impl
--=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pod/Multimin.pod
++++ b/pod/Multimin.pod
+@@ -105,7 +105,7 @@ This module also includes the following
=back
-@@ -2716,7 +2716,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pod/Multiroots.pod
++++ b/pod/Multiroots.pod
+@@ -93,7 +93,7 @@ Here is a list of all the functions in t
+ =back
-diff --git a/pm/Math/GSL/Matrix.pm.1.13 b/pm/Math/GSL/Matrix.pm.1.13
-index 90cb486..6673f47 100644
---- a/pm/Math/GSL/Matrix.pm.1.13
-+++ b/pm/Math/GSL/Matrix.pm.1.13
-@@ -2364,11 +2364,11 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+ =head1 AUTHORS
+--- a/pod/NTuple.pod
++++ b/pod/NTuple.pod
+@@ -89,7 +89,7 @@ memory.
--=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
--=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
+ =head1 AUTHORS
+--- a/pod/ODEIV.pod
++++ b/pod/ODEIV.pod
+@@ -135,7 +135,7 @@ This module also includes the following
- =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+ =back
-@@ -2388,7 +2388,7 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
--=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
-+=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
+--- a/pod/Permutation.pod
++++ b/pod/Permutation.pod
+@@ -72,7 +72,7 @@ Math::GSL::Permutation - functions for c
- =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -93,7 +93,7 @@ Here is a list of all the functions incl
-@@ -2408,13 +2408,13 @@ Here is a list of all the functions included in this module :
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
- =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
--=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
--=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+@@ -109,7 +109,7 @@ Here is a list of all the functions incl
--=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
--=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =back
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
-@@ -2716,7 +2716,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+@@ -119,13 +119,13 @@ Here is a list of all the functions incl
- =back
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
-diff --git a/pm/Math/GSL/Matrix.pm.1.14 b/pm/Math/GSL/Matrix.pm.1.14
-index 90cb486..6673f47 100644
---- a/pm/Math/GSL/Matrix.pm.1.14
-+++ b/pm/Math/GSL/Matrix.pm.1.14
-@@ -2364,11 +2364,11 @@ Here is a list of all the functions included in this module :
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
--=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
--=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -152,7 +152,7 @@ Here is a list of all the functions incl
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+ You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+ Other tags are also avaible, here is a complete list of all tags for this module.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+--- a/pod/Poly.pod
++++ b/pod/Poly.pod
+@@ -95,7 +95,7 @@ This function frees all the memory assoc
-@@ -2388,7 +2388,7 @@ Here is a list of all the functions included in this module :
+ =back
- =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
-+=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
+ =head1 AUTHORS
+--- a/pod/QRNG.pod
++++ b/pod/QRNG.pod
+@@ -168,7 +168,7 @@ This module also contains the following
- =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
+ =back
-@@ -2408,13 +2408,13 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
--=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pod/RNG.pod
++++ b/pod/RNG.pod
+@@ -399,7 +399,7 @@ __END__
--=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
- =back
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -2716,7 +2716,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pod/Randist.pod
++++ b/pod/Randist.pod
+@@ -835,7 +835,7 @@ De-allocates the gsl_ran_discrete pointe
- =back
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Matrix.pm.1.15 b/pm/Math/GSL/Matrix.pm.1.15
-index 3c27f4d..7d884ef 100644
---- a/pm/Math/GSL/Matrix.pm.1.15
-+++ b/pm/Math/GSL/Matrix.pm.1.15
-@@ -2369,11 +2369,11 @@ Here is a list of all the functions included in this module :
+--- a/pod/SF.pod
++++ b/pod/SF.pod
+@@ -1644,7 +1644,7 @@ These functions compute the incomplete e
- =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+ =over
--=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
--=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_sf_erfc_e($x, $result)>
--=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -3172,7 +3172,7 @@ This module also contains the following
- =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+ =back
-@@ -2393,7 +2393,7 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
--=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
-+=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
+--- a/pod/Siman.pod
++++ b/pod/Siman.pod
+@@ -32,7 +32,7 @@ Here is a list of all the functions in t
+ =back
- =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
-@@ -2413,13 +2413,13 @@ Here is a list of all the functions included in this module :
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
--=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pod/Sort.pod
++++ b/pod/Sort.pod
+@@ -136,7 +136,7 @@ should be removed in further versions.
--=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+ =head1 PERFORMANCE
+--- a/pod/Spline.pod
++++ b/pod/Spline.pod
+@@ -66,7 +66,7 @@ ya as arguments on each evaluation.
=back
-@@ -2721,7 +2721,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pod/Statistics.pod
++++ b/pod/Statistics.pod
+@@ -198,7 +198,7 @@ These functions return the total sum of
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-diff --git a/pm/Math/GSL/Matrix.pm.1.16 b/pm/Math/GSL/Matrix.pm.1.16
-index 3c27f4d..7d884ef 100644
---- a/pm/Math/GSL/Matrix.pm.1.16
-+++ b/pm/Math/GSL/Matrix.pm.1.16
-@@ -2369,11 +2369,11 @@ Here is a list of all the functions included in this module :
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
- =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
--=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -392,7 +392,7 @@ Other tags are also avaible, here is a c
--=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
--=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
-@@ -2393,7 +2393,7 @@ Here is a list of all the functions included in this module :
+--- a/pod/Sys.pod
++++ b/pod/Sys.pod
+@@ -138,7 +138,7 @@ zero. The implementation is based on the
- =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
+ =back
--=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
-+=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
-
- =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
-
-@@ -2413,13 +2413,13 @@ Here is a list of all the functions included in this module :
-
- =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-
--=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-
--=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-
--=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-
--=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =back
+ =head1 AUTHORS
+--- a/pod/Vector.pod
++++ b/pod/Vector.pod
+@@ -494,7 +494,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
-@@ -2721,7 +2721,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_fread($file, $v)>
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -531,23 +531,23 @@ success and 1 if there was a problem wri
+ =item C<gsl_vector_memcpy($dest, $src)>
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
-diff --git a/pm/Math/GSL/MatrixComplex.pm.1.11 b/pm/Math/GSL/MatrixComplex.pm.1.11
-index 4d7c85c..f1affc0 100644
---- a/pm/Math/GSL/MatrixComplex.pm.1.11
-+++ b/pm/Math/GSL/MatrixComplex.pm.1.11
-@@ -1229,7 +1229,7 @@ sub lndet($)
+ =item C<gsl_vector_reverse($v)>
- =back
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_swap($v, $v2)>
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
-diff --git a/pm/Math/GSL/MatrixComplex.pm.1.12 b/pm/Math/GSL/MatrixComplex.pm.1.12
-index e79e827..651373d 100644
---- a/pm/Math/GSL/MatrixComplex.pm.1.12
-+++ b/pm/Math/GSL/MatrixComplex.pm.1.12
-@@ -1230,7 +1230,7 @@ sub lndet($)
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
- =back
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_max($v)>
+@@ -578,32 +578,32 @@ $v and the second is the position of the
+ =item C<gsl_vector_add($v, $v2)>
-diff --git a/pm/Math/GSL/MatrixComplex.pm.1.13 b/pm/Math/GSL/MatrixComplex.pm.1.13
-index e79e827..651373d 100644
---- a/pm/Math/GSL/MatrixComplex.pm.1.13
-+++ b/pm/Math/GSL/MatrixComplex.pm.1.13
-@@ -1230,7 +1230,7 @@ sub lndet($)
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_sub($v, $v2)>
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_vector_mul($v, $v2)>
-diff --git a/pm/Math/GSL/MatrixComplex.pm.1.14 b/pm/Math/GSL/MatrixComplex.pm.1.14
-index e79e827..651373d 100644
---- a/pm/Math/GSL/MatrixComplex.pm.1.14
-+++ b/pm/Math/GSL/MatrixComplex.pm.1.14
-@@ -1230,7 +1230,7 @@ sub lndet($)
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_div($v, $v2)>
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_vector_scale($v, $x)>
-diff --git a/pm/Math/GSL/MatrixComplex.pm.1.15 b/pm/Math/GSL/MatrixComplex.pm.1.15
-index 8e82f89..72ff7b2 100644
---- a/pm/Math/GSL/MatrixComplex.pm.1.15
-+++ b/pm/Math/GSL/MatrixComplex.pm.1.15
-@@ -1232,7 +1232,7 @@ sub lndet($)
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_add_constant($v, $x)>
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+ =item C<gsl_vector_isnull($v)>
-diff --git a/pm/Math/GSL/MatrixComplex.pm.1.16 b/pm/Math/GSL/MatrixComplex.pm.1.16
-index 8e82f89..72ff7b2 100644
---- a/pm/Math/GSL/MatrixComplex.pm.1.16
-+++ b/pm/Math/GSL/MatrixComplex.pm.1.16
-@@ -1232,7 +1232,7 @@ sub lndet($)
+@@ -640,7 +640,7 @@ leaving the odd elements untouched :
=back
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Min.pm.1.11 b/pm/Math/GSL/Min.pm.1.11
-index f0bd185..1c715e6 100644
---- a/pm/Math/GSL/Min.pm.1.11
-+++ b/pm/Math/GSL/Min.pm.1.11
-@@ -436,7 +436,7 @@ This module also includes the following constants :
+ =head1 EXAMPLES
+--- a/lib/Math/GSL/Multilarge.pm
++++ b/lib/Math/GSL/Multilarge.pm
+@@ -848,7 +848,7 @@ The following functions are not yet impl
=back
@@ -3939,532 +3381,954 @@ index f0bd185..1c715e6 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Min.pm.1.12 b/pm/Math/GSL/Min.pm.1.12
-index f0bd185..1c715e6 100644
---- a/pm/Math/GSL/Min.pm.1.12
-+++ b/pm/Math/GSL/Min.pm.1.12
-@@ -436,7 +436,7 @@ This module also includes the following constants :
- =back
+--- a/pm/Math/GSL/BLAS.pm.2.0
++++ b/pm/Math/GSL/BLAS.pm.2.0
+@@ -308,7 +308,7 @@ The functions of this module are divised
+ =item C<gsl_blas_ddot($x, $y)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ This function computes the scalar product x^T y for the vectors $x and $y. The
+-function returns two values, the first is 0 if the operation suceeded, 1
++function returns two values, the first is 0 if the operation succeeded, 1
+ otherwise and the second value is the result of the computation.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Min.pm.1.13 b/pm/Math/GSL/Min.pm.1.13
-index f5d5d80..9831305 100644
---- a/pm/Math/GSL/Min.pm.1.13
-+++ b/pm/Math/GSL/Min.pm.1.13
-@@ -441,7 +441,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_cdotu>
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
- =back
+ This function computes the complex scalar product x^T y for the complex vectors
+ $x and $y, returning the result in the complex number $dotu. The function
+-returns 0 if the operation suceeded, 1 otherwise.
++returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_zdotc($x, $y, $dotc)>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Min.pm.1.14 b/pm/Math/GSL/Min.pm.1.14
-index f5d5d80..9831305 100644
---- a/pm/Math/GSL/Min.pm.1.14
-+++ b/pm/Math/GSL/Min.pm.1.14
-@@ -441,7 +441,7 @@ This module also includes the following constants :
+ This function computes the complex conjugate scalar product x^H y for the
+ complex vectors $x and $y, returning the result in the complex number $dotc.
+-The function returns 0 if the operation suceeded, 1 otherwise.
++The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_blas_snrm2>
+ =item C<gsl_blas_sasum>
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_dswap($x, $y)>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Min.pm.1.15 b/pm/Math/GSL/Min.pm.1.15
-index f5d5d80..9831305 100644
---- a/pm/Math/GSL/Min.pm.1.15
-+++ b/pm/Math/GSL/Min.pm.1.15
-@@ -441,7 +441,7 @@ This module also includes the following constants :
+-This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_blas_dcopy($x, $y)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Min.pm.1.16 b/pm/Math/GSL/Min.pm.1.16
-index f5d5d80..9831305 100644
---- a/pm/Math/GSL/Min.pm.1.16
-+++ b/pm/Math/GSL/Min.pm.1.16
-@@ -441,7 +441,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_daxpy($alpha, $x, $y)>
- =back
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_strsv>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Monte.pm.1.11 b/pm/Math/GSL/Monte.pm.1.11
-index 786f6e0..fb10d93 100644
---- a/pm/Math/GSL/Monte.pm.1.11
-+++ b/pm/Math/GSL/Monte.pm.1.11
-@@ -457,7 +457,7 @@ This module also includes the following constants :
+-=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
++=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
++=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Monte.pm.1.12 b/pm/Math/GSL/Monte.pm.1.12
-index 786f6e0..fb10d93 100644
---- a/pm/Math/GSL/Monte.pm.1.12
-+++ b/pm/Math/GSL/Monte.pm.1.12
-@@ -457,7 +457,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_cgemv >
- =back
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_dsymv>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Monte.pm.1.13 b/pm/Math/GSL/Monte.pm.1.13
-index a147ea9..4ccd404 100644
---- a/pm/Math/GSL/Monte.pm.1.13
-+++ b/pm/Math/GSL/Monte.pm.1.13
-@@ -559,7 +559,7 @@ This module also includes the following constants :
+-=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Monte.pm.1.14 b/pm/Math/GSL/Monte.pm.1.14
-index a147ea9..4ccd404 100644
---- a/pm/Math/GSL/Monte.pm.1.14
-+++ b/pm/Math/GSL/Monte.pm.1.14
-@@ -559,7 +559,7 @@ This module also includes the following constants :
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_zhemv >
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Monte.pm.1.15 b/pm/Math/GSL/Monte.pm.1.15
-index a147ea9..4ccd404 100644
---- a/pm/Math/GSL/Monte.pm.1.15
-+++ b/pm/Math/GSL/Monte.pm.1.15
-@@ -559,7 +559,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_zgerc>
- =back
+-=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
++=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Monte.pm.1.16 b/pm/Math/GSL/Monte.pm.1.16
-index a147ea9..4ccd404 100644
---- a/pm/Math/GSL/Monte.pm.1.16
-+++ b/pm/Math/GSL/Monte.pm.1.16
-@@ -559,7 +559,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_zher2 >
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_strsm>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multifit.pm.1.11 b/pm/Math/GSL/Multifit.pm.1.11
-index b0edca2..2c78b65 100644
---- a/pm/Math/GSL/Multifit.pm.1.11
-+++ b/pm/Math/GSL/Multifit.pm.1.11
-@@ -547,7 +547,7 @@ The following functions are not yet implemented. Patches Welcome!
+-=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+-=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-diff --git a/pm/Math/GSL/Multifit.pm.1.12 b/pm/Math/GSL/Multifit.pm.1.12
-index b0edca2..2c78b65 100644
---- a/pm/Math/GSL/Multifit.pm.1.12
-+++ b/pm/Math/GSL/Multifit.pm.1.12
-@@ -547,7 +547,7 @@ The following functions are not yet implemented. Patches Welcome!
+-=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
- =back
+ =item C<gsl_blas_cgemm>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
+ =item C<gsl_blas_ctrsm>
-diff --git a/pm/Math/GSL/Multifit.pm.1.13 b/pm/Math/GSL/Multifit.pm.1.13
-index b0edca2..2c78b65 100644
---- a/pm/Math/GSL/Multifit.pm.1.13
-+++ b/pm/Math/GSL/Multifit.pm.1.13
-@@ -547,7 +547,7 @@ The following functions are not yet implemented. Patches Welcome!
+-=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
++=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
- =back
+-=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
++=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
++=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+-=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-diff --git a/pm/Math/GSL/Multifit.pm.1.14 b/pm/Math/GSL/Multifit.pm.1.14
-index 254647e..30257f7 100644
---- a/pm/Math/GSL/Multifit.pm.1.14
-+++ b/pm/Math/GSL/Multifit.pm.1.14
-@@ -549,7 +549,7 @@ The following functions are not yet implemented. Patches Welcome!
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+-=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-diff --git a/pm/Math/GSL/Multifit.pm.1.15 b/pm/Math/GSL/Multifit.pm.1.15
-index 254647e..30257f7 100644
---- a/pm/Math/GSL/Multifit.pm.1.15
-+++ b/pm/Math/GSL/Multifit.pm.1.15
-@@ -549,7 +549,7 @@ The following functions are not yet implemented. Patches Welcome!
+ =item C<gsl_blas_chemm>
- =back
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+-=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-diff --git a/pm/Math/GSL/Multifit.pm.1.16 b/pm/Math/GSL/Multifit.pm.1.16
-index ef25e4f..f191b78 100644
---- a/pm/Math/GSL/Multifit.pm.1.16
-+++ b/pm/Math/GSL/Multifit.pm.1.16
-@@ -772,7 +772,7 @@ The following functions are not yet implemented. Patches Welcome!
+-=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
++=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+ =over 3
-diff --git a/pm/Math/GSL/Multimin.pm.1.11 b/pm/Math/GSL/Multimin.pm.1.11
-index 3f125cb..78ec58f 100644
---- a/pm/Math/GSL/Multimin.pm.1.11
-+++ b/pm/Math/GSL/Multimin.pm.1.11
-@@ -506,7 +506,7 @@ This module also includes the following constants :
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multimin.pm.1.12 b/pm/Math/GSL/Multimin.pm.1.12
-index dbb0c06..805695e 100644
---- a/pm/Math/GSL/Multimin.pm.1.12
-+++ b/pm/Math/GSL/Multimin.pm.1.12
-@@ -516,7 +516,7 @@ This module also includes the following constants :
+--- a/pm/Math/GSL/BLAS.pm.2.1
++++ b/pm/Math/GSL/BLAS.pm.2.1
+@@ -308,7 +308,7 @@ The functions of this module are divised
+ =item C<gsl_blas_ddot($x, $y)>
- =back
+ This function computes the scalar product x^T y for the vectors $x and $y. The
+-function returns two values, the first is 0 if the operation suceeded, 1
++function returns two values, the first is 0 if the operation succeeded, 1
+ otherwise and the second value is the result of the computation.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_cdotu>
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
+ This function computes the complex scalar product x^T y for the complex vectors
+ $x and $y, returning the result in the complex number $dotu. The function
+-returns 0 if the operation suceeded, 1 otherwise.
++returns 0 if the operation succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/Multimin.pm.1.13 b/pm/Math/GSL/Multimin.pm.1.13
-index dbb0c06..805695e 100644
---- a/pm/Math/GSL/Multimin.pm.1.13
-+++ b/pm/Math/GSL/Multimin.pm.1.13
-@@ -516,7 +516,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_zdotc($x, $y, $dotc)>
- =back
+ This function computes the complex conjugate scalar product x^H y for the
+ complex vectors $x and $y, returning the result in the complex number $dotc.
+-The function returns 0 if the operation suceeded, 1 otherwise.
++The function returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_snrm2>
+ =item C<gsl_blas_sasum>
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
+ =item C<gsl_blas_dswap($x, $y)>
-diff --git a/pm/Math/GSL/Multimin.pm.1.14 b/pm/Math/GSL/Multimin.pm.1.14
-index dbb0c06..805695e 100644
---- a/pm/Math/GSL/Multimin.pm.1.14
-+++ b/pm/Math/GSL/Multimin.pm.1.14
-@@ -516,7 +516,7 @@ This module also includes the following constants :
+-This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_blas_dcopy($x, $y)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_blas_daxpy($alpha, $x, $y)>
-diff --git a/pm/Math/GSL/Multimin.pm.1.15 b/pm/Math/GSL/Multimin.pm.1.15
-index dbb0c06..805695e 100644
---- a/pm/Math/GSL/Multimin.pm.1.15
-+++ b/pm/Math/GSL/Multimin.pm.1.15
-@@ -516,7 +516,7 @@ This module also includes the following constants :
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_strsv>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
++=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
-diff --git a/pm/Math/GSL/Multimin.pm.1.16 b/pm/Math/GSL/Multimin.pm.1.16
-index dbb0c06..805695e 100644
---- a/pm/Math/GSL/Multimin.pm.1.16
-+++ b/pm/Math/GSL/Multimin.pm.1.16
-@@ -516,7 +516,7 @@ This module also includes the following constants :
+-=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
++=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
- =back
+ =item C<gsl_blas_cgemv >
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
+ =item C<gsl_blas_dsymv>
-diff --git a/pm/Math/GSL/Multiroots.pm.1.11 b/pm/Math/GSL/Multiroots.pm.1.11
-index f172322..2fe07f3 100644
---- a/pm/Math/GSL/Multiroots.pm.1.11
-+++ b/pm/Math/GSL/Multiroots.pm.1.11
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+-=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multiroots.pm.1.12 b/pm/Math/GSL/Multiroots.pm.1.12
-index f172322..2fe07f3 100644
---- a/pm/Math/GSL/Multiroots.pm.1.12
-+++ b/pm/Math/GSL/Multiroots.pm.1.12
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_zhemv >
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multiroots.pm.1.13 b/pm/Math/GSL/Multiroots.pm.1.13
-index f172322..2fe07f3 100644
---- a/pm/Math/GSL/Multiroots.pm.1.13
-+++ b/pm/Math/GSL/Multiroots.pm.1.13
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+ =item C<gsl_blas_zgerc>
- =back
+-=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
++=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multiroots.pm.1.14 b/pm/Math/GSL/Multiroots.pm.1.14
-index f172322..2fe07f3 100644
---- a/pm/Math/GSL/Multiroots.pm.1.14
-+++ b/pm/Math/GSL/Multiroots.pm.1.14
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+ =item C<gsl_blas_zher2 >
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_strsm>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multiroots.pm.1.15 b/pm/Math/GSL/Multiroots.pm.1.15
-index f172322..2fe07f3 100644
---- a/pm/Math/GSL/Multiroots.pm.1.15
-+++ b/pm/Math/GSL/Multiroots.pm.1.15
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+-=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Multiroots.pm.1.16 b/pm/Math/GSL/Multiroots.pm.1.16
-index f172322..2fe07f3 100644
---- a/pm/Math/GSL/Multiroots.pm.1.16
-+++ b/pm/Math/GSL/Multiroots.pm.1.16
-@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
+-=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
- =back
+-=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_cgemm>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/NTuple.pm.1.11 b/pm/Math/GSL/NTuple.pm.1.11
-index dc8e0e5..55be67e 100644
---- a/pm/Math/GSL/NTuple.pm.1.11
-+++ b/pm/Math/GSL/NTuple.pm.1.11
-@@ -407,7 +407,7 @@ memory.
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_ctrsm>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
++=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/NTuple.pm.1.12 b/pm/Math/GSL/NTuple.pm.1.12
-index dc8e0e5..55be67e 100644
---- a/pm/Math/GSL/NTuple.pm.1.12
-+++ b/pm/Math/GSL/NTuple.pm.1.12
-@@ -407,7 +407,7 @@ memory.
+-=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
++=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
- =back
+-=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
++=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/NTuple.pm.1.13 b/pm/Math/GSL/NTuple.pm.1.13
-index dc8e0e5..55be67e 100644
---- a/pm/Math/GSL/NTuple.pm.1.13
-+++ b/pm/Math/GSL/NTuple.pm.1.13
-@@ -407,7 +407,7 @@ memory.
+-=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
- =back
+-=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_chemm>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/NTuple.pm.1.14 b/pm/Math/GSL/NTuple.pm.1.14
-index dc8e0e5..55be67e 100644
---- a/pm/Math/GSL/NTuple.pm.1.14
-+++ b/pm/Math/GSL/NTuple.pm.1.14
-@@ -407,7 +407,7 @@ memory.
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
- =back
+ =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/NTuple.pm.1.15 b/pm/Math/GSL/NTuple.pm.1.15
-index dc8e0e5..55be67e 100644
---- a/pm/Math/GSL/NTuple.pm.1.15
-+++ b/pm/Math/GSL/NTuple.pm.1.15
-@@ -407,7 +407,7 @@ memory.
+-=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
++=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/NTuple.pm.1.16 b/pm/Math/GSL/NTuple.pm.1.16
-index dc8e0e5..55be67e 100644
---- a/pm/Math/GSL/NTuple.pm.1.16
-+++ b/pm/Math/GSL/NTuple.pm.1.16
-@@ -407,7 +407,7 @@ memory.
+ =over 3
+
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/ODEIV.pm.1.11 b/pm/Math/GSL/ODEIV.pm.1.11
-index 10ec745..edcbfbd 100644
---- a/pm/Math/GSL/ODEIV.pm.1.11
-+++ b/pm/Math/GSL/ODEIV.pm.1.11
-@@ -554,7 +554,7 @@ This module also includes the following constants :
- =back
+--- a/pm/Math/GSL/BLAS.pm.2.2
++++ b/pm/Math/GSL/BLAS.pm.2.2
+@@ -308,7 +308,7 @@ The functions of this module are divised
+ =item C<gsl_blas_ddot($x, $y)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ This function computes the scalar product x^T y for the vectors $x and $y. The
+-function returns two values, the first is 0 if the operation suceeded, 1
++function returns two values, the first is 0 if the operation succeeded, 1
+ otherwise and the second value is the result of the computation.
+ =item C<gsl_blas_cdotu>
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
-diff --git a/pm/Math/GSL/ODEIV.pm.1.12 b/pm/Math/GSL/ODEIV.pm.1.12
-index 10ec745..edcbfbd 100644
---- a/pm/Math/GSL/ODEIV.pm.1.12
-+++ b/pm/Math/GSL/ODEIV.pm.1.12
-@@ -554,7 +554,7 @@ This module also includes the following constants :
+ This function computes the complex scalar product x^T y for the complex vectors
+ $x and $y, returning the result in the complex number $dotu. The function
+-returns 0 if the operation suceeded, 1 otherwise.
++returns 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_blas_zdotc($x, $y, $dotc)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ This function computes the complex conjugate scalar product x^H y for the
+ complex vectors $x and $y, returning the result in the complex number $dotc.
+-The function returns 0 if the operation suceeded, 1 otherwise.
++The function returns 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_blas_snrm2>
+ =item C<gsl_blas_sasum>
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
-diff --git a/pm/Math/GSL/ODEIV.pm.1.13 b/pm/Math/GSL/ODEIV.pm.1.13
-index 10ec745..edcbfbd 100644
---- a/pm/Math/GSL/ODEIV.pm.1.13
-+++ b/pm/Math/GSL/ODEIV.pm.1.13
-@@ -554,7 +554,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_dswap($x, $y)>
- =back
+-This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_dcopy($x, $y)>
+-This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/ODEIV.pm.1.14 b/pm/Math/GSL/ODEIV.pm.1.14
-index 10ec745..edcbfbd 100644
---- a/pm/Math/GSL/ODEIV.pm.1.14
-+++ b/pm/Math/GSL/ODEIV.pm.1.14
-@@ -554,7 +554,7 @@ This module also includes the following constants :
+ =item C<gsl_blas_daxpy($alpha, $x, $y)>
- =back
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_strsv>
+-=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/ODEIV.pm.1.15 b/pm/Math/GSL/ODEIV.pm.1.15
-index 10ec745..edcbfbd 100644
---- a/pm/Math/GSL/ODEIV.pm.1.15
-+++ b/pm/Math/GSL/ODEIV.pm.1.15
-@@ -554,7 +554,7 @@ This module also includes the following constants :
+-=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
++=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
- =back
+-=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
++=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_blas_cgemv >
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_dsymv>
+
+-=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_zhemv >
+
+-=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_zgerc>
+
+-=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
++=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+
+
+ =item C<gsl_blas_zher2 >
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_strsm>
+
+-=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+
+-=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+
+-=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+
+-=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+
+ =item C<gsl_blas_cgemm>
+
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_ctrsm>
+
+-=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
++=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+
+-=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
++=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
+
+-=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
++=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+
+-=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+
+-=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+
+-=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+
+ =item C<gsl_blas_chemm>
+
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+
+-=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+
+-=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
++=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+
+ =back
+
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over 3
+
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+
+--- a/pm/Math/GSL/BLAS.pm.2.2.1
++++ b/pm/Math/GSL/BLAS.pm.2.2.1
+@@ -308,7 +308,7 @@ The functions of this module are divised
+ =item C<gsl_blas_ddot($x, $y)>
+
+ This function computes the scalar product x^T y for the vectors $x and $y. The
+-function returns two values, the first is 0 if the operation suceeded, 1
++function returns two values, the first is 0 if the operation succeeded, 1
+ otherwise and the second value is the result of the computation.
+
+ =item C<gsl_blas_cdotu>
+@@ -319,13 +319,13 @@ otherwise and the second value is the re
+
+ This function computes the complex scalar product x^T y for the complex vectors
+ $x and $y, returning the result in the complex number $dotu. The function
+-returns 0 if the operation suceeded, 1 otherwise.
++returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_zdotc($x, $y, $dotc)>
+
+ This function computes the complex conjugate scalar product x^H y for the
+ complex vectors $x and $y, returning the result in the complex number $dotc.
+-The function returns 0 if the operation suceeded, 1 otherwise.
++The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_snrm2>
+ =item C<gsl_blas_sasum>
+@@ -370,11 +370,11 @@ This function computes the sum of the ma
+
+ =item C<gsl_blas_dswap($x, $y)>
+
+-This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_dcopy($x, $y)>
+
+-This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
++This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_daxpy($alpha, $x, $y)>
+
+@@ -436,11 +436,11 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_strsv>
+
+-=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
++=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
+
+-=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
++=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
+
+ =item C<gsl_blas_cgemv >
+
+@@ -464,9 +464,9 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_dsymv>
+
+-=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+
+@@ -482,11 +482,11 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_zhemv >
+
+-=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_blas_zgerc>
+
+-=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
++=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+
+
+ =item C<gsl_blas_zher2 >
+@@ -509,17 +509,17 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_strsm>
+
+-=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+
+-=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+
+-=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+
+-=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+
+-=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+
+ =item C<gsl_blas_cgemm>
+
+@@ -533,17 +533,17 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_ctrsm>
+
+-=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
++=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+
+-=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
++=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
+
+-=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
++=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+
+-=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
++=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+
+-=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
++=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
+
+-=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
++=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+
+ =item C<gsl_blas_chemm>
+
+@@ -553,15 +553,15 @@ This function rescales the vector $x by
+
+ =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+
+-=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
++=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+
+-=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
++=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+
+ =back
+
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::BLAS qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::BLAS qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+
+ =over 3
+
+@@ -573,7 +573,7 @@ Other tags are also avaible, here is a c
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+
+--- a/pm/Math/GSL/BSpline.pm.2.0
++++ b/pm/Math/GSL/BSpline.pm.2.0
+@@ -388,7 +388,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
+
+ =back
+--- a/pm/Math/GSL/BSpline.pm.2.1
++++ b/pm/Math/GSL/BSpline.pm.2.1
+@@ -388,7 +388,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
+
+ =back
+--- a/pm/Math/GSL/BSpline.pm.2.2
++++ b/pm/Math/GSL/BSpline.pm.2.2
+@@ -388,7 +388,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
+
+ =back
+--- a/pm/Math/GSL/BSpline.pm.2.2.1
++++ b/pm/Math/GSL/BSpline.pm.2.2.1
+@@ -388,7 +388,7 @@ gsl_bspline_ncoeffs. It is far more effi
+ functions at once than to compute them individually, due to the nature of the
+ defining recurrence relation.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ http://www.gnu.org/software/gsl/manual/html_node/
+
+ =back
+--- a/pm/Math/GSL/CBLAS.pm.2.0
++++ b/pm/Math/GSL/CBLAS.pm.2.0
+@@ -746,7 +746,7 @@ This module also contains the following
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+
+--- a/pm/Math/GSL/CBLAS.pm.2.1
++++ b/pm/Math/GSL/CBLAS.pm.2.1
+@@ -746,7 +746,7 @@ This module also contains the following
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+
+--- a/pm/Math/GSL/CBLAS.pm.2.2
++++ b/pm/Math/GSL/CBLAS.pm.2.2
+@@ -746,7 +746,7 @@ This module also contains the following
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+
+--- a/pm/Math/GSL/CBLAS.pm.2.2.1
++++ b/pm/Math/GSL/CBLAS.pm.2.2.1
+@@ -746,7 +746,7 @@ This module also contains the following
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+
+--- a/pm/Math/GSL/CDF.pm.2.0
++++ b/pm/Math/GSL/CDF.pm.2.0
+@@ -558,7 +558,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/CDF.pm.2.1
++++ b/pm/Math/GSL/CDF.pm.2.1
+@@ -558,7 +558,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/CDF.pm.2.2
++++ b/pm/Math/GSL/CDF.pm.2.2
+@@ -558,7 +558,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/CDF.pm.2.2.1
++++ b/pm/Math/GSL/CDF.pm.2.2.1
+@@ -558,7 +558,7 @@ This is the list of available import tag
+ For example the beta tag contains theses functions : gsl_cdf_beta_P,
+ gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Chebyshev.pm.2.0
++++ b/pm/Math/GSL/Chebyshev.pm.2.0
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Chebyshev.pm.2.1
++++ b/pm/Math/GSL/Chebyshev.pm.2.1
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Chebyshev.pm.2.2
++++ b/pm/Math/GSL/Chebyshev.pm.2.2
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Chebyshev.pm.2.2.1
++++ b/pm/Math/GSL/Chebyshev.pm.2.2.1
+@@ -406,7 +406,7 @@ in $deriv, which must be pre-allocated.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Combination.pm.2.0
++++ b/pm/Math/GSL/Combination.pm.2.0
+@@ -369,7 +369,7 @@ sub prev {
+
+ =head1 MORE INFO
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Combination.pm.2.1
++++ b/pm/Math/GSL/Combination.pm.2.1
+@@ -369,7 +369,7 @@ sub prev {
+
+ =head1 MORE INFO
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Combination.pm.2.2
++++ b/pm/Math/GSL/Combination.pm.2.2
+@@ -369,7 +369,7 @@ sub prev {
+
+ =head1 MORE INFO
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Combination.pm.2.2.1
++++ b/pm/Math/GSL/Combination.pm.2.2.1
+@@ -369,7 +369,7 @@ sub prev {
+
+ =head1 MORE INFO
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Deriv.pm.2.0
++++ b/pm/Math/GSL/Deriv.pm.2.0
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Deriv.pm.2.1
++++ b/pm/Math/GSL/Deriv.pm.2.1
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Deriv.pm.2.2
++++ b/pm/Math/GSL/Deriv.pm.2.2
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Deriv.pm.2.2.1
++++ b/pm/Math/GSL/Deriv.pm.2.2.1
+@@ -333,7 +333,7 @@ function is evaluated at $x and $x+$h.
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Eigen.pm.2.0
++++ b/pm/Math/GSL/Eigen.pm.2.0
+@@ -1090,7 +1090,7 @@ This module also includes these constant
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Eigen.pm.2.1
++++ b/pm/Math/GSL/Eigen.pm.2.1
+@@ -1090,7 +1090,7 @@ This module also includes these constant
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Eigen.pm.2.2
++++ b/pm/Math/GSL/Eigen.pm.2.2
+@@ -1090,7 +1090,7 @@ This module also includes these constant
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+--- a/pm/Math/GSL/Eigen.pm.2.2.1
++++ b/pm/Math/GSL/Eigen.pm.2.2.1
+@@ -1090,7 +1090,7 @@ This module also includes these constant
+
+ =back
+
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/ODEIV.pm.1.16 b/pm/Math/GSL/ODEIV.pm.1.16
-index 10ec745..edcbfbd 100644
---- a/pm/Math/GSL/ODEIV.pm.1.16
-+++ b/pm/Math/GSL/ODEIV.pm.1.16
-@@ -554,7 +554,7 @@ This module also includes the following constants :
+
+--- a/pm/Math/GSL/FFT.pm.2.0
++++ b/pm/Math/GSL/FFT.pm.2.0
+@@ -985,7 +985,7 @@ This module also includes the following
=back
@@ -4473,881 +4337,860 @@ index 10ec745..edcbfbd 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Permutation.pm.1.11 b/pm/Math/GSL/Permutation.pm.1.11
-index 5f71f96..9e8010b 100644
---- a/pm/Math/GSL/Permutation.pm.1.11
-+++ b/pm/Math/GSL/Permutation.pm.1.11
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+--- a/pm/Math/GSL/FFT.pm.2.1
++++ b/pm/Math/GSL/FFT.pm.2.1
+@@ -985,7 +985,7 @@ This module also includes the following
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
+ =back
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+--- a/pm/Math/GSL/FFT.pm.2.2
++++ b/pm/Math/GSL/FFT.pm.2.2
+@@ -985,7 +985,7 @@ This module also includes the following
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
+ =back
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
+--- a/pm/Math/GSL/FFT.pm.2.2.1
++++ b/pm/Math/GSL/FFT.pm.2.2.1
+@@ -985,7 +985,7 @@ This module also includes the following
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
+ =back
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+--- a/pm/Math/GSL/Fit.pm.2.0
++++ b/pm/Math/GSL/Fit.pm.2.0
+@@ -211,7 +211,7 @@ and y_err.
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+ =back
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/Fit.pm.2.1
++++ b/pm/Math/GSL/Fit.pm.2.1
+@@ -211,7 +211,7 @@ and y_err.
+ =back
-diff --git a/pm/Math/GSL/Permutation.pm.1.12 b/pm/Math/GSL/Permutation.pm.1.12
-index 5f71f96..9e8010b 100644
---- a/pm/Math/GSL/Permutation.pm.1.12
-+++ b/pm/Math/GSL/Permutation.pm.1.12
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+--- a/pm/Math/GSL/Fit.pm.2.2
++++ b/pm/Math/GSL/Fit.pm.2.2
+@@ -211,7 +211,7 @@ and y_err.
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
+ =back
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+--- a/pm/Math/GSL/Fit.pm.2.2.1
++++ b/pm/Math/GSL/Fit.pm.2.2.1
+@@ -211,7 +211,7 @@ and y_err.
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =back
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+--- a/pm/Math/GSL/Heapsort.pm.2.0
++++ b/pm/Math/GSL/Heapsort.pm.2.0
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+ =back
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+--- a/pm/Math/GSL/Heapsort.pm.2.1
++++ b/pm/Math/GSL/Heapsort.pm.2.1
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+ =back
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Permutation.pm.1.13 b/pm/Math/GSL/Permutation.pm.1.13
-index 5f71f96..9e8010b 100644
---- a/pm/Math/GSL/Permutation.pm.1.13
-+++ b/pm/Math/GSL/Permutation.pm.1.13
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+--- a/pm/Math/GSL/Heapsort.pm.2.2
++++ b/pm/Math/GSL/Heapsort.pm.2.2
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
+ =back
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+--- a/pm/Math/GSL/Heapsort.pm.2.2.1
++++ b/pm/Math/GSL/Heapsort.pm.2.2.1
+@@ -201,7 +201,7 @@ Here is a list of all the functions in t
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
+ =back
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
+--- a/pm/Math/GSL/Integration.pm.2.0
++++ b/pm/Math/GSL/Integration.pm.2.0
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
+ =head1 MORE INFO
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Integration.pm.2.1
++++ b/pm/Math/GSL/Integration.pm.2.1
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =head1 MORE INFO
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Integration.pm.2.2
++++ b/pm/Math/GSL/Integration.pm.2.2
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+ =head1 MORE INFO
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Integration.pm.2.2.1
++++ b/pm/Math/GSL/Integration.pm.2.2.1
+@@ -823,7 +823,7 @@ The integral is divergent, or too slowly
+
+ =head1 MORE INFO
+
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Linalg.pm.2.0
++++ b/pm/Math/GSL/Linalg.pm.2.0
+@@ -598,7 +598,7 @@ Here is a list of all the functions incl
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -620,7 +620,7 @@ Performs a Givens rotation on the $i and
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -644,9 +644,9 @@ Performs a Givens rotation on the $i and
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -680,27 +680,27 @@ Performs a Givens rotation on the $i and
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
+@@ -811,9 +811,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
+
+
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+
+ =back
+--- a/pm/Math/GSL/Linalg.pm.2.1
++++ b/pm/Math/GSL/Linalg.pm.2.1
+@@ -598,7 +598,7 @@ Here is a list of all the functions incl
+ =item gsl_linalg_complex_householder_transform
-diff --git a/pm/Math/GSL/Permutation.pm.1.14 b/pm/Math/GSL/Permutation.pm.1.14
-index 5f71f96..9e8010b 100644
---- a/pm/Math/GSL/Permutation.pm.1.14
-+++ b/pm/Math/GSL/Permutation.pm.1.14
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+@@ -620,7 +620,7 @@ Performs a Givens rotation on the $i and
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+@@ -644,9 +644,9 @@ Performs a Givens rotation on the $i and
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+@@ -680,27 +680,27 @@ Performs a Givens rotation on the $i and
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/Permutation.pm.1.15 b/pm/Math/GSL/Permutation.pm.1.15
-index 5f71f96..9e8010b 100644
---- a/pm/Math/GSL/Permutation.pm.1.15
-+++ b/pm/Math/GSL/Permutation.pm.1.15
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
+@@ -811,9 +811,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =back
+--- a/pm/Math/GSL/Linalg.pm.2.2
++++ b/pm/Math/GSL/Linalg.pm.2.2
+@@ -634,7 +634,7 @@ Here is a list of all the functions incl
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_complex_householder_transform
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -656,7 +656,7 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
-diff --git a/pm/Math/GSL/Permutation.pm.1.16 b/pm/Math/GSL/Permutation.pm.1.16
-index 5f71f96..9e8010b 100644
---- a/pm/Math/GSL/Permutation.pm.1.16
-+++ b/pm/Math/GSL/Permutation.pm.1.16
-@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -226,7 +226,7 @@ Here is a list of all the functions included in this module :
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+@@ -680,9 +680,9 @@ Performs a Givens rotation on the $i and
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
-@@ -242,7 +242,7 @@ Here is a list of all the functions included in this module :
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
+@@ -716,27 +716,27 @@ Performs a Givens rotation on the $i and
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
-@@ -252,13 +252,13 @@ Here is a list of all the functions included in this module :
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
-@@ -285,7 +285,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/Poly.pm.1.11 b/pm/Math/GSL/Poly.pm.1.11
-index b20b782..9a998bf 100644
---- a/pm/Math/GSL/Poly.pm.1.11
-+++ b/pm/Math/GSL/Poly.pm.1.11
-@@ -385,7 +385,7 @@ This function frees all the memory associated with the workspace $w.
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
- =back
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Poly.pm.1.12 b/pm/Math/GSL/Poly.pm.1.12
-index b20b782..9a998bf 100644
---- a/pm/Math/GSL/Poly.pm.1.12
-+++ b/pm/Math/GSL/Poly.pm.1.12
-@@ -385,7 +385,7 @@ This function frees all the memory associated with the workspace $w.
+@@ -847,9 +847,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
- =back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
+
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Poly.pm.1.13 b/pm/Math/GSL/Poly.pm.1.13
-index 1aa30ac..c71bbec 100644
---- a/pm/Math/GSL/Poly.pm.1.13
-+++ b/pm/Math/GSL/Poly.pm.1.13
-@@ -386,7 +386,7 @@ This function frees all the memory associated with the workspace $w.
=back
+--- a/pm/Math/GSL/Linalg.pm.2.2.1
++++ b/pm/Math/GSL/Linalg.pm.2.2.1
+@@ -634,7 +634,7 @@ Here is a list of all the functions incl
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item gsl_linalg_complex_householder_transform
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Poly.pm.1.14 b/pm/Math/GSL/Poly.pm.1.14
-index 1aa30ac..c71bbec 100644
---- a/pm/Math/GSL/Poly.pm.1.14
-+++ b/pm/Math/GSL/Poly.pm.1.14
-@@ -386,7 +386,7 @@ This function frees all the memory associated with the workspace $w.
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
- =back
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -656,7 +656,7 @@ Performs a Givens rotation on the $i and
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Poly.pm.1.15 b/pm/Math/GSL/Poly.pm.1.15
-index 1aa30ac..c71bbec 100644
---- a/pm/Math/GSL/Poly.pm.1.15
-+++ b/pm/Math/GSL/Poly.pm.1.15
-@@ -386,7 +386,7 @@ This function frees all the memory associated with the workspace $w.
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
- =back
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/Poly.pm.1.16 b/pm/Math/GSL/Poly.pm.1.16
-index f3d9d07..5c17c45 100644
---- a/pm/Math/GSL/Poly.pm.1.16
-+++ b/pm/Math/GSL/Poly.pm.1.16
-@@ -387,7 +387,7 @@ This function frees all the memory associated with the workspace $w.
+@@ -680,9 +680,9 @@ Performs a Givens rotation on the $i and
- =back
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
- =head1 AUTHORS
-diff --git a/pm/Math/GSL/QRNG.pm.1.11 b/pm/Math/GSL/QRNG.pm.1.11
-index 69cc7db..f636132 100644
---- a/pm/Math/GSL/QRNG.pm.1.11
-+++ b/pm/Math/GSL/QRNG.pm.1.11
-@@ -349,7 +349,7 @@ This module also contains the following constants :
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
- =back
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -716,27 +716,27 @@ Performs a Givens rotation on the $i and
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/QRNG.pm.1.12 b/pm/Math/GSL/QRNG.pm.1.12
-index 69cc7db..f636132 100644
---- a/pm/Math/GSL/QRNG.pm.1.12
-+++ b/pm/Math/GSL/QRNG.pm.1.12
-@@ -349,7 +349,7 @@ This module also contains the following constants :
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
- =back
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/QRNG.pm.1.13 b/pm/Math/GSL/QRNG.pm.1.13
-index 69cc7db..f636132 100644
---- a/pm/Math/GSL/QRNG.pm.1.13
-+++ b/pm/Math/GSL/QRNG.pm.1.13
-@@ -349,7 +349,7 @@ This module also contains the following constants :
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
- =back
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+@@ -847,9 +847,9 @@ Performs a Givens rotation on the $i and
+ =item gsl_linalg_balance_columns
-diff --git a/pm/Math/GSL/QRNG.pm.1.14 b/pm/Math/GSL/QRNG.pm.1.14
-index 69cc7db..f636132 100644
---- a/pm/Math/GSL/QRNG.pm.1.14
-+++ b/pm/Math/GSL/QRNG.pm.1.14
-@@ -349,7 +349,7 @@ This module also contains the following constants :
- =back
+- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
++ You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all available functions of the module.
-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/QRNG.pm.1.15 b/pm/Math/GSL/QRNG.pm.1.15
-index 69cc7db..f636132 100644
---- a/pm/Math/GSL/QRNG.pm.1.15
-+++ b/pm/Math/GSL/QRNG.pm.1.15
-@@ -349,7 +349,7 @@ This module also contains the following constants :
-
=back
+--- a/pm/Math/GSL/Matrix.pm.2.0
++++ b/pm/Math/GSL/Matrix.pm.2.0
+@@ -1465,7 +1465,7 @@ Math::GSL::Matrix - Mathematical functio
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2411,11 +2411,11 @@ Here is a list of all the functions incl
+ =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+-=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/QRNG.pm.1.16 b/pm/Math/GSL/QRNG.pm.1.16
-index 69cc7db..f636132 100644
---- a/pm/Math/GSL/QRNG.pm.1.16
-+++ b/pm/Math/GSL/QRNG.pm.1.16
-@@ -349,7 +349,7 @@ This module also contains the following constants :
+-=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+@@ -2435,7 +2435,7 @@ Here is a list of all the functions incl
+ =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
-diff --git a/pm/Math/GSL/RNG.pm.1.11 b/pm/Math/GSL/RNG.pm.1.11
-index 6bcd38b..5fc1964 100644
---- a/pm/Math/GSL/RNG.pm.1.11
-+++ b/pm/Math/GSL/RNG.pm.1.11
-@@ -886,7 +886,7 @@ __END__
+-=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
++=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
- =back
+ =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
+@@ -2455,13 +2455,13 @@ Here is a list of all the functions incl
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-diff --git a/pm/Math/GSL/RNG.pm.1.12 b/pm/Math/GSL/RNG.pm.1.12
-index 6bcd38b..5fc1964 100644
---- a/pm/Math/GSL/RNG.pm.1.12
-+++ b/pm/Math/GSL/RNG.pm.1.12
-@@ -886,7 +886,7 @@ __END__
+-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
- =back
+-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
+-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/RNG.pm.1.13 b/pm/Math/GSL/RNG.pm.1.13
-index 6bcd38b..5fc1964 100644
---- a/pm/Math/GSL/RNG.pm.1.13
-+++ b/pm/Math/GSL/RNG.pm.1.13
-@@ -886,7 +886,7 @@ __END__
+ =back
+@@ -2746,8 +2746,8 @@ sure if anyone wants these. Please speak
=back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =over 1
-diff --git a/pm/Math/GSL/RNG.pm.1.14 b/pm/Math/GSL/RNG.pm.1.14
-index 6bcd38b..5fc1964 100644
---- a/pm/Math/GSL/RNG.pm.1.14
-+++ b/pm/Math/GSL/RNG.pm.1.14
-@@ -886,7 +886,7 @@ __END__
+@@ -2763,7 +2763,7 @@ Other tags are also avaible, here is a c
=back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
-
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/RNG.pm.1.15 b/pm/Math/GSL/RNG.pm.1.15
-index 6bcd38b..5fc1964 100644
---- a/pm/Math/GSL/RNG.pm.1.15
-+++ b/pm/Math/GSL/RNG.pm.1.15
-@@ -886,7 +886,7 @@ __END__
-
- =back
-
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/Matrix.pm.2.1
++++ b/pm/Math/GSL/Matrix.pm.2.1
+@@ -1465,7 +1465,7 @@ Math::GSL::Matrix - Mathematical functio
-diff --git a/pm/Math/GSL/RNG.pm.1.16 b/pm/Math/GSL/RNG.pm.1.16
-index 6bcd38b..5fc1964 100644
---- a/pm/Math/GSL/RNG.pm.1.16
-+++ b/pm/Math/GSL/RNG.pm.1.16
-@@ -886,7 +886,7 @@ __END__
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2411,11 +2411,11 @@ Here is a list of all the functions incl
- =back
+ =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
+-=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/Randist.pm.1.11 b/pm/Math/GSL/Randist.pm.1.11
-index b97a8f4..522acdc 100644
---- a/pm/Math/GSL/Randist.pm.1.11
-+++ b/pm/Math/GSL/Randist.pm.1.11
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+-=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+ =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -2435,7 +2435,7 @@ Here is a list of all the functions incl
+ =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
-diff --git a/pm/Math/GSL/Randist.pm.1.12 b/pm/Math/GSL/Randist.pm.1.12
-index b97a8f4..522acdc 100644
---- a/pm/Math/GSL/Randist.pm.1.12
-+++ b/pm/Math/GSL/Randist.pm.1.12
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+-=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
++=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+ =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -2455,13 +2455,13 @@ Here is a list of all the functions incl
+ =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-diff --git a/pm/Math/GSL/Randist.pm.1.13 b/pm/Math/GSL/Randist.pm.1.13
-index b97a8f4..522acdc 100644
---- a/pm/Math/GSL/Randist.pm.1.13
-+++ b/pm/Math/GSL/Randist.pm.1.13
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/Randist.pm.1.14 b/pm/Math/GSL/Randist.pm.1.14
-index b97a8f4..522acdc 100644
---- a/pm/Math/GSL/Randist.pm.1.14
-+++ b/pm/Math/GSL/Randist.pm.1.14
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+ =back
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+@@ -2746,8 +2746,8 @@ sure if anyone wants these. Please speak
+ =back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+ =over 1
-diff --git a/pm/Math/GSL/Randist.pm.1.15 b/pm/Math/GSL/Randist.pm.1.15
-index b97a8f4..522acdc 100644
---- a/pm/Math/GSL/Randist.pm.1.15
-+++ b/pm/Math/GSL/Randist.pm.1.15
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+@@ -2763,7 +2763,7 @@ Other tags are also avaible, here is a c
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+ =back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Randist.pm.1.16 b/pm/Math/GSL/Randist.pm.1.16
-index b97a8f4..522acdc 100644
---- a/pm/Math/GSL/Randist.pm.1.16
-+++ b/pm/Math/GSL/Randist.pm.1.16
-@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+--- a/pm/Math/GSL/Matrix.pm.2.2
++++ b/pm/Math/GSL/Matrix.pm.2.2
+@@ -1473,7 +1473,7 @@ Math::GSL::Matrix - Mathematical functio
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2419,11 +2419,11 @@ Here is a list of all the functions incl
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+-=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/SF.pm.1.11 b/pm/Math/GSL/SF.pm.1.11
-index 6859d17..2df74f1 100644
---- a/pm/Math/GSL/SF.pm.1.11
-+++ b/pm/Math/GSL/SF.pm.1.11
-@@ -2355,7 +2355,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+-=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
- =over
+-=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+ =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
- =item C<gsl_sf_erfc_e($x, $result)>
+@@ -2443,7 +2443,7 @@ Here is a list of all the functions incl
-@@ -3883,7 +3883,7 @@ This module also contains the following constants used as mode in various of tho
+ =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
- =back
+-=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
++=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
+@@ -2463,13 +2463,13 @@ Here is a list of all the functions incl
-diff --git a/pm/Math/GSL/SF.pm.1.12 b/pm/Math/GSL/SF.pm.1.12
-index db604a0..600fedd 100644
---- a/pm/Math/GSL/SF.pm.1.12
-+++ b/pm/Math/GSL/SF.pm.1.12
-@@ -2356,7 +2356,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+ =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
- =over
+-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
- =item C<gsl_sf_erfc_e($x, $result)>
+-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-@@ -3884,7 +3884,7 @@ This module also contains the following constants used as mode in various of tho
+-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-
-diff --git a/pm/Math/GSL/SF.pm.1.13 b/pm/Math/GSL/SF.pm.1.13
-index db604a0..600fedd 100644
---- a/pm/Math/GSL/SF.pm.1.13
-+++ b/pm/Math/GSL/SF.pm.1.13
-@@ -2356,7 +2356,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
-
- =over
+@@ -2754,8 +2754,8 @@ sure if anyone wants these. Please speak
+ =back
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
- =item C<gsl_sf_erfc_e($x, $result)>
+ =over 1
-@@ -3884,7 +3884,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2771,7 +2771,7 @@ Other tags are also avaible, here is a c
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/SF.pm.1.14 b/pm/Math/GSL/SF.pm.1.14
-index db604a0..600fedd 100644
---- a/pm/Math/GSL/SF.pm.1.14
-+++ b/pm/Math/GSL/SF.pm.1.14
-@@ -2356,7 +2356,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+--- a/pm/Math/GSL/Matrix.pm.2.2.1
++++ b/pm/Math/GSL/Matrix.pm.2.2.1
+@@ -1473,7 +1473,7 @@ Math::GSL::Matrix - Mathematical functio
- =over
+ use Math::GSL::Matrix qw/:all/;
+ my $matrix1 = Math::GSL::Matrix->new(5,5); # OO interface
+- my $matrix2 = $matrix1 + 4; # You can add or substract values or matrices to OO matrices
++ my $matrix2 = $matrix1 + 4; # You can add or subtract values or matrices to OO matrices
+ my $matrix3 = $matrix1 - 4;
+ my $matrix4 = $matrix2 + $matrix1;
+ my $matrix5 = $matrix2 . $matrix1; # This is a scalar product, it simply multiply each element
+@@ -2419,11 +2419,11 @@ Here is a list of all the functions incl
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+ =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
- =item C<gsl_sf_erfc_e($x, $result)>
+-=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
-@@ -3884,7 +3884,7 @@ This module also contains the following constants used as mode in various of tho
+-=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
- =back
+-=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
++=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+@@ -2443,7 +2443,7 @@ Here is a list of all the functions incl
-diff --git a/pm/Math/GSL/SF.pm.1.15 b/pm/Math/GSL/SF.pm.1.15
-index 0441f70..0ba8a98 100644
---- a/pm/Math/GSL/SF.pm.1.15
-+++ b/pm/Math/GSL/SF.pm.1.15
-@@ -2357,7 +2357,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+ =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
- =over
+-=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
++=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+ =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
- =item C<gsl_sf_erfc_e($x, $result)>
+@@ -2463,13 +2463,13 @@ Here is a list of all the functions incl
-@@ -3885,7 +3885,7 @@ This module also contains the following constants used as mode in various of tho
+ =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
- =back
+-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-diff --git a/pm/Math/GSL/SF.pm.1.16 b/pm/Math/GSL/SF.pm.1.16
-index 0441f70..0ba8a98 100644
---- a/pm/Math/GSL/SF.pm.1.16
-+++ b/pm/Math/GSL/SF.pm.1.16
-@@ -2357,7 +2357,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
- =over
+ =back
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+@@ -2754,8 +2754,8 @@ sure if anyone wants these. Please speak
+ =back
- =item C<gsl_sf_erfc_e($x, $result)>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Matrix qw/:all/ to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Matrix qw/:all/ to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
-@@ -3885,7 +3885,7 @@ This module also contains the following constants used as mode in various of tho
+ =over 1
+
+@@ -2771,7 +2771,7 @@ Other tags are also avaible, here is a c
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+--- a/pm/Math/GSL/MatrixComplex.pm.2.0
++++ b/pm/Math/GSL/MatrixComplex.pm.2.0
+@@ -1274,7 +1274,7 @@ sub lndet($)
-diff --git a/pm/Math/GSL/Siman.pm.1.11 b/pm/Math/GSL/Siman.pm.1.11
-index 5e4dc1c..4dffca0 100644
---- a/pm/Math/GSL/Siman.pm.1.11
-+++ b/pm/Math/GSL/Siman.pm.1.11
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
=back
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/MatrixComplex.pm.2.1
++++ b/pm/Math/GSL/MatrixComplex.pm.2.1
+@@ -1274,7 +1274,7 @@ sub lndet($)
-diff --git a/pm/Math/GSL/Siman.pm.1.12 b/pm/Math/GSL/Siman.pm.1.12
-index 5e4dc1c..4dffca0 100644
---- a/pm/Math/GSL/Siman.pm.1.12
-+++ b/pm/Math/GSL/Siman.pm.1.12
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
=back
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/MatrixComplex.pm.2.2
++++ b/pm/Math/GSL/MatrixComplex.pm.2.2
+@@ -1276,7 +1276,7 @@ sub lndet($)
-diff --git a/pm/Math/GSL/Siman.pm.1.13 b/pm/Math/GSL/Siman.pm.1.13
-index 5e4dc1c..4dffca0 100644
---- a/pm/Math/GSL/Siman.pm.1.13
-+++ b/pm/Math/GSL/Siman.pm.1.13
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
=back
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/MatrixComplex.pm.2.2.1
++++ b/pm/Math/GSL/MatrixComplex.pm.2.2.1
+@@ -1276,7 +1276,7 @@ sub lndet($)
-diff --git a/pm/Math/GSL/Siman.pm.1.14 b/pm/Math/GSL/Siman.pm.1.14
-index 5e4dc1c..4dffca0 100644
---- a/pm/Math/GSL/Siman.pm.1.14
-+++ b/pm/Math/GSL/Siman.pm.1.14
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
=back
+-For more informations on the functions, we refer you to the GSL offcial documentation
++For more information on the functions, we refer you to the GSL offcial documentation
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/Min.pm.2.0
++++ b/pm/Math/GSL/Min.pm.2.0
+@@ -483,7 +483,7 @@ This module also includes the following
-diff --git a/pm/Math/GSL/Siman.pm.1.15 b/pm/Math/GSL/Siman.pm.1.15
-index 5e4dc1c..4dffca0 100644
---- a/pm/Math/GSL/Siman.pm.1.15
-+++ b/pm/Math/GSL/Siman.pm.1.15
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
=back
-
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Min.pm.2.1
++++ b/pm/Math/GSL/Min.pm.2.1
+@@ -483,7 +483,7 @@ This module also includes the following
-diff --git a/pm/Math/GSL/Siman.pm.1.16 b/pm/Math/GSL/Siman.pm.1.16
-index 5e4dc1c..4dffca0 100644
---- a/pm/Math/GSL/Siman.pm.1.16
-+++ b/pm/Math/GSL/Siman.pm.1.16
-@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
=back
-
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Sort.pm.1.11 b/pm/Math/GSL/Sort.pm.1.11
-index 347942c..8a540f1 100644
---- a/pm/Math/GSL/Sort.pm.1.11
-+++ b/pm/Math/GSL/Sort.pm.1.11
-@@ -285,7 +285,7 @@ should be removed in further versions.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Min.pm.2.2
++++ b/pm/Math/GSL/Min.pm.2.2
+@@ -483,7 +483,7 @@ This module also includes the following
=back
@@ -5355,12 +5198,10 @@ index 347942c..8a540f1 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 PERFORMANCE
-diff --git a/pm/Math/GSL/Sort.pm.1.12 b/pm/Math/GSL/Sort.pm.1.12
-index 347942c..8a540f1 100644
---- a/pm/Math/GSL/Sort.pm.1.12
-+++ b/pm/Math/GSL/Sort.pm.1.12
-@@ -285,7 +285,7 @@ should be removed in further versions.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Min.pm.2.2.1
++++ b/pm/Math/GSL/Min.pm.2.2.1
+@@ -483,7 +483,7 @@ This module also includes the following
=back
@@ -5368,12 +5209,10 @@ index 347942c..8a540f1 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 PERFORMANCE
-diff --git a/pm/Math/GSL/Sort.pm.1.13 b/pm/Math/GSL/Sort.pm.1.13
-index 347942c..8a540f1 100644
---- a/pm/Math/GSL/Sort.pm.1.13
-+++ b/pm/Math/GSL/Sort.pm.1.13
-@@ -285,7 +285,7 @@ should be removed in further versions.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Monte.pm.2.0
++++ b/pm/Math/GSL/Monte.pm.2.0
+@@ -559,7 +559,7 @@ This module also includes the following
=back
@@ -5381,12 +5220,10 @@ index 347942c..8a540f1 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 PERFORMANCE
-diff --git a/pm/Math/GSL/Sort.pm.1.14 b/pm/Math/GSL/Sort.pm.1.14
-index 347942c..8a540f1 100644
---- a/pm/Math/GSL/Sort.pm.1.14
-+++ b/pm/Math/GSL/Sort.pm.1.14
-@@ -285,7 +285,7 @@ should be removed in further versions.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Monte.pm.2.1
++++ b/pm/Math/GSL/Monte.pm.2.1
+@@ -559,7 +559,7 @@ This module also includes the following
=back
@@ -5394,12 +5231,10 @@ index 347942c..8a540f1 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 PERFORMANCE
-diff --git a/pm/Math/GSL/Sort.pm.1.15 b/pm/Math/GSL/Sort.pm.1.15
-index 347942c..8a540f1 100644
---- a/pm/Math/GSL/Sort.pm.1.15
-+++ b/pm/Math/GSL/Sort.pm.1.15
-@@ -285,7 +285,7 @@ should be removed in further versions.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Monte.pm.2.2
++++ b/pm/Math/GSL/Monte.pm.2.2
+@@ -559,7 +559,7 @@ This module also includes the following
=back
@@ -5407,12 +5242,10 @@ index 347942c..8a540f1 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 PERFORMANCE
-diff --git a/pm/Math/GSL/Sort.pm.1.16 b/pm/Math/GSL/Sort.pm.1.16
-index a1c9564..8dcebda 100644
---- a/pm/Math/GSL/Sort.pm.1.16
-+++ b/pm/Math/GSL/Sort.pm.1.16
-@@ -286,7 +286,7 @@ should be removed in further versions.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Monte.pm.2.2.1
++++ b/pm/Math/GSL/Monte.pm.2.2.1
+@@ -559,7 +559,7 @@ This module also includes the following
=back
@@ -5420,12 +5253,10 @@ index a1c9564..8dcebda 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 PERFORMANCE
-diff --git a/pm/Math/GSL/Spline.pm.1.11 b/pm/Math/GSL/Spline.pm.1.11
-index 7915b03..44de917 100644
---- a/pm/Math/GSL/Spline.pm.1.11
-+++ b/pm/Math/GSL/Spline.pm.1.11
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Multifit.pm.2.0
++++ b/pm/Math/GSL/Multifit.pm.2.0
+@@ -1144,7 +1144,7 @@ The following functions are not yet impl
=back
@@ -5434,11 +5265,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Spline.pm.1.12 b/pm/Math/GSL/Spline.pm.1.12
-index 7915b03..44de917 100644
---- a/pm/Math/GSL/Spline.pm.1.12
-+++ b/pm/Math/GSL/Spline.pm.1.12
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+--- a/pm/Math/GSL/Multifit.pm.2.1
++++ b/pm/Math/GSL/Multifit.pm.2.1
+@@ -1146,7 +1146,7 @@ The following functions are not yet impl
=back
@@ -5447,11 +5276,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Spline.pm.1.13 b/pm/Math/GSL/Spline.pm.1.13
-index 7915b03..44de917 100644
---- a/pm/Math/GSL/Spline.pm.1.13
-+++ b/pm/Math/GSL/Spline.pm.1.13
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+--- a/pm/Math/GSL/Multifit.pm.2.2
++++ b/pm/Math/GSL/Multifit.pm.2.2
+@@ -1146,7 +1146,7 @@ The following functions are not yet impl
=back
@@ -5460,11 +5287,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Spline.pm.1.14 b/pm/Math/GSL/Spline.pm.1.14
-index 7915b03..44de917 100644
---- a/pm/Math/GSL/Spline.pm.1.14
-+++ b/pm/Math/GSL/Spline.pm.1.14
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+--- a/pm/Math/GSL/Multifit.pm.2.2.1
++++ b/pm/Math/GSL/Multifit.pm.2.2.1
+@@ -1146,7 +1146,7 @@ The following functions are not yet impl
=back
@@ -5473,11 +5298,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Spline.pm.1.15 b/pm/Math/GSL/Spline.pm.1.15
-index 7915b03..44de917 100644
---- a/pm/Math/GSL/Spline.pm.1.15
-+++ b/pm/Math/GSL/Spline.pm.1.15
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+--- a/pm/Math/GSL/Multilarge.pm.2.1
++++ b/pm/Math/GSL/Multilarge.pm.2.1
+@@ -847,7 +847,7 @@ The following functions are not yet impl
=back
@@ -5486,11 +5309,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Spline.pm.1.16 b/pm/Math/GSL/Spline.pm.1.16
-index 7915b03..44de917 100644
---- a/pm/Math/GSL/Spline.pm.1.16
-+++ b/pm/Math/GSL/Spline.pm.1.16
-@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
+--- a/pm/Math/GSL/Multilarge.pm.2.2
++++ b/pm/Math/GSL/Multilarge.pm.2.2
+@@ -848,7 +848,7 @@ The following functions are not yet impl
=back
@@ -5499,20 +5320,9 @@ index 7915b03..44de917 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Statistics.pm.1.11 b/pm/Math/GSL/Statistics.pm.1.11
-index df4f66e..80b0d96 100644
---- a/pm/Math/GSL/Statistics.pm.1.11
-+++ b/pm/Math/GSL/Statistics.pm.1.11
-@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
-
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-
-@@ -557,7 +557,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/Multilarge.pm.2.2.1
++++ b/pm/Math/GSL/Multilarge.pm.2.2.1
+@@ -848,7 +848,7 @@ The following functions are not yet impl
=back
@@ -5521,20 +5331,9 @@ index df4f66e..80b0d96 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Statistics.pm.1.12 b/pm/Math/GSL/Statistics.pm.1.12
-index df4f66e..80b0d96 100644
---- a/pm/Math/GSL/Statistics.pm.1.12
-+++ b/pm/Math/GSL/Statistics.pm.1.12
-@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
-
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-
-@@ -557,7 +557,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/Multimin.pm.2.0
++++ b/pm/Math/GSL/Multimin.pm.2.0
+@@ -558,7 +558,7 @@ This module also includes the following
=back
@@ -5543,20 +5342,9 @@ index df4f66e..80b0d96 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Statistics.pm.1.13 b/pm/Math/GSL/Statistics.pm.1.13
-index df4f66e..80b0d96 100644
---- a/pm/Math/GSL/Statistics.pm.1.13
-+++ b/pm/Math/GSL/Statistics.pm.1.13
-@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
-
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-
-@@ -557,7 +557,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/Multimin.pm.2.1
++++ b/pm/Math/GSL/Multimin.pm.2.1
+@@ -558,7 +558,7 @@ This module also includes the following
=back
@@ -5565,20 +5353,9 @@ index df4f66e..80b0d96 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Statistics.pm.1.14 b/pm/Math/GSL/Statistics.pm.1.14
-index df4f66e..80b0d96 100644
---- a/pm/Math/GSL/Statistics.pm.1.14
-+++ b/pm/Math/GSL/Statistics.pm.1.14
-@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
-
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-
-@@ -557,7 +557,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/Multimin.pm.2.2
++++ b/pm/Math/GSL/Multimin.pm.2.2
+@@ -558,7 +558,7 @@ This module also includes the following
=back
@@ -5587,20 +5364,9 @@ index df4f66e..80b0d96 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Statistics.pm.1.15 b/pm/Math/GSL/Statistics.pm.1.15
-index df4f66e..80b0d96 100644
---- a/pm/Math/GSL/Statistics.pm.1.15
-+++ b/pm/Math/GSL/Statistics.pm.1.15
-@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
-
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-
-@@ -557,7 +557,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/Multimin.pm.2.2.1
++++ b/pm/Math/GSL/Multimin.pm.2.2.1
+@@ -558,7 +558,7 @@ This module also includes the following
=back
@@ -5609,20 +5375,9 @@ index df4f66e..80b0d96 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pm/Math/GSL/Statistics.pm.1.16 b/pm/Math/GSL/Statistics.pm.1.16
-index 5e6685b..76f1ddb 100644
---- a/pm/Math/GSL/Statistics.pm.1.16
-+++ b/pm/Math/GSL/Statistics.pm.1.16
-@@ -364,7 +364,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
-
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
-
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
-
-@@ -558,7 +558,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+--- a/pm/Math/GSL/Multiroots.pm.2.0
++++ b/pm/Math/GSL/Multiroots.pm.2.0
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -5630,12 +5385,10 @@ index 5e6685b..76f1ddb 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pm/Math/GSL/Sys.pm.1.11 b/pm/Math/GSL/Sys.pm.1.11
-index 0fdd86f..8a12e35 100644
---- a/pm/Math/GSL/Sys.pm.1.11
-+++ b/pm/Math/GSL/Sys.pm.1.11
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Multiroots.pm.2.1
++++ b/pm/Math/GSL/Multiroots.pm.2.1
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -5644,11 +5397,9 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Sys.pm.1.12 b/pm/Math/GSL/Sys.pm.1.12
-index 0fdd86f..8a12e35 100644
---- a/pm/Math/GSL/Sys.pm.1.12
-+++ b/pm/Math/GSL/Sys.pm.1.12
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+--- a/pm/Math/GSL/Multiroots.pm.2.2
++++ b/pm/Math/GSL/Multiroots.pm.2.2
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -5657,11 +5408,9 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Sys.pm.1.13 b/pm/Math/GSL/Sys.pm.1.13
-index 0fdd86f..8a12e35 100644
---- a/pm/Math/GSL/Sys.pm.1.13
-+++ b/pm/Math/GSL/Sys.pm.1.13
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+--- a/pm/Math/GSL/Multiroots.pm.2.2.1
++++ b/pm/Math/GSL/Multiroots.pm.2.2.1
+@@ -542,7 +542,7 @@ Here is a list of all the functions in t
=back
@@ -5670,11 +5419,9 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Sys.pm.1.14 b/pm/Math/GSL/Sys.pm.1.14
-index 0fdd86f..8a12e35 100644
---- a/pm/Math/GSL/Sys.pm.1.14
-+++ b/pm/Math/GSL/Sys.pm.1.14
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+--- a/pm/Math/GSL/NTuple.pm.2.0
++++ b/pm/Math/GSL/NTuple.pm.2.0
+@@ -449,7 +449,7 @@ memory.
=back
@@ -5683,11 +5430,9 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Sys.pm.1.15 b/pm/Math/GSL/Sys.pm.1.15
-index 0fdd86f..8a12e35 100644
---- a/pm/Math/GSL/Sys.pm.1.15
-+++ b/pm/Math/GSL/Sys.pm.1.15
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+--- a/pm/Math/GSL/NTuple.pm.2.1
++++ b/pm/Math/GSL/NTuple.pm.2.1
+@@ -449,7 +449,7 @@ memory.
=back
@@ -5696,11 +5441,9 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Sys.pm.1.16 b/pm/Math/GSL/Sys.pm.1.16
-index 0fdd86f..8a12e35 100644
---- a/pm/Math/GSL/Sys.pm.1.16
-+++ b/pm/Math/GSL/Sys.pm.1.16
-@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+--- a/pm/Math/GSL/NTuple.pm.2.2
++++ b/pm/Math/GSL/NTuple.pm.2.2
+@@ -449,7 +449,7 @@ memory.
=back
@@ -5709,737 +5452,665 @@ index 0fdd86f..8a12e35 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pm/Math/GSL/Vector.pm.1.11 b/pm/Math/GSL/Vector.pm.1.11
-index b02dbad..c3513d1 100644
---- a/pm/Math/GSL/Vector.pm.1.11
-+++ b/pm/Math/GSL/Vector.pm.1.11
-@@ -1223,7 +1223,7 @@ set all the elements of $v to $x
- =item C<gsl_vector_set_basis($v, $i)>
-
- set all the elements of $v to 0 except for the $i-th element which is set to 1
--and return 0 if the operation succeded, 1 otherwise.
-+and return 0 if the operation succeeded, 1 otherwise.
-
- =item C<gsl_vector_fread($file, $v)>
-
-@@ -1260,23 +1260,23 @@ success and 1 if there was a problem writing to the file.
- =item C<gsl_vector_memcpy($dest, $src)>
-
- This function copies the elements of the vector $src into the vector $dest and
--return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
- same length.
-
- =item C<gsl_vector_reverse($v)>
-
- reverse the order of the elements of the vector $v and return 0 if the
--opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
-
- =item C<gsl_vector_swap($v, $v2)>
-
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
--succeded, 1 otherwise
-+succeeded, 1 otherwise
-
- =item C<gsl_vector_swap_elements($v, $i, $j)>
-
- permute the elements at position $i and $j in the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
-
- =item C<gsl_vector_max($v)>
-
-@@ -1307,32 +1307,32 @@ $v and the second is the position of the maximum value.
- =item C<gsl_vector_add($v, $v2)>
-
- add the elements of $v2 to the elements of $v, the two vectors must have the
--same length and return 0 if the operation succeded, 1 otherwise.
-+same length and return 0 if the operation succeeded, 1 otherwise.
-
- =item C<gsl_vector_sub($v, $v2)>
-
- substract the elements of $v2 from the elements of $v, the two vectors must
--have the same length and return 0 if the operation succeded, 1 otherwise.
-+have the same length and return 0 if the operation succeeded, 1 otherwise.
-
- =item C<gsl_vector_mul($v, $v2)>
-
- multiply the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
-
- =item C<gsl_vector_div($v, $v2)>
+--- a/pm/Math/GSL/NTuple.pm.2.2.1
++++ b/pm/Math/GSL/NTuple.pm.2.2.1
+@@ -449,7 +449,7 @@ memory.
- divides the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_vector_scale($v, $x)>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- multiplty the elements of the vector $v by a constant $x and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/ODEIV.pm.2.0
++++ b/pm/Math/GSL/ODEIV.pm.2.0
+@@ -596,7 +596,7 @@ This module also includes the following
- =item C<gsl_vector_add_constant($v, $x)>
+ =back
- add a constant $x to the elements of the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_isnull($v)>
-@@ -1369,7 +1369,7 @@ leaving the odd elements untouched :
+--- a/pm/Math/GSL/ODEIV.pm.2.1
++++ b/pm/Math/GSL/ODEIV.pm.2.1
+@@ -596,7 +596,7 @@ This module also includes the following
=back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
- =head1 EXAMPLES
-diff --git a/pm/Math/GSL/Vector.pm.1.12 b/pm/Math/GSL/Vector.pm.1.12
-index c490438..5579c36 100644
---- a/pm/Math/GSL/Vector.pm.1.12
-+++ b/pm/Math/GSL/Vector.pm.1.12
-@@ -1230,7 +1230,7 @@ set all the elements of $v to $x
- =item C<gsl_vector_set_basis($v, $i)>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- set all the elements of $v to 0 except for the $i-th element which is set to 1
--and return 0 if the operation succeded, 1 otherwise.
-+and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_vector_fread($file, $v)>
+--- a/pm/Math/GSL/ODEIV.pm.2.2
++++ b/pm/Math/GSL/ODEIV.pm.2.2
+@@ -596,7 +596,7 @@ This module also includes the following
-@@ -1267,23 +1267,23 @@ success and 1 if there was a problem writing to the file.
- =item C<gsl_vector_memcpy($dest, $src)>
+ =back
- This function copies the elements of the vector $src into the vector $dest and
--return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
- same length.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_reverse($v)>
- reverse the order of the elements of the vector $v and return 0 if the
--opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
+--- a/pm/Math/GSL/ODEIV.pm.2.2.1
++++ b/pm/Math/GSL/ODEIV.pm.2.2.1
+@@ -596,7 +596,7 @@ This module also includes the following
- =item C<gsl_vector_swap($v, $v2)>
+ =back
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
--succeded, 1 otherwise
-+succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_swap_elements($v, $i, $j)>
- permute the elements at position $i and $j in the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Permutation.pm.2.0
++++ b/pm/Math/GSL/Permutation.pm.2.0
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
- =item C<gsl_vector_max($v)>
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
-@@ -1314,32 +1314,32 @@ $v and the second is the position of the maximum value.
- =item C<gsl_vector_add($v, $v2)>
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
- add the elements of $v2 to the elements of $v, the two vectors must have the
--same length and return 0 if the operation succeded, 1 otherwise.
-+same length and return 0 if the operation succeeded, 1 otherwise.
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_sub($v, $v2)>
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
- substract the elements of $v2 from the elements of $v, the two vectors must
--have the same length and return 0 if the operation succeded, 1 otherwise.
-+have the same length and return 0 if the operation succeeded, 1 otherwise.
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
- =item C<gsl_vector_mul($v, $v2)>
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
- multiply the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_div($v, $v2)>
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
- divides the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
- =item C<gsl_vector_scale($v, $x)>
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- multiplty the elements of the vector $v by a constant $x and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_add_constant($v, $x)>
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
- add a constant $x to the elements of the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_isnull($v)>
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
-@@ -1376,7 +1376,7 @@ leaving the odd elements untouched :
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
=back
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 EXAMPLES
-diff --git a/pm/Math/GSL/Vector.pm.1.13 b/pm/Math/GSL/Vector.pm.1.13
-index c490438..5579c36 100644
---- a/pm/Math/GSL/Vector.pm.1.13
-+++ b/pm/Math/GSL/Vector.pm.1.13
-@@ -1230,7 +1230,7 @@ set all the elements of $v to $x
- =item C<gsl_vector_set_basis($v, $i)>
- set all the elements of $v to 0 except for the $i-th element which is set to 1
--and return 0 if the operation succeded, 1 otherwise.
-+and return 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Permutation.pm.2.1
++++ b/pm/Math/GSL/Permutation.pm.2.1
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
+
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
- =item C<gsl_vector_fread($file, $v)>
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
-@@ -1267,23 +1267,23 @@ success and 1 if there was a problem writing to the file.
- =item C<gsl_vector_memcpy($dest, $src)>
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- This function copies the elements of the vector $src into the vector $dest and
--return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
- same length.
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
- =item C<gsl_vector_reverse($v)>
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
- reverse the order of the elements of the vector $v and return 0 if the
--opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
- =item C<gsl_vector_swap($v, $v2)>
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
--succeded, 1 otherwise
-+succeeded, 1 otherwise
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
- =item C<gsl_vector_swap_elements($v, $i, $j)>
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
- permute the elements at position $i and $j in the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_max($v)>
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
-@@ -1314,32 +1314,32 @@ $v and the second is the position of the maximum value.
- =item C<gsl_vector_add($v, $v2)>
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
- add the elements of $v2 to the elements of $v, the two vectors must have the
--same length and return 0 if the operation succeded, 1 otherwise.
-+same length and return 0 if the operation succeeded, 1 otherwise.
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_sub($v, $v2)>
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
- substract the elements of $v2 from the elements of $v, the two vectors must
--have the same length and return 0 if the operation succeded, 1 otherwise.
-+have the same length and return 0 if the operation succeeded, 1 otherwise.
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
- =item C<gsl_vector_mul($v, $v2)>
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
+ =back
- multiply the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_div($v, $v2)>
- divides the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Permutation.pm.2.2
++++ b/pm/Math/GSL/Permutation.pm.2.2
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
- =item C<gsl_vector_scale($v, $x)>
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
- multiplty the elements of the vector $v by a constant $x and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
- =item C<gsl_vector_add_constant($v, $x)>
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- add a constant $x to the elements of the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
- =item C<gsl_vector_isnull($v)>
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
-@@ -1376,7 +1376,7 @@ leaving the odd elements untouched :
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
- =back
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
- =head1 EXAMPLES
-diff --git a/pm/Math/GSL/Vector.pm.1.14 b/pm/Math/GSL/Vector.pm.1.14
-index c490438..5579c36 100644
---- a/pm/Math/GSL/Vector.pm.1.14
-+++ b/pm/Math/GSL/Vector.pm.1.14
-@@ -1230,7 +1230,7 @@ set all the elements of $v to $x
- =item C<gsl_vector_set_basis($v, $i)>
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
- set all the elements of $v to 0 except for the $i-th element which is set to 1
--and return 0 if the operation succeded, 1 otherwise.
-+and return 0 if the operation succeeded, 1 otherwise.
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_fread($file, $v)>
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
-@@ -1267,23 +1267,23 @@ success and 1 if there was a problem writing to the file.
- =item C<gsl_vector_memcpy($dest, $src)>
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
- This function copies the elements of the vector $src into the vector $dest and
--return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
- same length.
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_reverse($v)>
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
- reverse the order of the elements of the vector $v and return 0 if the
--opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
- =item C<gsl_vector_swap($v, $v2)>
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
+ =back
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
--succeded, 1 otherwise
-+succeeded, 1 otherwise
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_swap_elements($v, $i, $j)>
- permute the elements at position $i and $j in the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Permutation.pm.2.2.1
++++ b/pm/Math/GSL/Permutation.pm.2.2.1
+@@ -269,7 +269,7 @@ Math::GSL::Permutation - functions for c
- =item C<gsl_vector_max($v)>
+ use Math::GSL::Permutation qw/:all/;
+ my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
+- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
++ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
+ gsl_permutation_swap($permutation->raw, 2,7);
+ # the raw method is made to use the underlying permutation structure of the permutation object
+ my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
+@@ -290,7 +290,7 @@ Here is a list of all the functions incl
-@@ -1314,32 +1314,32 @@ $v and the second is the position of the maximum value.
- =item C<gsl_vector_add($v, $v2)>
+ =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
- add the elements of $v2 to the elements of $v, the two vectors must have the
--same length and return 0 if the operation succeded, 1 otherwise.
-+same length and return 0 if the operation succeeded, 1 otherwise.
+-=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_sub($v, $v2)>
+ =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
- substract the elements of $v2 from the elements of $v, the two vectors must
--have the same length and return 0 if the operation succeded, 1 otherwise.
-+have the same length and return 0 if the operation succeeded, 1 otherwise.
+@@ -306,7 +306,7 @@ Here is a list of all the functions incl
- =item C<gsl_vector_mul($v, $v2)>
+ =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
- multiply the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+-=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_div($v, $v2)>
+ =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
- divides the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+@@ -316,13 +316,13 @@ Here is a list of all the functions incl
- =item C<gsl_vector_scale($v, $x)>
+ =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- multiplty the elements of the vector $v by a constant $x and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+-=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_add_constant($v, $x)>
+-=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
- add a constant $x to the elements of the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+-=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
- =item C<gsl_vector_isnull($v)>
+-=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
++=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
-@@ -1376,7 +1376,7 @@ leaving the odd elements untouched :
+ =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+@@ -347,9 +347,9 @@ Here is a list of all the functions incl
=back
+ You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
+- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module.
-For more informations on the functions, we refer you to the GSL offcial documentation:
++ You can also write use Math::GSL::CDF qw/:all/ to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module.
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 EXAMPLES
-diff --git a/pm/Math/GSL/Vector.pm.1.15 b/pm/Math/GSL/Vector.pm.1.15
-index b570be6..1dd9343 100644
---- a/pm/Math/GSL/Vector.pm.1.15
-+++ b/pm/Math/GSL/Vector.pm.1.15
-@@ -1234,7 +1234,7 @@ set all the elements of $v to $x
- =item C<gsl_vector_set_basis($v, $i)>
-
- set all the elements of $v to 0 except for the $i-th element which is set to 1
--and return 0 if the operation succeded, 1 otherwise.
-+and return 0 if the operation succeeded, 1 otherwise.
-
- =item C<gsl_vector_fread($file, $v)>
-@@ -1271,23 +1271,23 @@ success and 1 if there was a problem writing to the file.
- =item C<gsl_vector_memcpy($dest, $src)>
+--- a/pm/Math/GSL/Poly.pm.2.0
++++ b/pm/Math/GSL/Poly.pm.2.0
+@@ -429,7 +429,7 @@ This function frees all the memory assoc
- This function copies the elements of the vector $src into the vector $dest and
--return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
- same length.
+ =back
- =item C<gsl_vector_reverse($v)>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- reverse the order of the elements of the vector $v and return 0 if the
--opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Poly.pm.2.1
++++ b/pm/Math/GSL/Poly.pm.2.1
+@@ -429,7 +429,7 @@ This function frees all the memory assoc
- =item C<gsl_vector_swap($v, $v2)>
+ =back
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
--succeded, 1 otherwise
-+succeeded, 1 otherwise
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_swap_elements($v, $i, $j)>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Poly.pm.2.2
++++ b/pm/Math/GSL/Poly.pm.2.2
+@@ -429,7 +429,7 @@ This function frees all the memory assoc
- permute the elements at position $i and $j in the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_vector_max($v)>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -1318,32 +1318,32 @@ $v and the second is the position of the maximum value.
- =item C<gsl_vector_add($v, $v2)>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Poly.pm.2.2.1
++++ b/pm/Math/GSL/Poly.pm.2.2.1
+@@ -429,7 +429,7 @@ This function frees all the memory assoc
- add the elements of $v2 to the elements of $v, the two vectors must have the
--same length and return 0 if the operation succeded, 1 otherwise.
-+same length and return 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_vector_sub($v, $v2)>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- substract the elements of $v2 from the elements of $v, the two vectors must
--have the same length and return 0 if the operation succeded, 1 otherwise.
-+have the same length and return 0 if the operation succeeded, 1 otherwise.
+ =head1 AUTHORS
+--- a/pm/Math/GSL/QRNG.pm.2.0
++++ b/pm/Math/GSL/QRNG.pm.2.0
+@@ -391,7 +391,7 @@ This module also contains the following
- =item C<gsl_vector_mul($v, $v2)>
+ =back
- multiply the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_div($v, $v2)>
- divides the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_vector_scale($v, $x)>
+--- a/pm/Math/GSL/QRNG.pm.2.1
++++ b/pm/Math/GSL/QRNG.pm.2.1
+@@ -391,7 +391,7 @@ This module also contains the following
- multiplty the elements of the vector $v by a constant $x and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_vector_add_constant($v, $x)>
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- add a constant $x to the elements of the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
- =item C<gsl_vector_isnull($v)>
-@@ -1380,7 +1380,7 @@ leaving the odd elements untouched :
+--- a/pm/Math/GSL/QRNG.pm.2.2
++++ b/pm/Math/GSL/QRNG.pm.2.2
+@@ -391,7 +391,7 @@ This module also contains the following
=back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 EXAMPLES
-diff --git a/pm/Math/GSL/Vector.pm.1.16 b/pm/Math/GSL/Vector.pm.1.16
-index b570be6..1dd9343 100644
---- a/pm/Math/GSL/Vector.pm.1.16
-+++ b/pm/Math/GSL/Vector.pm.1.16
-@@ -1234,7 +1234,7 @@ set all the elements of $v to $x
- =item C<gsl_vector_set_basis($v, $i)>
- set all the elements of $v to 0 except for the $i-th element which is set to 1
--and return 0 if the operation succeded, 1 otherwise.
-+and return 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_vector_fread($file, $v)>
+--- a/pm/Math/GSL/QRNG.pm.2.2.1
++++ b/pm/Math/GSL/QRNG.pm.2.2.1
+@@ -391,7 +391,7 @@ This module also contains the following
-@@ -1271,23 +1271,23 @@ success and 1 if there was a problem writing to the file.
- =item C<gsl_vector_memcpy($dest, $src)>
+ =back
- This function copies the elements of the vector $src into the vector $dest and
--return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
- same length.
+-For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
++For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_vector_reverse($v)>
- reverse the order of the elements of the vector $v and return 0 if the
--opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
- =item C<gsl_vector_swap($v, $v2)>
+--- a/pm/Math/GSL/RNG.pm.2.0
++++ b/pm/Math/GSL/RNG.pm.2.0
+@@ -750,7 +750,7 @@ __END__
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
--succeded, 1 otherwise
-+succeeded, 1 otherwise
+ =item gsl_rng_uniform_pos($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 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.
- =item C<gsl_vector_swap_elements($v, $i, $j)>
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
- permute the elements at position $i and $j in the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
- =item C<gsl_vector_max($v)>
+@@ -928,7 +928,7 @@ __END__
-@@ -1318,32 +1318,32 @@ $v and the second is the position of the maximum value.
- =item C<gsl_vector_add($v, $v2)>
+ =back
- add the elements of $v2 to the elements of $v, the two vectors must have the
--same length and return 0 if the operation succeded, 1 otherwise.
-+same length and return 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
- =item C<gsl_vector_sub($v, $v2)>
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- substract the elements of $v2 from the elements of $v, the two vectors must
--have the same length and return 0 if the operation succeded, 1 otherwise.
-+have the same length and return 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/RNG.pm.2.1
++++ b/pm/Math/GSL/RNG.pm.2.1
+@@ -750,7 +750,7 @@ __END__
- =item C<gsl_vector_mul($v, $v2)>
+ =item gsl_rng_uniform_pos($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 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.
- multiply the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
- =item C<gsl_vector_div($v, $v2)>
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
- divides the elements of $v by the elements of $v2, the two vectors must have
--the same length and return 0 if the operation succeded, 1 otherwise.
-+the same length and return 0 if the operation succeeded, 1 otherwise.
+@@ -928,7 +928,7 @@ __END__
- =item C<gsl_vector_scale($v, $x)>
+ =back
- multiplty the elements of the vector $v by a constant $x and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
- =item C<gsl_vector_add_constant($v, $x)>
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- add a constant $x to the elements of the vector $v and return 0 if the
--operation succeded, 1 otherwise.
-+operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/RNG.pm.2.2
++++ b/pm/Math/GSL/RNG.pm.2.2
+@@ -750,7 +750,7 @@ __END__
- =item C<gsl_vector_isnull($v)>
+ =item gsl_rng_uniform_pos($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 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.
+
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
-@@ -1380,7 +1380,7 @@ leaving the odd elements untouched :
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
+
+@@ -928,7 +928,7 @@ __END__
=back
-For more informations on the functions, we refer you to the GSL offcial documentation:
+For more information on the functions, we refer you to the GSL offcial documentation:
+
L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 EXAMPLES
-diff --git a/pod/BLAS.pod b/pod/BLAS.pod
-index d03270e..a3b17d8 100644
---- a/pod/BLAS.pod
-+++ b/pod/BLAS.pod
-@@ -100,7 +100,7 @@ The functions of this module are divised into 3 levels:
- =item C<gsl_blas_ddot($x, $y)>
+--- a/pm/Math/GSL/RNG.pm.2.2.1
++++ b/pm/Math/GSL/RNG.pm.2.2.1
+@@ -750,7 +750,7 @@ __END__
- This function computes the scalar product x^T y for the vectors $x and $y. The
--function returns two values, the first is 0 if the operation suceeded, 1
-+function returns two values, the first is 0 if the operation succeeded, 1
- otherwise and the second value is the result of the computation.
+ =item gsl_rng_uniform_pos($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 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.
- =item C<gsl_blas_cdotu>
-@@ -111,13 +111,13 @@ otherwise and the second value is the result of the computation.
+-=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
++=item gsl_rng_uniform_int($r, $n) - This function returns a random integer from 0 to $n-1 inclusive by scaling down and/or discarding samples from the generator $r. All integers in the range [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 $n mus [...]
- This function computes the complex scalar product x^T y for the complex vectors
- $x and $y, returning the result in the complex number $dotu. The function
--returns 0 if the operation suceeded, 1 otherwise.
-+returns 0 if the operation succeeded, 1 otherwise.
+ =item gsl_rng_fwrite($stream, $r) - This function writes the random number state of the random number generator $r to the stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The return value is 0 for success and $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.
- =item C<gsl_blas_zdotc($x, $y, $dotc)>
+@@ -928,7 +928,7 @@ __END__
- This function computes the complex conjugate scalar product x^H y for the
- complex vectors $x and $y, returning the result in the complex number $dotc.
--The function returns 0 if the operation suceeded, 1 otherwise.
-+The function returns 0 if the operation succeeded, 1 otherwise.
+ =back
- =item C<gsl_blas_snrm2>
- =item C<gsl_blas_sasum>
-@@ -162,11 +162,11 @@ This function computes the sum of the magnitudes of the real and imaginary parts
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
- =item C<gsl_blas_dswap($x, $y)>
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function exchanges the elements of the vectors $x and $y. The function returns 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Randist.pm.2.0
++++ b/pm/Math/GSL/Randist.pm.2.0
+@@ -992,8 +992,8 @@ De-allocates the gsl_ran_discrete pointe
+ =back
- =item C<gsl_blas_dcopy($x, $y)>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
--This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation suceeded, 1 otherwise.
-+This function copies the elements of the vector $x into the vector $y. The function returns 0 if the operation succeeded, 1 otherwise.
+ =over
- =item C<gsl_blas_daxpy($alpha, $x, $y)>
+@@ -1077,7 +1077,7 @@ De-allocates the gsl_ran_discrete pointe
-@@ -228,11 +228,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
- =item C<gsl_blas_strsv>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemv($TransA, $alpha, $A, $x, $beta, $y)> - This function computes the matrix-vector product and sum y = \alpha op(A) x + \beta y, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). $A is a matrix and $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
--=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
-+=item C<gsl_blas_dtrmv($Uplo, $TransA, $Diag, $A, $x)> - This function computes the matrix-vector product x = op(A) x for the triangular matrix $A, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Di [...]
+--- a/pm/Math/GSL/Randist.pm.2.1
++++ b/pm/Math/GSL/Randist.pm.2.1
+@@ -992,8 +992,8 @@ De-allocates the gsl_ran_discrete pointe
+ =back
--=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
-+=item C<gsl_blas_dtrsv($Uplo, $TransA, $Diag, $A, $x)> - This function computes inv(op(A)) x for the vector $x, where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans (constant values coming from the CBLAS module). When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then the diagonal of the matrix is used, but if $Diag is $CblasUnit then the diagonal e [...]
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
- =item C<gsl_blas_cgemv >
+ =over
-@@ -256,9 +256,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+@@ -1077,7 +1077,7 @@ De-allocates the gsl_ran_discrete pointe
- =item C<gsl_blas_dsymv>
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
--=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dger($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the matrix $A. $x and $y are vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsyr($Uplo, $alpha, $x, $A)> - This function computes the symmetric rank-1 update A = \alpha x x^T + A of the symmetric matrix $A and the vector $x. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
- =item C<gsl_blas_dsyr2($Uplo, $alpha, $x, $y, $A)> - This function computes the symmetric rank-2 update A = \alpha x y^T + \alpha y x^T + A of the symmetric matrix $A, the vector $x and vector $y. Since the matrix $A is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used.
+--- a/pm/Math/GSL/Randist.pm.2.2
++++ b/pm/Math/GSL/Randist.pm.2.2
+@@ -997,8 +997,8 @@ De-allocates the gsl_ran_discrete pointe
+ =back
-@@ -274,11 +274,11 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
- =item C<gsl_blas_zhemv >
+ =over
--=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_zgeru($alpha, $x, $y, $A)> - This function computes the rank-1 update A = alpha x y^T + A of the complex matrix $A. $alpha is a complex number and $x and $y are complex vectors. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -1082,7 +1082,7 @@ De-allocates the gsl_ran_discrete pointe
- =item C<gsl_blas_zgerc>
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
--=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
-+=item C<gsl_blas_zher($Uplo, $alpha, $x, $A)> - This function computes the hermitian rank-1 update A = \alpha x x^H + A of the hermitian matrix $A and of the complex vector $x. Since the matrix $A is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The imaginary elements of the diagonal are automatically set to ze [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_blas_zher2 >
-@@ -301,17 +301,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+--- a/pm/Math/GSL/Randist.pm.2.2.1
++++ b/pm/Math/GSL/Randist.pm.2.2.1
+@@ -997,8 +997,8 @@ De-allocates the gsl_ran_discrete pointe
+ =back
- =item C<gsl_blas_strsm>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+- You can also write use Math::GSL::Randist qw/:all/; to use all avaible functions of the module.
+- Other tags are also avaible, here is a complete list of all tags for this module :
++ You can also write use Math::GSL::Randist qw/:all/; to use all available functions of the module.
++ Other tags are also available, here is a complete list of all tags for this module :
--=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise.
+ =over
--=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_blas_dsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. The function returns 0 if the operation succeeded, 1 otherwise.
+@@ -1082,7 +1082,7 @@ De-allocates the gsl_ran_discrete pointe
--=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_dsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+ For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
--=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_dsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_dtrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
--=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_dtrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+--- a/pm/Math/GSL/SF.pm.2.0
++++ b/pm/Math/GSL/SF.pm.2.0
+@@ -2407,7 +2407,7 @@ These functions compute the incomplete e
- =item C<gsl_blas_cgemm>
+ =over
-@@ -325,17 +325,17 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
- =item C<gsl_blas_ctrsm>
+ =item C<gsl_sf_erfc_e($x, $result)>
--=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation suceeded, 1 otherwise. $A, $B and $C are complex matrices
-+=item C<gsl_blas_zgemm($TransA, $TransB, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha op(A) op(B) + \beta C where op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans and similarly for the parameter $TransB. The function returns 0 if the operation succeeded, 1 otherwise. $A, $B and $C are complex matrices
+@@ -3883,7 +3883,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
--=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
-+=item C<gsl_blas_zsymm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is symmetric. When $Uplo is $CblasUpper then the upper triangle and diagonal of $A are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $A are used. $A, $B and $C are complex matrices. The function returns 0 if the o [...]
+@@ -3935,7 +3935,7 @@ This module also contains the following
--=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
-+=item C<gsl_blas_zsyrk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the symmetric complex matrix $C, C = \alpha A A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C [...]
+ =back
--=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
-+=item C<gsl_blas_zsyr2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the symmetric matrix $C, C = \alpha A B^T + \alpha B A^T + \beta C when $Trans is $CblasNoTrans and C = \alpha A^T B + \alpha B^T A + \beta C when $Trans is $CblasTrans. Since the matrix $C is symmetric only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower [...]
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
-+=item C<gsl_blas_ztrmm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the matrix-matrix product B = \alpha op(A) B for $Side is $CblasLeft and B = \alpha B op(A) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $CblasNonUnit then th [...]
--=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
-+=item C<gsl_blas_ztrsm($Side, $Uplo, $TransA, $Diag, $alpha, $A, $B)> - This function computes the inverse-matrix matrix product B = \alpha op(inv(A))B for $Side is $CblasLeft and B = \alpha B op(inv(A)) for $Side is $CblasRight. The matrix $A is triangular and op(A) = A, A^T, A^H for $TransA = $CblasNoTrans, $CblasTrans, $CblasConjTrans. When $Uplo is $CblasUpper then the upper triangle of $A is used, and when $Uplo is $CblasLower then the lower triangle of $A is used. If $Diag is $Cbl [...]
+--- a/pm/Math/GSL/SF.pm.2.1
++++ b/pm/Math/GSL/SF.pm.2.1
+@@ -2407,7 +2407,7 @@ These functions compute the incomplete e
- =item C<gsl_blas_chemm>
+ =over
-@@ -345,9 +345,9 @@ This function rescales the vector $x by the multiplicative factor $alpha.
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
- =item C<gsl_blas_zhemm($Side, $Uplo, $alpha, $A, $B, $beta, $C)> - This function computes the matrix-matrix product and sum C = \alpha A B + \beta C for $Side is $CblasLeft and C = \alpha B A + \beta C for $Side is $CblasRight, where the matrix $A is hermitian. When Uplo is CblasUpper then the upper triangle and diagonal of A are used, and when Uplo is CblasLower then the lower triangle and diagonal of A are used. The imaginary elements of the diagonal are automatically set to zero.
+ =item C<gsl_sf_erfc_e($x, $result)>
--=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
-+=item C<gsl_blas_zherk($Uplo, $Trans, $alpha, $A, $beta, $C)> - This function computes a rank-k update of the hermitian matrix $C, C = \alpha A A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H A + \beta C when $Trans is $CblasTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then the lower triangle and diagonal of $C are use [...]
+@@ -3883,7 +3883,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
--=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
-+=item C<gsl_blas_zher2k($Uplo, $Trans, $alpha, $A, $B, $beta, $C)> - This function computes a rank-2k update of the hermitian matrix $C, C = \alpha A B^H + \alpha^* B A^H + \beta C when $Trans is $CblasNoTrans and C = \alpha A^H B + \alpha^* B^H A + \beta C when $Trans is $CblasConjTrans. Since the matrix $C is hermitian only its upper half or lower half need to be stored. When $Uplo is $CblasUpper then the upper triangle and diagonal of $C are used, and when $Uplo is $CblasLower then t [...]
+@@ -3935,7 +3935,7 @@ This module also contains the following
=back
-@@ -365,7 +365,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
- =back
+--- a/pm/Math/GSL/SF.pm.2.2
++++ b/pm/Math/GSL/SF.pm.2.2
+@@ -2407,7 +2407,7 @@ These functions compute the incomplete e
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =over
- =head1 AUTHORS
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-diff --git a/pod/BSpline.pod b/pod/BSpline.pod
-index 698d604..033f1ea 100644
---- a/pod/BSpline.pod
-+++ b/pod/BSpline.pod
-@@ -68,7 +68,7 @@ gsl_bspline_ncoeffs. 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.
+ =item C<gsl_sf_erfc_e($x, $result)>
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- http://www.gnu.org/software/gsl/manual/html_node/
+@@ -3883,7 +3883,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
- =back
-diff --git a/pod/CBLAS.pod b/pod/CBLAS.pod
-index 8e3f0a4..a3fbbb2 100644
---- a/pod/CBLAS.pod
-+++ b/pod/CBLAS.pod
-@@ -491,7 +491,7 @@ This module also contains the following constants :
+@@ -3935,7 +3935,7 @@ This module also contains the following
=back
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+--- a/pm/Math/GSL/SF.pm.2.2.1
++++ b/pm/Math/GSL/SF.pm.2.2.1
+@@ -2407,7 +2407,7 @@ These functions compute the incomplete e
-diff --git a/pod/CDF.pod b/pod/CDF.pod
-index 4a8b71a..49010f7 100644
---- a/pod/CDF.pod
-+++ b/pod/CDF.pod
-@@ -370,7 +370,7 @@ This is the list of available import tags:
- For example the beta tag contains theses functions : gsl_cdf_beta_P,
- gsl_cdf_beta_Q, gsl_cdf_beta_Pinv, gsl_cdf_beta_Qinv .
+ =over
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+ =item C<gsl_sf_erfc_e($x, $result)>
-diff --git a/pod/Chebyshev.pod b/pod/Chebyshev.pod
-index fa1b21f..13d888e 100644
---- a/pod/Chebyshev.pod
-+++ b/pod/Chebyshev.pod
-@@ -93,7 +93,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
+@@ -3883,7 +3883,7 @@ This module also contains the following
+ You can import the functions that you want to use by giving a space separated
+ list to Math::GSL::SF when you use the package. You can also write
+ use Math::GSL::SF qw/:all/
+- to use all avaible functions of the module. Note that
++ to use all available functions of the module. Note that
+ the tag names begin with a colon. Other tags are also available, here is a
+ complete list of all tags for this module :
+
+@@ -3935,7 +3935,7 @@ This module also contains the following
=back
@@ -6447,64 +6118,54 @@ index fa1b21f..13d888e 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pod/Combination.pod b/pod/Combination.pod
-index 31775ba..4d32850 100644
---- a/pod/Combination.pod
-+++ b/pod/Combination.pod
-@@ -205,7 +205,7 @@ sub prev {
- =head1 MORE INFO
+--- a/pm/Math/GSL/Siman.pm.2.0
++++ b/pm/Math/GSL/Siman.pm.2.0
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
+ =back
+
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pod/Deriv.pod b/pod/Deriv.pod
-index 8b69a7c..f316904 100644
---- a/pod/Deriv.pod
-+++ b/pod/Deriv.pod
-@@ -84,7 +84,7 @@ function is evaluated at $x and $x+$h.
-
+--- a/pm/Math/GSL/Siman.pm.2.1
++++ b/pm/Math/GSL/Siman.pm.2.1
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
=back
+
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pod/Eigen.pod b/pod/Eigen.pod
-index 31bd052..d572547 100644
---- a/pod/Eigen.pod
-+++ b/pod/Eigen.pod
-@@ -179,7 +179,7 @@ This module also includes these constants :
+--- a/pm/Math/GSL/Siman.pm.2.2
++++ b/pm/Math/GSL/Siman.pm.2.2
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
=back
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pod/FFT.pod b/pod/FFT.pod
-index 72d93d3..9c332ef 100644
---- a/pod/FFT.pod
-+++ b/pod/FFT.pod
-@@ -277,7 +277,7 @@ This module also includes the following constants :
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+
+--- a/pm/Math/GSL/Siman.pm.2.2.1
++++ b/pm/Math/GSL/Siman.pm.2.2.1
+@@ -187,7 +187,7 @@ Here is a list of all the functions in t
=back
+
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pod/Fit.pod b/pod/Fit.pod
-index 1cc6127..e84d5d5 100644
---- a/pod/Fit.pod
-+++ b/pod/Fit.pod
-@@ -103,7 +103,7 @@ and y_err.
+--- a/pm/Math/GSL/Sort.pm.2.0
++++ b/pm/Math/GSL/Sort.pm.2.0
+@@ -331,7 +331,7 @@ should be removed in further versions.
=back
@@ -6512,12 +6173,10 @@ index 1cc6127..e84d5d5 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pod/Heapsort.pod b/pod/Heapsort.pod
-index c744018..d00a6b9 100644
---- a/pod/Heapsort.pod
-+++ b/pod/Heapsort.pod
-@@ -32,7 +32,7 @@ Here is a list of all the functions in this module :
+ =head1 PERFORMANCE
+--- a/pm/Math/GSL/Sort.pm.2.1
++++ b/pm/Math/GSL/Sort.pm.2.1
+@@ -331,7 +331,7 @@ should be removed in further versions.
=back
@@ -6525,192 +6184,200 @@ index c744018..d00a6b9 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 PERFORMANCE
+--- a/pm/Math/GSL/Sort.pm.2.2
++++ b/pm/Math/GSL/Sort.pm.2.2
+@@ -331,7 +331,7 @@ should be removed in further versions.
-diff --git a/pod/Histogram2D.pod b/pod/Histogram2D.pod
-index 7acdfec..00eb49f 100644
---- a/pod/Histogram2D.pod
-+++ b/pod/Histogram2D.pod
-@@ -133,11 +133,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
-
- =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+ =back
--=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
-+=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+ =head1 PERFORMANCE
+--- a/pm/Math/GSL/Sort.pm.2.2.1
++++ b/pm/Math/GSL/Sort.pm.2.2.1
+@@ -331,7 +331,7 @@ should be removed in further versions.
--=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
-+=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+ =back
- =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pod/Integration.pod b/pod/Integration.pod
-index 08f594f..a85c476 100644
---- a/pod/Integration.pod
-+++ b/pod/Integration.pod
-@@ -230,7 +230,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
+ =head1 PERFORMANCE
+--- a/pm/Math/GSL/Spline.pm.2.0
++++ b/pm/Math/GSL/Spline.pm.2.0
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
- =head1 MORE INFO
+ =back
-For more informations on the functions, we refer you to the GSL offcial
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pod/Linalg.pod b/pod/Linalg.pod
-index 92e66cc..acb1fa4 100644
---- a/pod/Linalg.pod
-+++ b/pod/Linalg.pod
-@@ -138,7 +138,7 @@ Here is a list of all the functions included in this module :
- =item gsl_linalg_complex_householder_transform
+--- a/pm/Math/GSL/Spline.pm.2.1
++++ b/pm/Math/GSL/Spline.pm.2.1
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
--=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+ =back
- =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -152,7 +152,7 @@ Here is a list of all the functions included in this module :
- =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+--- a/pm/Math/GSL/Spline.pm.2.2
++++ b/pm/Math/GSL/Spline.pm.2.2
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
--=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
-+=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+ =back
- =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -176,9 +176,9 @@ Here is a list of all the functions included in this module :
- =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+--- a/pm/Math/GSL/Spline.pm.2.2.1
++++ b/pm/Math/GSL/Spline.pm.2.2.1
+@@ -226,7 +226,7 @@ ya as arguments on each evaluation.
--=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+ =back
--=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
-+=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
- =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
-@@ -212,27 +212,27 @@ Here is a list of all the functions included in this module :
+--- a/pm/Math/GSL/Statistics.pm.2.0
++++ b/pm/Math/GSL/Statistics.pm.2.0
+@@ -408,7 +408,7 @@ These functions return the total sum of
- =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
--=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
-+=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
--=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
- =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+@@ -589,8 +589,8 @@ The following function are simply varian
+ =back
--=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
--=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+ =over
--=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+@@ -602,7 +602,7 @@ Other tags are also avaible, here is a c
--=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+ =back
--=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
--=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Statistics.pm.2.1
++++ b/pm/Math/GSL/Statistics.pm.2.1
+@@ -408,7 +408,7 @@ These functions return the total sum of
--=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
-+=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
- =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-@@ -345,7 +345,7 @@ Here is a list of all the functions included in this module :
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
- You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
+@@ -589,8 +589,8 @@ The following function are simply varian
+ =back
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+ =over
+
+@@ -602,7 +602,7 @@ Other tags are also avaible, here is a c
=back
-diff --git a/pod/Matrix.pod b/pod/Matrix.pod
-index 1a22cd3..0036d1b 100644
---- a/pod/Matrix.pod
-+++ b/pod/Matrix.pod
-@@ -1234,11 +1234,11 @@ Here is a list of all the functions included in this module :
- =item C<gsl_matrix_swap($m1, $m2)> - Exchange the elements of the matrices $m1 and $m2 by copying. The two matrices must have the same size.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rows($m, $i, $j)> - Exchange the $i-th and $j-th row of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
--=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_columns($m, $i, $j)> - Exchange the $i-th and $j-th column of the matrix $m. The function returns 0 if the operation succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Statistics.pm.2.2
++++ b/pm/Math/GSL/Statistics.pm.2.2
+@@ -408,7 +408,7 @@ These functions return the total sum of
--=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation suceeded, 1 otherwise.
-+=item C<gsl_matrix_swap_rowcol($m, $i, $j)> - Exchange the $i-th row and the $j-th column of the matrix $m. The matrix must be square. The function returns 0 if the operation succeeded, 1 otherwise.
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
- =item C<gsl_matrix_transpose($m)> - This function replaces the matrix m by its transpose by copying the elements of the matrix in-place. The matrix must be square for this operation to be possible.
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-@@ -1258,7 +1258,7 @@ Here is a list of all the functions included in this module :
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
- =item C<gsl_matrix_isnull($m)> - Return 1 if all the elements of the matrix $m are zero, 0 otherwise
+@@ -589,8 +589,8 @@ The following function are simply varian
+ =back
--=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positve, 0 otherwise
-+=item C<gsl_matrix_ispos($m)> - Return 1 if all the elements of the matrix $m are strictly positive, 0 otherwise
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
- =item C<gsl_matrix_isneg($m)> - Return 1 if all the elements of the matrix $m are strictly negative, 0 otherwise
+ =over
-@@ -1278,13 +1278,13 @@ Here is a list of all the functions included in this module :
+@@ -602,7 +602,7 @@ Other tags are also avaible, here is a c
- =item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
+ =back
--=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
--=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
--=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
+--- a/pm/Math/GSL/Statistics.pm.2.2.1
++++ b/pm/Math/GSL/Statistics.pm.2.2.1
+@@ -408,7 +408,7 @@ These functions return the total sum of
--=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
+ =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
- =back
+-=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
++=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-@@ -1586,7 +1586,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
+@@ -589,8 +589,8 @@ The following function are simply varian
=back
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ You have to add the functions you want to use inside the qw /put_funtion_here /.
+-You can also write use Math::GSL::Statistics qw/:all/; to use all avaible functions of the module.
+-Other tags are also avaible, here is a complete list of all tags for this module :
++You can also write use Math::GSL::Statistics qw/:all/; to use all available functions of the module.
++Other tags are also available, here is a complete list of all tags for this module :
+ =over
-diff --git a/pod/MatrixComplex.pod b/pod/MatrixComplex.pod
-index a78f281..41e1d1f 100644
---- a/pod/MatrixComplex.pod
-+++ b/pod/MatrixComplex.pod
-@@ -693,7 +693,7 @@ sub lndet($)
+@@ -602,7 +602,7 @@ Other tags are also avaible, here is a c
=back
--For more informations on the functions, we refer you to the GSL offcial documentation
-+For more information on the functions, we refer you to the GSL offcial documentation
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial
++For more information on the functions, we refer you to the GSL offcial
+ documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-diff --git a/pod/Min.pod b/pod/Min.pod
-index c9b9a5e..75605da 100644
---- a/pod/Min.pod
-+++ b/pod/Min.pod
-@@ -107,7 +107,7 @@ This module also includes the following constants :
+--- a/pm/Math/GSL/Sys.pm.2.0
++++ b/pm/Math/GSL/Sys.pm.2.0
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -6719,11 +6386,9 @@ index c9b9a5e..75605da 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pod/Monte.pod b/pod/Monte.pod
-index 72f95eb..d24a04a 100644
---- a/pod/Monte.pod
-+++ b/pod/Monte.pod
-@@ -76,7 +76,7 @@ This module also includes the following constants :
+--- a/pm/Math/GSL/Sys.pm.2.1
++++ b/pm/Math/GSL/Sys.pm.2.1
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -6732,11 +6397,9 @@ index 72f95eb..d24a04a 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
-diff --git a/pod/Multifit.pod b/pod/Multifit.pod
-index 1be4c58..e9b02d5 100644
---- a/pod/Multifit.pod
-+++ b/pod/Multifit.pod
-@@ -106,7 +106,7 @@ The following functions are not yet implemented. Patches Welcome!
+--- a/pm/Math/GSL/Sys.pm.2.2
++++ b/pm/Math/GSL/Sys.pm.2.2
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -6744,12 +6407,10 @@ index 1be4c58..e9b02d5 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-
-diff --git a/pod/Multimin.pod b/pod/Multimin.pod
-index da302df..240667d 100644
---- a/pod/Multimin.pod
-+++ b/pod/Multimin.pod
-@@ -105,7 +105,7 @@ This module also includes the following constants :
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Sys.pm.2.2.1
++++ b/pm/Math/GSL/Sys.pm.2.2.1
+@@ -260,7 +260,7 @@ zero. The implementation is based on the
=back
@@ -6757,257 +6418,277 @@ index da302df..240667d 100644
+For more information on the functions, we refer you to the GSL offcial
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 AUTHORS
+--- a/pm/Math/GSL/Vector.pm.2.0
++++ b/pm/Math/GSL/Vector.pm.2.0
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
-diff --git a/pod/Multiroots.pod b/pod/Multiroots.pod
-index b8640d4..9c3c181 100644
---- a/pod/Multiroots.pod
-+++ b/pod/Multiroots.pod
-@@ -93,7 +93,7 @@ Here is a list of all the functions in this module :
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_fread($file, $v)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
+ =item C<gsl_vector_memcpy($dest, $src)>
- =head1 AUTHORS
-diff --git a/pod/NTuple.pod b/pod/NTuple.pod
-index 9256edd..26cdeca 100644
---- a/pod/NTuple.pod
-+++ b/pod/NTuple.pod
-@@ -89,7 +89,7 @@ memory.
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the operation succeeded, 1 otherwise. The two vectors must have the
+ same length.
- =back
+ =item C<gsl_vector_reverse($v)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++operation succeeded, 1 otherwise
- =head1 AUTHORS
-diff --git a/pod/ODEIV.pod b/pod/ODEIV.pod
-index da953de..27509f5 100644
---- a/pod/ODEIV.pod
-+++ b/pod/ODEIV.pod
-@@ -135,7 +135,7 @@ This module also includes the following constants :
+ =item C<gsl_vector_swap($v, $v2)>
- =back
+-swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++swap the values of the vectors $v and $v2 and return 0 if the operation
++succeeded, 1 otherwise
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
-diff --git a/pod/Permutation.pod b/pod/Permutation.pod
-index 22078f7..fd51ddd 100644
---- a/pod/Permutation.pod
-+++ b/pod/Permutation.pod
-@@ -72,7 +72,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
+ =item C<gsl_vector_max($v)>
- use Math::GSL::Permutation qw/:all/;
- my $permutation = Math::GSL::Permutation->new(30); # allocate and initialize a permutation of size 30
-- my $lenght = $permutation->lenght; # returns the lenght of the permutation object, here it is 30
-+ my $length = $permutation->length; # returns the length of the permutation object, here it is 30
- gsl_permutation_swap($permutation->raw, 2,7);
- # the raw method is made to use the underlying permutation structure of the permutation object
- my $value = $permutation->get(2); # returns the third value (starting from 0) of the permutation
-@@ -93,7 +93,7 @@ Here is a list of all the functions included in this module :
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+-substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
- =item gsl_permutation_free($p) - free all the memory use by the permutaion $p
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
--=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same lenght and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_memcpy($dest, $src) - copy the permutation $src into the permutation $dest, the two permutations must have the same length and return 0 if the operation succeeded, 1 otherwise
+ =back
- =item gsl_permutation_fread($stream, $p) - This function reads into the permutation $p from the open stream $stream (opened with the gsl_fopen function from the Math::GSL module) in binary format. The permutation $p must be preallocated with the correct length since the function uses the size of $p to determine how many bytes to read. The function returns 1 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 arc [...]
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
-@@ -109,7 +109,7 @@ Here is a list of all the functions included in this module :
+ =head1 EXAMPLES
+--- a/pm/Math/GSL/Vector.pm.2.1
++++ b/pm/Math/GSL/Vector.pm.2.1
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
- =item gsl_permutation_get($p, $i) - return the $i-th element of the permutation $p, return 0 if $i is outside the range of 0 to n-1
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
--=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_swap($p, $i, $j) - exchange the $i-th position and the $j-th position of the permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =item C<gsl_vector_fread($file, $v)>
- =item gsl_permutation_valid($p) - return 0 if the permutation $p is valid (if the n elements contain each of the numbers 0 to n-1 once and only once), 1 otherwise
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
+ =item C<gsl_vector_memcpy($dest, $src)>
-@@ -119,13 +119,13 @@ Here is a list of all the functions included in this module :
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the operation succeeded, 1 otherwise. The two vectors must have the
+ same length.
- =item gsl_permutation_next($p) - advance the permutation $p to the next permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+ =item C<gsl_vector_reverse($v)>
--=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_prev($p) - step backward from the permutation $p to the previous permutation in lexicographic order and return 0 if the operation succeeded, 1 otherwise
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++operation succeeded, 1 otherwise
--=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_mul($p, $pa, $pb) - combine the two permutation $pa and $pb into a single permutation $p and return 0 if the operation succeeded, 1 otherwise
+ =item C<gsl_vector_swap($v, $v2)>
--=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_linear_to_canonical($q, $p) - compute the canonical form the permutation $p and store it in $q and return 0 if the operation succeeded, 1 otherwise
+-swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++swap the values of the vectors $v and $v2 and return 0 if the operation
++succeeded, 1 otherwise
--=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation suceeded, 1 otherwise
-+=item gsl_permutation_canonical_to_linear($p, $q) - convert a canonical permutation $q back into linear form and store it in $p and return 0 if the operation succeeded, 1 otherwise
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
- =item gsl_permutation_inversions($p) - return the number of inversions in the permutation $p
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
-@@ -152,7 +152,7 @@ Here is a list of all the functions included in this module :
- You have to add the functions you want to use inside the qw/put_funtion_here/ with spaces between each function.
- You can also write use Math::GSL::CDF qw/:all/ to use all avaible functions of the module.
- Other tags are also avaible, here is a complete list of all tags for this module.
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_max($v)>
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
+ =item C<gsl_vector_add($v, $v2)>
-diff --git a/pod/Poly.pod b/pod/Poly.pod
-index fd5ca8b..38582a9 100644
---- a/pod/Poly.pod
-+++ b/pod/Poly.pod
-@@ -95,7 +95,7 @@ This function frees all the memory associated with the workspace $w.
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_sub($v, $v2)>
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+-substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
++have the same length and return 0 if the operation succeeded, 1 otherwise.
- =head1 AUTHORS
-diff --git a/pod/QRNG.pod b/pod/QRNG.pod
-index db79f28..9a2ca5f 100644
---- a/pod/QRNG.pod
-+++ b/pod/QRNG.pod
-@@ -168,7 +168,7 @@ This module also contains the following constants :
+ =item C<gsl_vector_mul($v, $v2)>
- =back
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
--For more informations on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
-+For more information on the functions, we refer you to the GSL offcial documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_div($v, $v2)>
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_vector_scale($v, $x)>
-diff --git a/pod/RNG.pod b/pod/RNG.pod
-index b6c2a87..c802dc6 100644
---- a/pod/RNG.pod
-+++ b/pod/RNG.pod
-@@ -399,7 +399,7 @@ __END__
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_add_constant($v, $x)>
--For more informations on the functions, we refer you to the GSL offcial documentation:
-+For more information on the functions, we refer you to the GSL offcial documentation:
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =item C<gsl_vector_isnull($v)>
-diff --git a/pod/Randist.pod b/pod/Randist.pod
-index e0893e2..44b1e8d 100644
---- a/pod/Randist.pod
-+++ b/pod/Randist.pod
-@@ -835,7 +835,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
- For example the beta tag contains theses functions : gsl_ran_beta, gsl_ran_beta_pdf.
+ =back
-For more informations on the functions, we refer you to the GSL offcial documentation:
+For more information on the functions, we refer you to the GSL offcial documentation:
L<http://www.gnu.org/software/gsl/manual/html_node/>
+ =head1 EXAMPLES
+--- a/pm/Math/GSL/Vector.pm.2.2
++++ b/pm/Math/GSL/Vector.pm.2.2
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
-diff --git a/pod/SF.pod b/pod/SF.pod
-index fed7905..0cf5119 100644
---- a/pod/SF.pod
-+++ b/pod/SF.pod
-@@ -1640,7 +1640,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
-
- =over
-
--=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-+=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
-
- =item C<gsl_sf_erfc_e($x, $result)>
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
-@@ -3168,7 +3168,7 @@ This module also contains the following constants used as mode in various of tho
+ =item C<gsl_vector_fread($file, $v)>
- =back
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
+ =item C<gsl_vector_memcpy($dest, $src)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the operation succeeded, 1 otherwise. The two vectors must have the
+ same length.
+ =item C<gsl_vector_reverse($v)>
-diff --git a/pod/Siman.pod b/pod/Siman.pod
-index b1ca8f7..af22dd7 100644
---- a/pod/Siman.pod
-+++ b/pod/Siman.pod
-@@ -32,7 +32,7 @@ Here is a list of all the functions in this module :
- =back
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++operation succeeded, 1 otherwise
+ =item C<gsl_vector_swap($v, $v2)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++swap the values of the vectors $v and $v2 and return 0 if the operation
++succeeded, 1 otherwise
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
-diff --git a/pod/Sort.pod b/pod/Sort.pod
-index bc5af2d..dd48bcc 100644
---- a/pod/Sort.pod
-+++ b/pod/Sort.pod
-@@ -136,7 +136,7 @@ should be removed in further versions.
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_max($v)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
+ =item C<gsl_vector_add($v, $v2)>
- =head1 PERFORMANCE
-diff --git a/pod/Spline.pod b/pod/Spline.pod
-index a0ec6a4..59ebb57 100644
---- a/pod/Spline.pod
-+++ b/pod/Spline.pod
-@@ -66,7 +66,7 @@ ya as arguments on each evaluation.
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_sub($v, $v2)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+ =item C<gsl_vector_mul($v, $v2)>
-diff --git a/pod/Statistics.pod b/pod/Statistics.pod
-index 8186e61..9d03600 100644
---- a/pod/Statistics.pod
-+++ b/pod/Statistics.pod
-@@ -198,7 +198,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
- =item * C<gsl_stats_variance_m($data, $stride, $n, $mean)> - This function returns the sample variance of $data, an array reference, relative to the given value of $mean. The function is computed with \Hat\mu replaced by the value of mean that you supply, \Hat\sigma^2 = (1/(N-1)) \sum (x_i - mean)^2
+ =item C<gsl_vector_div($v, $v2)>
--=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array refrence, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
-+=item * C<gsl_stats_absdev_m($data, $stride, $n, $mean)> - This function computes the absolute deviation of the dataset $data, an array reference, relative to the given value of $mean, absdev = (1/N) \sum |x_i - mean|. This function is useful if you have already computed the mean of data (and want to avoid recomputing it), or wish to calculate the absolute deviation relative to another value (such as zero, or the median).
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
- =item * C<gsl_stats_wmean($w, $wstride, $data, $stride, $n)> - This function returns the weighted mean of the dataset $data array reference with stride $stride and length $n, using the set of weights $w, which is an array reference, with stride $wstride and length $n. The weighted mean is defined as, \Hat\mu = (\sum w_i x_i) / (\sum w_i)
+ =item C<gsl_vector_scale($v, $x)>
-@@ -392,7 +392,7 @@ Other tags are also avaible, here is a complete list of all tags for this module
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
- =back
+ =item C<gsl_vector_add_constant($v, $x)>
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+ =item C<gsl_vector_isnull($v)>
-diff --git a/pod/Sys.pod b/pod/Sys.pod
-index 34bcd6d..10e1f76 100644
---- a/pod/Sys.pod
-+++ b/pod/Sys.pod
-@@ -138,7 +138,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
=back
--For more informations on the functions, we refer you to the GSL offcial
-+For more information on the functions, we refer you to the GSL offcial
- documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+-For more informations on the functions, we refer you to the GSL offcial documentation:
++For more information on the functions, we refer you to the GSL offcial documentation:
+ L<http://www.gnu.org/software/gsl/manual/html_node/>
- =head1 AUTHORS
-diff --git a/pod/Vector.pod b/pod/Vector.pod
-index bd43832..94a1f7e 100644
---- a/pod/Vector.pod
-+++ b/pod/Vector.pod
-@@ -494,7 +494,7 @@ set all the elements of $v to $x
+ =head1 EXAMPLES
+--- a/pm/Math/GSL/Vector.pm.2.2.1
++++ b/pm/Math/GSL/Vector.pm.2.2.1
+@@ -1276,7 +1276,7 @@ set all the elements of $v to $x
=item C<gsl_vector_set_basis($v, $i)>
set all the elements of $v to 0 except for the $i-th element which is set to 1
@@ -7016,24 +6697,25 @@ index bd43832..94a1f7e 100644
=item C<gsl_vector_fread($file, $v)>
-@@ -531,23 +531,23 @@ success and 1 if there was a problem writing to the file.
+@@ -1313,23 +1313,23 @@ success and 1 if there was a problem wri
=item C<gsl_vector_memcpy($dest, $src)>
This function copies the elements of the vector $src into the vector $dest and
-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
-+return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
++return 0 if the operation succeeded, 1 otherwise. The two vectors must have the
same length.
=item C<gsl_vector_reverse($v)>
reverse the order of the elements of the vector $v and return 0 if the
-opertaion succeded, 1 otherwise
-+opertaion succeeded, 1 otherwise
++operation succeeded, 1 otherwise
=item C<gsl_vector_swap($v, $v2)>
- swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-swap the values of the vectors $v and $v2 and return 0 if the opertaion
-succeded, 1 otherwise
++swap the values of the vectors $v and $v2 and return 0 if the operation
+succeeded, 1 otherwise
=item C<gsl_vector_swap_elements($v, $i, $j)>
@@ -7044,7 +6726,7 @@ index bd43832..94a1f7e 100644
=item C<gsl_vector_max($v)>
-@@ -578,32 +578,32 @@ $v and the second is the position of the maximum value.
+@@ -1360,32 +1360,32 @@ $v and the second is the position of the
=item C<gsl_vector_add($v, $v2)>
add the elements of $v2 to the elements of $v, the two vectors must have the
@@ -7053,8 +6735,9 @@ index bd43832..94a1f7e 100644
=item C<gsl_vector_sub($v, $v2)>
- substract the elements of $v2 from the elements of $v, the two vectors must
+-substract the elements of $v2 from the elements of $v, the two vectors must
-have the same length and return 0 if the operation succeded, 1 otherwise.
++subtract the elements of $v2 from the elements of $v, the two vectors must
+have the same length and return 0 if the operation succeeded, 1 otherwise.
=item C<gsl_vector_mul($v, $v2)>
@@ -7083,7 +6766,7 @@ index bd43832..94a1f7e 100644
=item C<gsl_vector_isnull($v)>
-@@ -640,7 +640,7 @@ leaving the odd elements untouched :
+@@ -1422,7 +1422,7 @@ leaving the odd elements untouched :
=back
@@ -7092,3 +6775,67 @@ index bd43832..94a1f7e 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 EXAMPLES
+--- a/pm/Math/GSL/Histogram2D.pm.2.0
++++ b/pm/Math/GSL/Histogram2D.pm.2.0
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+--- a/pm/Math/GSL/Histogram2D.pm.2.1
++++ b/pm/Math/GSL/Histogram2D.pm.2.1
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+--- a/pm/Math/GSL/Histogram2D.pm.2.2
++++ b/pm/Math/GSL/Histogram2D.pm.2.2
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+--- a/pm/Math/GSL/Histogram2D.pm.2.2.1
++++ b/pm/Math/GSL/Histogram2D.pm.2.2.1
+@@ -376,11 +376,11 @@ C<gsl_histogram2d_set_ranges_uniform> or
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-gsl-perl.git
More information about the Pkg-perl-cvs-commits
mailing list