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	Sorting
	BLAS Support	Linear Algebra
	Eigensystems	Fast Fourier Transforms
	Quadrature	Random Numbers
	Quasi-Random Sequences	Random Distributions
	Statistics	Histograms
	N-Tuples	Monte Carlo Integration
	Simulated Annealing	Differential Equations
	Interpolation	Numerical Differentiation
	Chebyshev Approximations	Series Acceleration
	Discrete Hankel Transforms	Root-Finding
	Minimization	Least-Squares Fitting
	Physical Constants	IEEE Floating-Point

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.