Next: , Up: Introduction   [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 NumbersRoots of Polynomials
Special FunctionsVectors and Matrices
PermutationsCombinations
SortingBLAS Support
Linear AlgebraCBLAS Library
Fast Fourier TransformsEigensystems
Random NumbersQuadrature
Random DistributionsQuasi-Random Sequences
HistogramsStatistics
Monte Carlo IntegrationN-Tuples
Differential EquationsSimulated Annealing
Numerical DifferentiationInterpolation
Series AccelerationChebyshev Approximations
Root-FindingDiscrete Hankel Transforms
Least-Squares FittingMinimization
IEEE Floating-PointPhysical Constants
Basis SplinesWavelets

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.