| Age | Commit message (Collapse) | Author | Files | Lines |
|---|
|
New in gsl-1.15:
** Added Tuomo Keskitalo's new ode branch ode-initval2 with a
gsl_odeiv2 prefix. This provides proper support for implicit
solvers. It is intended to be the new default for differential
equations. The existing gsl_odeiv routines will be retained for
binary compatibility but their interface will be deprecated.
** Added new gsl_integrate_cquad routines for robust integration of
difficult functions using the doubly-adaptive CQUAD algorithm
(Pedro Gonnet).
** Added error checking to CBLAS functions (Jose Luis Garcia Pallero)
** Added a new function gsl_integration_glfixed_point to return
ordered Gauss-Legendre points and weights contained within a
gsl_integration_glfixed_table [bug #32237].
** Added a new function gsl_interp_type_min_size to return the size of
an interpolation type.
** Added a function gsl_pow_uint(x,n) to compute x^n for unsigned
exponents (needed when n exceeds the range of signed integers).
** Added new routine gsl_linalg_complex_cholesky_invert to handle the
matrix inversion for complex Cholesky decompositions (Huan Wu).
** Added the functions gsl_vector_equal(x,y) and gsl_matrix_equal(x,y)
for testing equality of two vectors or matrices.
** Added function gsl_eigen_nonsymmv_params to control the balancing
transformation for eigenvector calculations. Balancing is now
turned off by default for gsl_eigen_nonsymmv.
** It is now possible to choose an alternative cblas library via
pkg-config using the GSL_CBLAS_LIB environment variable or
the pkg-config --define-variable option.
** The jacobi method gsl_eigen_jacobi now uses the norm of the
off-diagonal elements for its convergence criterion, as in
algorithm 8.4.3 of Golub and van Loan.
** The newton multiroot solvers now return an error when a singular
jacobian is detected.
** The interpolation functions now return NaN and when x is out of range,
instead of extrapolating.
** The gsl_multimin_fdfsolver multidimensional minimisers now return
GSL_ENOPROG immediately if the generated trial point does not
differ from the initial point (to machine precision), avoiding
unnecessary further iterations.
** Extended the range of gsl_sf_bessel_lnKnu_e by rescaling
intermediate results to avoid internal overflows [bug #31528].
** Improved the result of gsl_sf_atanint_e for large arguments by
adding the first order 1/x correction term. [bug #29562]
** Fixed the gsl_rng_ranlxs generators to enforce a maximum seed value
of 2^31-1. Larger seed values caused out of range values to be
returned.
** Fixed gsl_ran_chisq_pdf(x,nu) to return correct result of 1/2
instead of 0 when x=0 and nu=2, and +inf when x=0 and nu<2.
** Fixed gsl_pow_int(x,n) to avoid an infinite loop when n=INT_MIN due
to wrapping of signed integers.
** Fixed gsl_sf_hyperg_2F1(a,b,c,x) to avoid returning NaN for
arguments |a|>10. [bug #24812]
** Avoid spurious underflow return code in gsl_sf_beta_inc_e when
intermediate underflow does not affect the result. [bug #30933]
** Avoid segfault in Chebyshev series derivatives gsl_cheb_calc_deriv
for n=1. [bug #29139]
|
|
* What is new in gsl-1.14:
** Upgraded to latest libtool, autoconf and automake (libtool-2.2.6b,
autoconf-2.65, automake-1.11.1). Fixes security hole in 'make
dist' (see Automake CVE-2009-4029).
** Added support for "multisets", which are similar to permutations
and combinations. A multiset is an array of k integers in the
range 0 to n-1 where each value may occur more than once. Multisets
can be used to iterate over the indices of a k-th order symmetric
tensor in n-space. (Rhys Ulerich)
** Added gsl_integrate_glfixed routines for performing fixed order
Gauss-Legendre integration
(Pavel Holoborodko, Konstantin Holoborodko, Rhys Ulerich)
** In the LMDER multi-dimensional fitting routines, the return code
GSL_ENOPROG is now used instead of GSL_CONTINUE for the case where
10 or more attempts to find a suitable trial step have been made
without success. [bug #25383]
** The confluent hypergeometric function gsl_sf_hyperg_U (a,b,x) has
been extended to support x < 0 for cases not involving
singularities in 1F1(a,b,x). [bug #27859]
** The F-distribution gsl_ran_fdist_pdf now avoids unnecessary
underflow and overflow and handles cases where n > 248. [bug
#28500]
** The SVD routines now use a scaled version of the implicit QR method
and compute the shift more reliably for values at the limit of
double precision, avoiding potential NaNs. [bug #28767]
** A compile time error is emitted if the configuration stage prevents
the functions gsl_isnan and gsl_finite from being defined.
** Added missing dereference in GSL_VECTOR_COMPLEX when not using
GSL_RANGE_CHECK [bug #28017]
** Improved the range of gsl_sf_hyperg1F1(a,b,x) when a<0,b>0. [bug
#28718]
** Added macros GSL_MAJOR_VERSION and GSL_MINOR_VERSION in
<gsl/gsl_version.h>
** Improved gsl_eigen_symmv and gsl_eigen_symm to avoid a potential
infinite loop when the tridiagonalised matrix contains very small
values. [bug #28096]
** Added functions gsl_multifit_linear_usvd and
gsl_multifit_wlinear_usvd for multilinear fitting without
column-scaling of the fit matrix.
|
|
|
|
This is a maintenance release, which fixes reported bugs and upgrades
the build system to the latest libtool, autoconf and automake.
|
|
* What is new in gsl-1.9:
** Fixed the elliptic integrals F,E,P,D so that they have the correct
behavior for phi > pi/2 and phi < 0. The angular argument is now
valid for all phi. Also added the complete elliptic integral
gsl_sf_ellint_Pcomp.
** Added a new BFGS minimisation method gsl_multimin_fdfminimizer_vector_bfgs2
based on the algorithm given by R.Fletcher in "Practical Methods of
Optimisation" (Second edition). This requires substantially fewer
function and gradient evaluations, and supercedes the existing BFGS
minimiser.
** The beta functions gsl_sf_beta_e(a,b) and gsl_sf_lnbeta_e(a,b) now
handle negative arguments a,b. Added new function gsl_sf_lnbeta_sgn_e
for computing magnitude and sign of negative beta values, analagous to
gsl_sf_lngamma_sgn_e.
** gsl_cheb_eval_mode now uses the same error estimate as
gsl_cheb_eval_err.
** Improved gsl_sf_legendre_sphPlm_e to avoid underflow with large
arguments.
** Added updated Knuth generator, gsl_rng_knuthran2002, from 9th
printing of "The Art of Computer Programming". Fixes various
weaknesses in the earlier version gsl_rng_knuthran. See
http://www-cs-faculty.stanford.edu/~knuth/news02.htm
** The functions gsl_multifit_fsolver_set, gsl_multifit_fdfsolver_set
and gsl_multiroot_fsolver_set, gsl_multiroot_fdfsolver_set now have a
const qualifier for the input vector x, reflecting their actual usage.
** gsl_sf_expint_E2(x) now returns the correct value 1 for x==0,
instead of NaN.
** The gsl_ran_gamma function now uses the Marsaglia-Tsang fast gamma
method of gsl_ran_gamma_mt by default.
** The matrix and vector min/max functions now always propagate any
NaNs in their input.
** Prevented NaN occuring for extreme parameters in
gsl_cdf_fdist_{P,Q}inv and gsl_cdf_beta_{P,Q}inv
** Corrected error estimates for the angular reduction functions
gsl_sf_angle_restrict_symm_err and gsl_sf_angle_restrict_pos_err.
Fixed gsl_sf_angle_restrict_pos to avoid possibility of returning
small negative values. Errors are now reported for out of range
negative arguments as well as positive. These functions now return
NaN when there would be significant loss of precision.
** Corrected an error in the higher digits of M_PI_4 (this was beyond
the limit of double precision, so double precision results are not
affected).
** gsl_root_test_delta now always returns success if two iterates are
the same, x1==x0.
** A Japanese translation of the reference manual is now available
from the GSL webpage at http://www.gnu.org/software/gsl/ thanks to
Daisuke TOMINAGA.
** Added new functions for basis splines, see the "Basis Splines"
chapter in the GSL Reference Manual for details.
** Added new functions for testing the sign of vectors and matrices,
gsl_vector_ispos, gsl_vector_isneg, gsl_matrix_ispos and
gsl_matrix_isneg.
** Fixed a bug in gsl_sf_lnpoch_e and gsl_sf_lnpoch_sgn_e which caused
the incorrect value 1.0 instead of 0.0 to be returned for x==0.
** Fixed cancellation error in gsl_sf_laguerre_n for n > 1e7 so that
larger arguments can be calculated without loss of precision.
** Improved gsl_sf_zeta_e to return exactly zero for negative even
integers, avoiding less accurate trigonometric reduction.
** Fixed a bug in gsl_sf_zetam1_int_e where 0 was returned instead of
-1 for negative even integer arguments.
** When the differential equation solver gsl_odeiv_apply encounters a
singularity it returns the step-size which caused the error code from
the user-defined function, as opposed to leaving the step-size
unchanged.
** Added support for nonsymmetric eigensystems
** Added Mathieu functions
|
|
PKGINFODIR.
|
|
* What is new in gsl-1.7:
** Switched gsl_randist_binomial to use the faster binomial random
variate TPE algorithm by default. The previous binomial variate
algorithm is available as gsl_randist_binomial_knuth. This will
result in a different sequence of binomial variates in programs using
this function.
** Improved the algorithm for gsl_sf_elljac_e to avoid cancellation
errors near quarter periods.
** Fixed the branch selection in gsl_sf_gamma_inc_Q_e to avoid
inaccurate results for large a,x where x~=~a.
** The multilinear fitting functions now have forms which accept a
user-specified tolerance for the SVD cutoff and return the
corresponding effective rank of the design matrix.
** The quadratic solvers in poly/ now handle linear equations
gracefully (i.e. quadratrics with a leading coefficient of zero).
** The output of "make check" now only shows test failures by default,
to reduce the amount of output. Set the environment variable
GSL_TEST_VERBOSE=1 to display all the output. To assist debugging,
the test number of each failure is shown in square brackets at the
line-end [NNNN].
** Fixed bugs in gsl_linalg_SV_decomp_jacobi which caused
incorrect results for some input matrices.
** Bessel, coulomb, dilogarithm and legendre_H3d functions now use
hypot internally to avoid overflow when computing terms like
sqrt(1+x*x).
** The 'Usage' chapter of the reference manual now explains how to
handle deprecated functions using the GSL_DISABLE_DEPRECATED macro.
** The conflicting enum definitions for 'forward' and 'backward' in
gsl_ftt.h and gsl_wavelet.h are deprecated. User code should switch
to the new definitions gsl_fft_forward, gsl_fft_backward,
gsl_wavelet_forward and gsl_wavelet_backward. Selectively define
GSL_DISABLE_DEPRECATED before including the headers to use the new
definitions on either or both modules.
** Fixed an error in the the brent minimisation algorithm. Iterations
should now follow Brent's original description correctly.
** The bound coulomb function gsl_sf_hydrogenicR_e no longer reports
an underflow for exact zeroes of the wavefunction.
** gsl_linalg_SV_decomp_jacobi now reports an error for the
unimplemented case M<N correctly.
** Fixed conformance test for the SYRK and HERK blas functions
gsl_blas_{s,d,c,z}syrk and gsl_blas_{c,z}herk for non-square matrices.
** Configure now checks for presence of ieeefp.h if needed.
** Differential equation solvers now propagate error codes returned
from user-defined functions to the top-level in all cases.
** Sort functions now avoid an infinite loop if Nans are present in
the input vector. The order of nans in the output is undefined,
although other elements will be sorted correctly.
|
|
* Added a new wavelet directory, with 1-dimensional and 2-dimensional
discrete wavelet transforms.
* Added support for LQ and P^T LQ decompositions. To find the QR
decomposition of large systems (M>>N) use the LQ decomposition,
solving the transpose of the original system. This allows more
efficient memory access, and is useful for solving large least-squares
problems.
* Fixed a bug in the SYRK and HERK blas functions gsl_blas_{s,d,c,z}syrk
and gsl_blas_{c,z}herk which caused invalid memory access for non-square
matrices.
* Fixed a bug in gsl_swap_vectors which caused it to return incorrect
results when swapping vectors with different strides.
* Corrected the error estimate for gsl_cheb_eval_n_err to use
evaluation order instead of the approximation order.
* Improved the reliability of the gsl_sf_gamma_inc family of
functions.
* Equal abscissae are now handled gracefully in the cspline and
periodic cspline interpolations.
* Removed potential cancellation error in calculation of uniform
histogram ranges.
* Improved numerical stability of integration for akima and cspline
interpolation.
* Differential equation solvers now handle error codes returned from
user-defined functions.
* Improved error estimates in ode-initval solvers, and provide exact
derivatives on output. Added new semi-implicit ode-initval solver,
gsl_odeiv_step_rk2simp.
* Added missing function definition for gsl_sf_psi_1.
* Fixed the function gsl_sf_expint_Ei_scaled to call
gsl_sf_expint_Ei_scaled_e instead of gsl_sf_expint_Ei_e.
* Added cumulative distribution function for exponential power
distribution.
* The functions gsl_cdf_beta_P and gsl_cdf_beta_Q now return
consistent results of 0 or 1 for out of range values, x<0 and x>1,
rather than 0 for left and right tails simultaneously.
* The Jacobi eigensolvers gsl_eigen_jacobi and gsl_eigen_jacobi_invert
have new implementations from Golub and Van Loan.
* The standard output and standard error streams are now flushed by
the default error handler before the program aborts, in order to
ensure that error messages are properly displayed on some platforms.
|
|
All library names listed by *.la files no longer need to be listed
in the PLIST, e.g., instead of:
lib/libfoo.a
lib/libfoo.la
lib/libfoo.so
lib/libfoo.so.0
lib/libfoo.so.0.1
one simply needs:
lib/libfoo.la
and bsd.pkg.mk will automatically ensure that the additional library
names are listed in the installed package +CONTENTS file.
Also make LIBTOOLIZE_PLIST default to "yes".
|
|
notable changes besides bugfixes are:
** Multifit routines now handle iterations where |f| is already
minimised to zero, without division by zero.
** Numerical derivatives should now be calculated using the
gsl_deriv_forward, gsl_deriv_central and gsl_deriv_backward functions,
which accept a step-size argument in addition to the position x. The
original gsl_diff functions (without the step-size) are deprecated.
** The tridiagonal matrix solvers gsl_linalg_solve_symm_tridiag,
gsl_linalg_solve_tridiag, gsl_linalg_solve_symm_cyc_tridiag,
gsl_linalg_solve_cyc_tridiag now use the GSL_ERROR macro to report
errors, instead of simply returning an error code. The arguments to
these functions must now use exact lengths with no additional
elements. For cyclic systems all vectors must be of length N, for
tridiagonal systems the offdiagonal elements must be of length N-1.
** The singular value decomposition routines gsl_linalg_SV_decomp and
gsl_linalg_SV_decomp_mod now handle the SVD of a column vector (N=1,
arbitrary M), which can occur in linear fitting.
** Added Stefan-Boltzmann constant and Thomson cross section to
physical constants
|
|
|
|
* What is new in gsl-1.4:
** Added cumulative distribution functions and their inverses for the
continuous random distributions including: gaussian, lognormal, gamma,
beta, cauchy, laplace, chisq, exponential, gumbel, weibull,
F-distribution, t-distribution, logistic, pareto and rayleigh.
** Added faster binomial random variates using the TPE rejection
algorithm, in the function gsl_randist_binomial_tpe.
** Added new functions gsl_rng_fwrite and gsl_rnd_fread for storing
the state of random number generators in a file.
** Added a new function gsl_combination_memcpy()
** Corrected values of electrical constants in CGS units. To take
account of different electrical systems of units the values are now
prefixed by GSL_CONST_MKSA (for the SI Metre, Kilogram, Second, Ampere
system) or GSL_CONST_CGSM (for the Centimetre, Gram, Second, Magnetic
system with the Gauss as the fundamental unit of magnetic field
strength). The previous GSL_CONST_MKS and GSL_CONST_CGS prefixes have
been removed, as have the permeability and permittivity constants in
the CGS system since this uses different defining equations.
** Fixed bugs in the random number generators gsl_rng_fishman18,
gsl_rng_fishman2x, and gsl_rng_knuthran2 which caused them to return
incorrect results. Minor corrections were made to the parameters in
the other Knuth generators borosh13, coveyou, fishman20, lecuyer21,
and waterman14.
** Fixed a missing transpose bug in the gsl_linalg_QR_QRsolve
and gsl_linalg_QRPT_QRsolve routines which were computing the
solution to Q^T R x = b instead of Q R x = b.
** Fixed gsl_sf_gammainv to return zero instead of a domain
error for arguments corresponding to singularities in gamma.
** Fixed a bug in the simplex minimization algorithm which
caused it to fail to find the second highest point correctly
when searching the set of simplex points.
** Fixed a bug in the conjugate gradient minimizers conjugate_pr,
conjugate_fr and vector_bgfs which caused the search
directions to be updated incorrectly.
** Fixed a bug in gsl_sf_psi_1_int(1) which caused it to
return the incorrect sign for psi(1,1).
** Fixed the simulated annealing routine gsl_siman_solve to use the
parameter iters_fixed_T for the number of iterations at fixed
temperature instead of n_tries.
** Fixed a bug in gsl_combination_valid which caused it to return the
incorrect status.
** Fixed a bug in gsl_permutation_canonical_to_linear which caused the
output to always be zero, and the input permutation to be incorrectly
replaced by the output.
** Fixed a bug is gsl_ran_discrete which could cause uninitialised
data to be returned for some distributions.
** Fixed the dependencies for gsl_chebyshev.h to include gsl_math.h.
** Fixed a bug in gsl_complex_arccsc_real which caused it to return
the incorrect sign for the imaginary part when -1<x<0.
** Fixed a bug in the QAWC Cauchy integration routine which could
allow the singularity to fall on an interval boundary, leading to
division by zero.
** Improved gsl_sf_gamma_inc_P(a,x) to avoid a domain error for x<<a
when a>10.
** Improved the accuracy of gsl_sf_coupling_3j for large arguments.
** Improved the performance of gsl_sf_choose(m,n) by separating the
calculations for small and large arguments.
** On platforms without IEEE comparisons gsl_{isnan,isinf,finite} will
fall back to the system versions of isnan, isinf and finite if
available.
** gsl_linalg_householder_hv now uses BLAS routines internally
** The script configure.in is now compatible with autoconf-2.50 and
later.
** Reduced the memory usage of the multifit algorithms from MxM to MxN
for large M by performing the QR decomposition of the Jacobian
in-place.
** IEEE modes now use the C99 fenv.h functions when platform spectific
functions are not available.
|
|
|
|
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.
|
|
|
