| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
1.1 Routines available in GSL
The library covers a wide range of topics in numerical computing. Routines are available for the following areas,
Complex Numbers | Roots of Polynomials | |
Special Functions | Vectors and Matrices | |
Permutations | Combinations | |
Sorting | BLAS Support | |
Linear Algebra | CBLAS Library | |
Fast Fourier Transforms | Eigensystems | |
Random Numbers | Quadrature | |
Random Distributions | Quasi-Random Sequences | |
Histograms | Statistics | |
Monte Carlo Integration | N-Tuples | |
Differential Equations | Simulated Annealing | |
Numerical Differentiation | Interpolation | |
Series Acceleration | Chebyshev Approximations | |
Root-Finding | Discrete Hankel Transforms | |
Least-Squares Fitting | Minimization | |
IEEE Floating-Point | Physical Constants | |
Basis Splines | Wavelets |
The use of these routines is described in this manual. Each chapter provides detailed definitions of the functions, followed by example programs and references to the articles on which the algorithms are based.
Where possible the routines have been based on reliable public-domain packages such as FFTPACK and QUADPACK, which the developers of GSL have reimplemented in C with modern coding conventions.