Changes since version 1.1.1 include:
* Addition of new functions
* Many bugfixes
* Homepage and distribution moved from sources.redhat.com to GNU.
See NEWS for more info.
* What is new in gsl-1.1.1:
** Fixes to histogram2d stat functions
** Added missing prototypes for complex LU determinant functions
** Improved error handling in multifit routines
** Added check to avoid division by zero for rank-deficient matrix in
multifit iteration
* What was new in gsl-1.1:
** The permutation module now includes a copy function
gsl_permutation_memcpy
** The implementation of gsl_sf_gamma_inc has been improved and now
avoids problems caused by internal singularities which occurred in the
series expansion for some combinations of parameters.
** IEEE comparisons of infinities and NaNs are tested during the
configure stage and the functions gsl_isnan, gsl_isinf and gsl_finite
are only compiled on platforms which support the necessary tests.
** The histogram routines now include a sum function,
gsl_histogram_sum for computing the total bin sum, and additional
statistics functions for 2d histograms.
** Internal error checking of user-defined functions has been improved
in the multiroots functions.
** Constants now include the Bohr Radius and Vacuum Permittivity.
** Range checking is now turned off when building the library, but is
still on by default when compiling user applications.
** A combinations directory has been added for generating combinations (n,k).
** The gamma function now returns exact values for integer arguments.
** Fixed bugs in gsl_sf_hyperg_1F1_int and gsl_sf_hyperg_1F1.
** Fixed internal error handling in gsl_sf_laguerre_n to allow
recovery from overflow.
** Several routines for handling divided difference polynomials have
been added to the poly/ directory.
** The interpolation routines now include polynomial interpolation,
based on divided-differences.
** Added new random number generators from Knuth's Seminumerical
Algorithms, 3rd Edition: borosh13, coveyou, fishman18, fishman20,
fishman2x, knuthran, knuthran2, lecuyer21, waterman14.
** Changed divisor in random number generator gfsr4 from 2^32-1 to
2^32 to prevent exact value of 1.0 from being returned, as specified
in the documentation.
Summary of changes:
- removal of USE_GTEXINFO
- addition of mk/texinfo.mk
- inclusion of this file in package Makefiles requiring it
- `install-info' substituted by `${INSTALL_INFO}' in PLISTs
- tuning of mk/bsd.pkg.mk:
removal of USE_GTEXINFO
INSTALL_INFO added to PLIST_SUBST
`${INSTALL_INFO}' replace `install-info' in target rules
print-PLIST target now generate `${INSTALL_INFO}' instead of `install-info'
- a couple of new patch files added for a handful of packages
- setting of the TEXINFO_OVERRIDE "switch" in packages Makefiles requiring it
- devel/cssc marked requiring texinfo 4.0
- a couple of packages Makefiles were tuned with respect of INFO_FILES and
makeinfo command usage
See -newly added by this commit- section 10.24 of Packages.txt for
further information.
(uebayasi@soum.co.jp).
To quote from the PR:
Changes from the previous pkgsrc'ed version (0.9.0) are too many to write here, but five of them
picking them randomly :
* The single precision ffts now uses float throughout, rather than mixing float and double.
* Vector and matrix views are now compliant with the ANSI standard.
* Routines for complex LU decomposition are now available, allowing the solution of systems of
equations with complex coefficients.
* Reorganized the multmin functions to use the same interface as the other iterative solvers.
* Increased the maximum number of iterations in gsl_poly_complex_solve() from 30 to 60.
In addition, a buildlink.mk file was provided by Masao-san.
* What is new in gsl-0.9:
** There is a new system of vector and matrix views. Any code using
vector and matrix views will need to be updated.
** The order of arguments of the view functions involving strides have
been changed to be consistent with the rest of the library.
** The ode solvers have been reorganized.
** There are new eigensystem routines for real symmetric and complex
hermitian matrices.
** The linear algebra directory now includes functions for computing
symmetric tridiagonal decompositions and bidiagonal decompositions.
** The svd routines now include the Golub-Reinsch and Modified
Golub-Reinsch algorithms in addition to the Jacobi algorithm.
** The interpolation directory has been reorganized and a higher-level
"spline" interface has been added which simplifies the handling of
interpolation arguments.
** IEEE support is now available on OpenBSD.
* What is new in gsl-0.8:
** The build process now uses the latest libtool and automake
** The library should now compile with Microsoft Visual C++
** Portable versions of the isinf, isnan and finite functions are
available as gsl_isinf(x), gsl_isnan(x) and gsl_finite(x).
** The definitions of GSL_POSINF, GSL_NEGINF and GSL_NAN no longer
cause divisions by zero during compilation.
** The gsl_interp_obj has been renamed to gsl_interp
** The poly_eval and pow_int functions have been moved from the
specfunc directory to the poly and sys directories.
** The Chebyshev functions are now available as an independent module
in their own directory.
** The error handling conventions have been unified across the
library. This simplifies the use of the special functions.
** A full CBLAS implementation is now included for systems where ATLAS
has not been installed. The CBLAS library can also be used
independently of GSL. The organisation of the BLAS directories has been
simplified.
** IEEE support for HPUX-11, NetBSD, Apple Darwin and OS/2 are now
included.
** The library now includes implementations of log1p, expm1, hypot,
acosh, asinh, atanh for platforms which do not provide them.
** The convention for alloc and set functions has changed so that they
are orthogonal. After allocating an object it is now necessary to
initialize it.
** There is a new module for estimating numerical derivatives of functions
** There is a new module for handling data with ntuples
** The histogram lookup functions are now optimized for the case of
uniform bins, and include an inline binary search for speed.
** The Chebyschev coefficients for the QAWO algorithm are now
precomputed in a table for efficiency, rather than being computed on
the fly.
** There are several new sorting functions for selecting the k-th
smallest or largest elements of a dataset.
** Iterator functions are now available for permutations,
gsl_permutation_next and gsl_permutation_prev.
** The function gsl_complex_xy has been renamed gsl_complex_rect
** The API for simulated annealing has been changed to support search
spaces in which the points cannot be represented as contiguous-memory
data structures. gsl_siman_solve() now takes three extra arguments: a
copy constructor, a copy function and a destructor, allowing
gsl_siman_solve() to do its work with linked data structures. If all
three of these function pointers are NULL, then the traditioanl
approach of using malloc(), memcpy(), and free() with the element size
is used.
* What is new in gsl-0.7:
** Linux/PowerPC should now be well supported.
** Header files for common physical constants have been added.
** Functions linear and nonlinear regression in one or more dimensions
are now available.
** Vector and matrix views now have access to the address of the
underlying block for compatibility with VSIPL (www.vsipl.org).
** There is a new library for generating low-discrepancy quasi-random
sequences.
** The seeding procedure of the default random number generator
MT19937 has been updated to match the 10/99 release of the original
code. This fixes a weakness which occurred for seeds which were
powers of 2.
** The blas library libgslblasnative has been renamed libgslblas to avoid
confusion with system blas library
