Go to the first, previous, next, last section, table of contents.

Routines available in GSL

The library covers a wide range of topics in numerical computing. Routines are available for the following areas,

@multitable @columnfractions 0.05 0.45 0.45 0.05

  • @tab Complex Numbers @tab Roots of Polynomials
  • @tab Special Functions @tab Vectors and Matrices
  • @tab Permutations @tab Sorting
  • @tab BLAS Support @tab Linear Algebra
  • @tab Eigensystems @tab Fast Fourier Transforms
  • @tab Quadrature @tab Random Numbers
  • @tab Quasi-Random Sequences @tab Random Distributions
  • @tab Statistics @tab Histograms
  • @tab N-Tuples @tab Monte Carlo Integration
  • @tab Simulated Annealing @tab Differential Equations
  • @tab Interpolation @tab Numerical Differentiation
  • @tab Chebyshev Approximations @tab Series Acceleration
  • @tab Discrete Hankel Transforms @tab Root-Finding
  • @tab Minimization @tab Least-Squares Fitting
  • @tab Physical Constants @tab 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.
    Go to the first, previous, next, last section, table of contents.