 Code using the library and the computed results In computing, GNU Scientific Library (or GSL) is a software library written in the C programming language for numerical calculations in applied mathematics and science. The GSL is part of the GNU project and is distributed under the GNU General Public License. Image File history File links Gsl-screenshot. ...
Image File history File links Gsl-screenshot. ...
Originally, the word computing was synonymous with counting and calculating, and a science that deals with the original sense of computing mathematical calculations. ...
In computer science, a library is a collection of subprograms used to develop software. ...
The C Programming Language, Brian Kernighan and Dennis Ritchie, the original edition that served for many years as an informal specification of the language The C programming language is a standardized imperative computer programming language developed in the early 1970s by Dennis Ritchie for use on the Unix operating system. ...
Applied mathematics is a branch of mathematics that concerns itself with the application of mathematical knowledge to other domains. ...
// What is science? There are various understandings of the word science. According to empiricism, scientific theories are objective, empirically testable, and predictive — they predict empirical results that can be checked and possibly contradicted. ...
The GNU logo, drawn by Etienne Suvasa The GNU project was announced in September 1983 (and begun in January 1984) by Richard Stallman with the goal of creating a complete, free software operating system. ...
The GNU logo The GNU General Public License (GNU GPL or simply GPL) is a free software license, originally written by Richard Stallman for the GNU project. ...
Example
The following example program calculates the value of the Bessel function for 5 [1]: In mathematics, Bessel functions, first defined by the Swiss mathematician Daniel Bernoulli and named after Friedrich Bessel, are canonical solutions y(x) of Bessels differential equation: for an arbitrary real number α (the order). ...
#include <stdio.h> #include <gsl/gsl_sf_bessel.h> int main (void) { double x = 5.0; double y = gsl_sf_bessel_J0 (x); printf ("J0(%g) = %.18en", x, y); return 0; } The output is shown below, and should be correct to double-precision accuracy: J0(5) = -1.775967713143382920e-01
Features The software library provides facilities for: In mathematics, several functions are important enough to deserve their own name. ...
In mathematics, the complex numbers are an extension of the real numbers by the inclusion of the imaginary unit i, satisfying . ...
In mathematics, polynomial functions, or polynomials, aresimple and smooth [[function_(mathematics) | functions] an important class of ]. Here, simple means they are constructed using only multiplication and addition. ...
In mathematics, there is a theory or theories of special functions, particular functions such as the trigonometric functions that have useful or attractive properties, and which occur in different applications often enough to warrant a name and attention of their own. ...
A vector space (or linear space) is the basic object of study in the branch of mathematics called linear algebra. ...
For the square matrix section, see square matrix. ...
In mathematics, especially in abstract algebra and related areas, a permutation is a bijection from a finite set X onto itself. ...
In combinatorial mathematics, a combination of members of a set is a subset. ...
Sorting refers to a process of arranging items in some sequence and/or in different sets, and accordingly, it has two common, yet distinct meanings: ordering: aranging items of the same kind, class, nature, etc. ...
Basic Linear Algebra Subprograms (BLAS) are routines which perform basic linear algebra operations such as vector and matrix multiplication. ...
Linear algebra is the branch of mathematics concerned with the study of vectors, vector spaces (or linear spaces), linear transformations, and systems of linear equations. ...
A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. ...
In numerical analysis, the term numerical integration is used to describe a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe numerical algorithms for solving differential equations. ...
A random number generator is a computational or physical device designed to generate a sequence of numbers that does not have any easily discernable pattern, so that the sequence can be treated as being random. ...
In mathematics, a probability distribution assigns to every interval of the real numbers a probability, so that the probability axioms are satisfied. ...
Statistics is a broad mathematical discipline which studies ways to collect, summarize and draw conclusions from data. ...
In statistics, a histogram is a graphical display of tabulated frequencies. ...
In mathematics, a tuple is a finite sequence of objects (a list of a limited number of objects). ...
This article describes multidimensional Monte Carlo integration. ...
Simulated annealing (SA) is a generic probabilistic meta-algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. ...
An ordinary differential equation, or ODE, is an equation depending on a single spatial variable. ...
In the mathematical subfield of numerical analysis, interpolation is a method of constructing new data points from a discrete set of known data points. ...
Numerical differentiation is a technique of numerical analysis to produce an estimate of the derivative of a mathematical function or function subroutine using values from the function and perhaps other knowledge about the function. ...
In mathematics and statistics, the discrete Hankel transform acts on a vector of sampled data, where the samples are assumed to have been taken at points related to the zeroes of a Bessel function of fixed order; compare this to the case of the discrete Fourier transform, where samples are...
A root-finding algorithm is a numerical method or algorithm for finding a value x such that f(x) = 0, for a given function f. ...
In mathematics, the term optimization refers to the study of problems that have the form Given: a function f : A R from some set A to the real numbers Sought: an element x0 in A such that f(x0) ≤ f(x) for all x in A (minimization) or such that...
Least squares is a mathematical optimization technique that attempts to find a best fit to a set of data by attempting to minimize the sum of the squares of the ordinate differences (called residuals) between the fitted function and the data. ...
The Levenberg-Marquardt algorithm provides a numerical solution to the mathematical problem of minimizing a sum of squares of several, generally nonlinear functions that depend on a common set of parameters. ...
In science, a physical constant is a physical quantity whose numerical value does not change. ...
The IEEE Standard for Binary Floating-Point Arithmetic (IEEE 754) is the most widely-used standard for floating-point computation, and is followed by many CPU and FPU implementations. ...
See also Netlib, www. ...
Numerical Recipes is the generic term for the following books on algorithms and numerical analysis, all by William Press, Saul Teukolsky, William Vetterling and Brian Flannery: Numerical Recipes in C++. The Art of Scientific Computing, ISBN 0-521-75033-4. ...
External links - GNU Scientific Library Manual
|
Feeds |
Contact