We are looking for volunteers to do the following tasks. Consult the TODO files in each directory first for specific requirements.
reproducible, and that all relevant information is supplied)
papers for other developers.
<gvdeynde@sckcen.be> ?)
Break binary compatibility, but keep source compatibility.
(add functions where needed, don’t remove)
vs _inverse). Also adopt a convection for functions which can operate in place vs use of workspace (e.g linalg_solve functions).
Generally all the iterative routines should follow a consistent approach to outputting everything that is necessary for the next iteration
if a root has been found or GSL_CONTINUE if further iterations may be needed.
conventions for special functions.
around 3 separate bug reports for these)
rewritten from scratch - the current version is filled with goto statements, and while its supposed to be based on MINPACK, I’ve found numerous examples where GSL fails to converge when MINPACK succeeds, so something was not implemented correctly.
loops. It introduces variation between platforms which is undesirable. It should be replaced with a preprocessor variable ACC_DOUBLE so that the user can compile the library with the old long double behavior if desired.
speed improvements on large-scale systems. There may be some instances where a simple for() loop is preferred since there’s a function-call overhead in calling BLAS routines.
condition. Use GCOV to improve coverage.
can be included in the GAMs website.
parameters. EDOM means a domain error (i.e. float or mathematically undefined), EINVAL means invalid (i.e. zero length)
throughout, where appropriate. Similarly change any if(…) checks of return values to use == GSL_SUCCESS, if they are checking for zero. N.B. want to be careful about accidentally omitting error conditions if using something like == GSL_FAILURE when function returns a different error code.
the outermost layer which may have been missed. Everything should be of the form #define foo(x) (....) so there is no possibility of bad parsing. Need a perl script to check this!
(integration/). It is better to write the code to avoid dependence on rounding.
constant pointers (const gsl_roots_fsolver_type * const gsl_roots_fsolver_brent)
PyGSL – python bindings for GSL, see http://pygsl.sf.net/
ASCII import Categorical Sets Kernel Density Estimation Shampine Polynomial Regression Bootstrapping, Jacknife Descriptive: Range, Trimmed Mean, Winsorized Mean, Moments Harmonic mean, RMS, Durbin-Watson, AR1 independence Autocorr, Autocorr_z, Cramer vos Mises, Anderson-Darling Spearman-rho, Kendall-tau, EDF_D_both EDF_D_plus, EDF_D_minus, EDF_D, EDF_kuiper_V, pooled mean pooled var, Tests: kolmogorov_smirnov Moving average, Exponential moving average wilcoxon_statistic, wilcoxon_noties_cdf, wilcoxon_general_cdf Cochran Q test, KruskalWallis, McNemar, spearman_Rocc
We could also provide g-wrap wrappers for guile, or swig.i files and swig demos so that swig can be run more easily.
for LAPACK first, their web page is vague on what the license terms are. Some parts of LAPACK are included in octave so maybe the Octave maintainers will know more.
Abramowitz and Stegun, “Handbook of Mathematical Functions” appears to be public domain.
SEPT/02: See online images at http://members.fortunecity.com/aands/
Devroye’s book on Random Variates (1st ed) is/was in the public domain.
convert argument to double, losing the imaginary part. This is mentioned in CEPHES documentation in 1998 with a patch to generate a warning. What happened? (Does it now work with gcc-3.0?)
what should be provided outside of BLAS.
Also, put under dir section “Math” (which seems to be the appropriate one for Debian, as Octave, Gnuplot etc are in that)
the user can be prevented from passing unsorted data, which is not checked for.
where the user can provide formulas as strings. Keith Briggs recommended formulc2.22 which he had found useful in several projects. http://www.cs.brandeis.edu/~hhelf/formu/formulc.html. It is LGPL. Alternatively, the source code for GDB contains yacc grammars and evaluators for expressions in various languages, so that would be another way to go. It would have the advantage of following the language standards. If I was going to write something from scratch I would think about using that as a base, as the full set of operators are already included with the correct precedence rules. Being able to evaluate C and Fortran expressions could be useful.
of size_t for vectors and matrices, or at least vectors and matrices of size_t in addition to long, int, etc.