[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

Problem Index

Airy functions: C10d
Anger functions: C10e
Arithmetic: A
- Base conversion: A6b
- Change of representation: A6
- Complex: A4
- Construction of machine numbers: A6c
- Decomposition of machine numbers: A6c
- Error analysis: A
- Extended precision: A3c, A4c
- Extended range: A3d, A4d
- Integer: A1
- Interval: A5
- Rational: A2
- Real: A3
- Type conversion: A6a
Base conversion: A6b
Bessel functions: C10
Bessel integrals: C10f
Beta functions: C7b
Binomial coefficient: C1
Ceiling function: C1
Chebyshev polynomials: C3a2
Combinations: C1
Complementary error function: C8a
Complementary incomplete gamma function: C7e
Complex arithmetic: A4
Confluent hypergeometric functions: C11
Convergence acceleration: A7
Cosine integrals: C6
Coulomb wave functions: C12
Cube root: C2
Elliptic integrals: C14
Epsilon algorithm: A7
Error analysis: A
Error function: C8a
Error integrals: C8a
Exponential function: C4b
Exponential integrals: C5
Extended precision arithmetic: A3c, A4c
Extended range arithmetic: A4d, A3d
Factorial function: C1
Floor function: C1
Fresnel integrals: C8b
Gamma function: C7a
Hermite polynomials: C3a4
Hyperbolic functions: C4c
Incomplete beta function: C7f
Incomplete gamma function: C7e
Integer-valued functions: C1
Interval arithmetic: A5
Inverse error function: C8a
Inverse hyperbolic functions: C4c
Inverse trigonometric functions: C4a
Jacobian elliptic functions: C13
Kelvin functions: C10c
Laguerre polynomials: C3a3
Legendre functions: C9
Legendre polynomials: C3a2
Log beta functions: C7b
Log gamma function: C7a
Logarithmic function: C4b
Logarithmic integrals: C5
Mathieu functions: C17
Machine-dependent numbers: A6c
Normal distribution function: C8a
Number theory: B
Orthogonal polynomials: C3a
Parabolic cylinder functions: C16
Permutations: C1
Polygamma function: C7d
Polynomials: C3
Powers: C2
Psi function: C7c
Rational arithmetic: A2
Reciprocal gamma functions: C7a
Reciprocals: C2
Riemann zeta function: C7g
Roots (e.g., square root): C2
Scorer functions: C10d
Sequences: A7
Sine integrals: C6
- See Also Functions
- See Also Mathematical functions
- See Also Statistical functions
Mathematical Functions: C
- Absolute value: A3
- Acosh: C4c
- Arc cosine: C4a
- Arc hyperbolic cosine: C4c
- Arc hyperbolic sine: C4c
- Arc hyperbolic tangent: C4c
- Arc sine: C4a
- Arc tangent: C4a
- Argument of a complex number: A4
- Asinh: C4c
- Atanh: C4c
- Airy: C10d
- Anger: C10e
- Bairy function: C10d
- Bessel: C10
- Bessel integrals: C10f
- Beta: C7b
- Bickley functions: C10f
- Binomial coefficient: C1
- Ceiling: C1
- Chebyshev polynomials: C3a2
- Combinations: C1
- Complementary error: C8a
- Complementary incomplete gamma: C7e
- Complete beta function: C7b
- Complete elliptic integral: C14
- Complete gamma function: C7a
- Confluent hypergeometric: C11
- Cosine: C4a
- Cotangent: C4a
- Cosine integrals: C6
- Coulomb wave: C12
- Cube root: C2
- Ei function: C5
- Erf: C8a
- Erfc: C8a
- Elliptic integrals: C14
- Error: C8a
- Error integrals: C8a
- Exponential: C4b
- Exponential integrals: C5
- Factorial: C1
- Floor: C1
- Fresnel integrals: C8b
- Gamma: C7a
- Gamma, derivative of: C7a
- Digamma: C7a
- Hermite polynomials: C3a4
- Hyperbolic functions: C4c
- Hyperbolic Bessel function: C10b
- I Bessel function: C10b
- Incomplete beta function: C7b
- Incomplete elliptic integral: C14
- Incomplete gamma function: C7e
- Incomplete beta: C7f
- Incomplete gamma: C7e
- Integer-valued: C1
- Integrals of elementary transcendental functions: C4d
- Inverse error: C8a
- Inverse hyperbolic: C4c
- Inverse trigonometric: C4a
- J Bessel function: C10a
- Jacobian elliptic: C13
- K Bessel function: C10b
- Kelvin: C10c
- Laguerre polynomials: C3a3
- Legendre: C9
- Legendre polynomials: C3a2
- Log beta: C7b
- Log gamma: C7a
- Logarithmic: C4b
- Logarithmic integrals: C5
- Logarithmic confluent hypergeometric function: C11
- Mathieu: C17
- Modified Bessel function: C10
- Normal distribution: C8a
- Orthogonal polynomials: C3a
- Other: C19
- Parabolic cylinder: C16
- Permutations: C1
- Polygamma: C7d
- Polynomials: C3
- Powers: C2
- Psi: C7c
- Reciprocal gamma: C7a
- Reciprocals: C2
- Riemann zeta: C7g
- Roots (e.g., square root): C2
- Scorer: C10d
- Sine: C4a
- Sine integrals: C6
- Spheroidal wave: C18
- Square root: C2
- Struve: C10e
- Tangent: C4a
- Theta: C13
- Transcendental: C4
- Tricomi: C7e
- Trigonometric: C4a
- Trigonometric polynomials: C3a1
- Weber: C10e
- Weierstrass elliptic: C15
- Y Bessel function: C10a
See Also Statistical Functions
Spheroidal wave functions: C18
Square root: C2
Struve functions: C10e
Theta functions: C13
Transcendental functions: C4
Trigonometric functions: C4a
Trigonometric polynomials: C3a1
Weber functions: C10e
Weierstrass elliptic functions: C15
Addition of matrices: D1b5
Bandwidth reduction: D2e
Cholesky decomposition: D2b1b
Conjugate gradient method: D2a4
Convolution, vector: D1a10
Copy a matrix: D1b8
Copy vectors: D1a5
Determinants: D3
- See Also Eigenvalues
Dot product: D1a4
Eigenvalues: D4
- Associated operations: D4c
- Back transform eigenvectors: D4c4
- Balance matrix: D4c1a
- Banded: D4a6
- Banded generalized: D4b5
- Complex Hermitian: D4a3
- Complex Hermitian generalized: D4b3
- Complex generalized: D4b4
- Complex non-Hermitian: D4a4
- Eigenvectors: D4
- Form eigenvectors from eigenvalues: D4c3
- Generalized (e.g., Ax = kBx): D4b
- Hessenberg: D4c2b
- Jordan normal form: D4c5
- Ordinary (Ax = kx): D4a
- QZ algorithm: D4
- Real generalized: D4b2
- Real nonsymmetric: D4a2
- Real symmetric: D4a1
- Real symmetric generalized: D4b1
- Hessenberg form, reduce to: D4c1b2
- Compact form, reduce to: D4c1b
- Tridiagonal form, reduce to: D4c1b1
- Sparse: D4a7
- Standardize problem: D4c1c
- Transform problem: D4c1
- Tridiagonal: D4a5, D4c2a
- See Also Eigenvalues
Reflection, elementary: D1a9, D1b11
Rotation, elementary: D1a8, D1b10
Euclidean vector norm: D1a3b
Exchange vectors: D1a5
Extremal polynomials: D2e
Gauss-Seidel method: D2b4
Gaussian elimination: D2
Generalized eigenvalue problems: D4b
Generalized matrix inverse: D9c
Givens transformation: D1a8, D1b10
Gram-Schmidt orthogonalization: D5
Householder transformation: D1a9, D1b11
Inner product: D1a4
Inverse of matrix: D2
Jacobi method: D2b4
Jordan normal form: D4c5
L-1 vector norm: D1a3a
L-2 vector norm: D1a3b
L-infinity vector norm: D1a3c
- See Also Linear equations
LU decomposition: D2
Linear equations: D2
- Associated operations: D2e
- Banded: D2a2
- Chebyshev solution: D9a2
- Hermitian: D2d1
- Hermitian indefinite: D2d1a
- Hermitian positive definite: D2d1b
- Hermitian positive definite banded: D2d2
- Hermitian sparse: D2d4
- Hermitian tridiagonal: D2d2a
- Complex banded: D2c2
- Complex general: D2c1
- Complex sparse: D2c4
- Complex triangular: D2c3
- Complex tridiagonal: D2c2a
- Conjugate gradient method: D2a4
- Gauss-Seidel method: D2b4
- Gaussian elimination: D2
- Jacobi method: D2b4
- L-1 solution: D9a3
- L-2 solution: D9a1
- L-infinity solution: D9a2
- Least absolute value solution: D9a3
- Least squares solution: D9a1
- Matrix reorderings: D2e
- Nonsymmetric general: D2a1
- Overdetermined systems: D9
- SOR method: D2b4
- Singular: D9
- Sparse, real: D2a4
- Sparse, complex: D2c4
- Sparse, symmetric: D2b4
- Symmetric: D2b1
- Symmetric indefinite: D2b1a
- Symmetric positive definite: D2b1b
- Symmetric positive definite banded: D2b2
- Symmetric tridiagonal: D2b2a
- Triangular, real: D2a3
- Triangular, complex: D2c3
- Tridiagonal: D2a2a
- Underdetermined: D9
See Also Matrices
Matrices: D1b
- Addition: D1b5
- Cholesky decomposition: D2b1b
- Copy: D1b8
- Determinants: D3
- Reflection, elementary: D1b11
- Rotation, elementary: D1b10
- Generalized inverse: D9c
- Givens transformation: D1b10
- Gram-Schmidt orthogonalization: D5
- Householder transformation: D1b11
- Inverses: D2
- LU decomposition: D2
- Matrix polynomials: D1b7
- Moore-Penrose generalized inverse: D9c
- Multiplication: D1b6
- Multiplication by vector: D1b4
- Norm: D1b2
- Other matrix equations (e.g., AX+XB=C): D8
- Pseudo inverse: D9c
- QR decomposition: D5
- Rank one update: D1b5
- Set to identity: D1b1
- Set to zero: D1b1
- Singular value decomposition (SVD): D6
- Storage mode conversion: D1b9
- Subtraction: D1b5
- Transpose: D1b3
- Cholesky decomposition, update: D7b
- LU decomposition, update: D7a
- QR decomposition, update: D7c
- Matrix decompositions, updating: D7
- Singular value decomposition, update: D7d
See Also Linear equations
See Also Eigenvalues
Matrix multiplication: D1b6
Matrix polynomials: D1b7
Matrix reorderings: D2e
Matrix-vector multiplication: D1b4
Maximum magnitude vector component: D1a3c
Maximum vector component: D1a2
Minimum vector component: D1a2
Moore-Penrose generalized inverse: D9c
Norm: D1a3, D1b2
Outer product: D1a11
Overdetermined systems: D9
Permutations, to nonzero diagonal: D2e
Permutations, to block triangular form: D2e
Profile reduction: D2e
Pseudo inverse: D9c
QR decomposition: D5
QZ algorithm: D4
Rank one update: D1b5
SOR method: D2b4
Singular systems: D9
Singular value decomposition (SVD): D6
Sparse systems: D2a4
Storage mode conversion: D1b9
Subtraction of matrices: D1b5
Swap vectors: D1a5
Transpose: D1b3
Underdetermined systems: D9
Update matrix decompositions: D7
Vector triad: D1a7
Vectors: D1a
- Convolution: D1a10
- Copy: D1a5
- Dot product: D1a4
- Reflection, elementary: D1a9
- Rotation, elementary: D1a8
- Euclidean norm: D1a3b
- Exchange: D1a5
- Givens transformation: D1a8
- Householder transformation: D1a9
- Inner product: D1a4
- L-1 norm: D1a3a
- L-2 norm: D1a3b
- L-infinity norm: D1a3c
- Maximum component: D1a2
- Maximum magnitude component: D1a3c
- Minimum component: D1a2
- Norm: D1a3
- Outer product: D1a11
- Scalar multiplication: D1a6
- Set to constant: D1a1
- Sum of magnitudes of components: D1a3a
- Swap: D1a5
- Triad: D1a7
Almost block diagonal systems: E3d
Assignments problem: G2b
B-splines: E3c
Bicubic spline: E2a
Binary search: G1a2
Bisection method: F1b
Bus and Dekker algorithm: F1b
Conjugate gradient method: G1b1
Constrained optimization: G2
Covering problems: G2c2
Cubic splines: E1a
Curve fitting: E1
Dynamic programming: G2g
Fletcher-Reeves method: G1b1
Geometric programming: G2f
Golden section search: G1a2
Grid generation: E3b
Gridded data interpolation: E2a
Integer programming: G2c
Interpolation: E
- Almost block diagonal systems: E3d
- B-splines: E3c
- Basis function evaluation: E3c
- Bicubic spline: E2a
- Basis, change of: E3c
- Cubic spline: E1a
- Curve fitting: E1
- Derivative of fitted function: E3a2
- Evaluation of fitted function: E3a1
- Grid generation: E3b
- Gridded data: E2a
- Knot generation: E3b
- Mesh generation: E3b
- Piecewise polynomial: E1a
- Polynomial: E1b
- Polynomial spline: E1a
- Integration of fitted function: E3a3
- Rational: E1c
- Scattered data: E2b
- Service routines: E3
- Spline: E1a
- Surface fitting: E2
- Tensor product spline: E2a
- Trigonometric: E1c
Jenkins-Traub method: F1a
Knapsack problems: G2c3
Knot generation, splines: E3b
Laguerre method: F1a
Linear programming: G2a
Location problems: G2c5
Matching problems: G2c4
- See Also Optimization
Maximum flow: G2d3
Mesh generation: E3b
- See Also Optimization
Minimum spanning tree: G2d2
Mixed integer programming: G2c7
Network optimization: G2d
Nonlinear equations: F
- Bisection method: F1b
- Bus and Dekker algorithm: F1b
- Derivatives, check user-supplied: F3
- Jenkins-Traub method: F1a
- Laguerre method: F1a
- Polynomial: F1a
- Service routines: F3
- Single: F1
- System: F2
Nonlinear programming: G2h
Optimal control: G3
Optimization: G
- Assignments problem: G2b
- Binary search: G1a2
- Redundancy, check for: G4e
- Derivatives, check user-supplied: G4c
- Conjugate gradient method: G1b1
- Constrained: G2
- Covering problems: G2c2
- Dynamic programming: G2g
- Feasible point, find: G4d
- Fletcher-Reeves method: G1b1
- Geometric programming: G2f
- Nonconvex problems, global solution to: G2i
- Golden section search: G1a2
- Integer programming: G2c
- Knapsack problems: G2c3
- Linear programming: G2a
- Location problems: G2c5
- Matching problems: G2c4
- Maximum flow: G2d3
- Minimum spanning tree: G2d2
- Mixed integer programming: G2c7
- Network optimization: G2d
- Nonlinear programming: G2h
- Optimal control: G3
- Packing problems: G2c2
- Input: G4a
- Scaling: G4b
- Integer programming, pure: G2c6
- Quadratic programming: G2e
- Quasi-Newton method: G1b1
- Routing problems: G2c5
- Scheduling problems: G2c5
- Service routines: G4
- Shortest path: G2d1
- Simplex method: G2a
- Test problem generation: G2d4
- Transportation problem: G2b
- Unconstrained: G1
- Zero/one integer programming: G2c1
See Also Approximation
See Also Regression
Packing problems: G2c2
Piecewise polynomial interpolation: E1a
Polynomial equations: F1a
Polynomial interpolation: E1b
Polynomial splines: E1a
Quadratic programming: G2e
Quasi-Newton method: G1b1
Rational function interpolation: E1c
Routing problems: G2c5
Scattered data interpolation: E2b
Scheduling problems: G2c5
Shortest path: G2d1
Simplex method: G2a
Splines: E1a
Surface fitting: E2
System of nonlinear equations: F2
Tensor product spline: E2a
Transportation problem: G2b
Trigonometric interpolation: E1c
Unconstrained optimization: G1
Zero/one integer programming: G2c1
Differentiation, numerical: H1
Integration: H2
- See Also Partial differential equations
- See Also Ordinary differential equations
Multidimensional integrals: H2b
Quadrature (integration): H2
Adams method: I1a1b
Almost block diagonal systems: K6d
Approximation: K
- B-splines: K6c
- Basis function evaluation: K6c
- Change of basis: K6c
- Curve fitting (least squares): K1a1a
- Derivative of fitted function: K6a2
- Evaluation of fitted function: K6a1
- Grid generation: K6b
- Knot generation: K6b
- L-1: K3
- L-2: K1
- L-infinity: K2
- Least absolute value: K3
- Least squares: K1
- Least squares, linear: K1a
- Least squares, linear, constrained: K1a2
- Least squares, nonlinear: K1b
- Least squares, nonlinear, constrained: K1b2
- Levenberg-Marquardt method: K1b1a
- Mesh generation: K6b
- Minimax: K2
- Other analytic approximations: K4
- Pade: K4
- Piecewise polynomials, least square fit: K1a1a1
- Polynomial splines, least square fit: K1a1a1
- Polynomials, least square fit: K1a1a2
- Integration of fitted function: K6a3
- Rational functions, least square fit: K1a1a3
- Service routines: K6
- Smoothing: K5
- Surface fitting: K1a1b
- Taylor polynomial: K4
- Trigonometric functions, least square fit: K1a1a3
See Also Regression
B-splines: K6c
Biharmonic equation: I2b1c
Boundary value problems for PDEs: I2b
Boundary value problems for ODEs: I1b
Bulirsch-Stoer method: I1a1c
Collocation method for ODEs: I1b
Convolution: J2
Cosine transform: J1a3
Curve fitting: K1a1a
Cyclic reduction method: I2b4b
Diffusion equation: I2a1
Domain triangulation: I2b4a
Eigenvalue elliptic boundary value problem: I2b3
Eigenvalue problems for ODEs: I1b3
Elliptic boundary value problems: I2b
FFT: J1a
Fast Fourier transforms: J1
Fast Poisson solver: I2b1a1
Fourier transform: J1
Fredholm integral equation: I3
Gear method: I1a2
Grid generation: K6b
Heat equation: I2a1
Helmholtz equation: I2b1a1
Hilbert transforms: J4
Hyperbolic problem: I2a2
Initial boundary value problems: I2a
Initial value problem: I1a
Integral equations: I3
- See Also Transforms
Transforms: J
- Complex FFT: J1a2
- Convolutions: J2
- Cosine: J1a3
- FFT: J1a
- Fast Fourier transforms: J1
- Fourier: J1
- Hilbert: J4
- Laplace: J3
- Multidimensional FFT: J1b
- Quarter wave: J1a3
- Real FFT: J1a1
- Sine: J1a3
- Trigonometric: J1a3
Jacobi method: I2b4b
Knot generation, splines: K6b
L-1 approximation: K3
L-2 approximation: K1
L-infinity approximation: K2
Laplace equation: I2b1a1
Laplace transform: J3
Least absolute value approximation: K3
Least squares approximation: K1
Levenberg-Marquardt method: K1b1a
Linear least squares approximation: K1a
Mathieu equation: I1b3
Mesh generation: K6b
Minimax approximation: K2
Multipoint boundary value problem: I1b
Nonlinear elliptic boundary value problem: I2b2
Nonlinear least squares approximation: K1b
- See Also Ordinary differential equations
Ordinary differential equations: I1
- Adams method: I1a1b
- Boundary value problem: I1b
- Bulirsch-Stoer method: I1a1c
- Collocation method: I1b
- Eigenvalue: I1b3
- Error handling: I1c
- Extrapolation method: I1a1c
- Gear method: I1a2
- Initial value problem: I1a
- Interpolation of solutions: I1c
- Mixed algebraic-differential equations: I1a2
- Multipoint boundary value problem: I1b
- Multistep method: I1a1b
- One-step method: I1a1a
- Predictor-corrector method: I1a1b
- Runge-Kutta method: I1a1a
- Service routines: I1c
- Shooting method: I1b
- Stiff: I1a2
- Sturm-Liouville problem: I1b3
- Two point boundary value problem: I1b
Pade approximation: K4
Parabolic problem: I2a1
Partial differential equations: I2
- Biharmonic equation: I2b1c
- Boundary value problem: I2b
- Cyclic reduction method: I2b4b
- Diffusion equation: I2a1
- Domain triangulation: I2b4a
- Eigenvalue: I2b3
- Elliptic: I2b
- Fast Poisson solver: I2b1a1
- Heat equation: I2a1
- Helmholtz equation: I2b1a1
- Hyperbolic: I2a2
- Initial boundary value problem: I2a
- Jacobi method: I2b4b
- Laplace equation: I2b1a1
- Nonlinear: I2b2
- Nonseparable elliptic problem: I2b1a3
- Parabolic: I2a1
- Poisson equation: I2b1a1
- Potential equation: I2b1a1
- Relaxation method: I2b4b
- SOR method: I2b4b
- Separable elliptic problem: I2b1a1
- Service routines: I2b4
- Solution of discretized elliptic equation: I2b4b
- Triangulation: I2b4a
- Wave equation: I2a2
- See Also Partial differential equations
Piecewise polynomial approximation: K1a1a1
Poisson equation: I2b1a1
Polynomial approximation: K1a1a2
Polynomial splines: K1a1a1
Potential equation: I2b1a1
Predictor-corrector method: I1a1b
Quarter wave transform: J1a3
Relaxation method: I2b4b
Runge-Kutta method: I1a1a
SOR method: I2b4b
Separable elliptic problem: I2b1a1
Shooting method: I1b
Sine transform: J1a3
Smoothing: K5
Stiff differential equation: I1a2
Sturm-Liouville problem: I1b3
Surface fitting: K1a1b
Taylor polynomial approximation: K4
Triangulation: I2b4a
Trigonometric approximation: K1a1a3
Trigonometric transform: J1a3
Two point boundary value problem: I1b
Volterra integral equation: I3
Wave equation: I2a2
2-by-2 tables: L9a
- See Also Analysis of variance
ARMA and ARIMA time series: L10a2d, L10b2, L10c
ARMA and ARIMA filters: L10a1c4
Analysis of variance: L7
- Balanced complete data: L7d1
- Balanced incomplete data: L7d2
- Experimental designs, generate random: L7f, L6b5
- Factorial designs: L7d1
- General linear models: L7d3
- Latin squares: L7c
- Multi-way: L7d
- Multivariate: L7e
- One-way: L7a
- Service routines: L7g
- Three-way: L7c
- Two-way: L7b
- Unbalanced data: L7d3
Autocorrelations and autocovariances: L10a2a
Autoregressive linear filters: L10a1c3
Autoregressive time series: L10a2c, L10b2, L10c
Bar charts: L3a4
Beta distribution: L4a1a2b, L5a1b, L6a2, L5a2b
Binomial distribution: L4a1a2b, L4a1a4b, L5a1b, L5a2b, L6a2
Boolean distribution: L6a2
Bivariate histograms: L3b1
Box-Jenkins methods: L10a2d
Box-plots: L3a3
Calibration: L8a1d
Canonical correlation: L13c
Categorical data analysis: L9
- 2-by-2 tables: L9a
- EDA: L9d
- Log-linear models: L9c
- Median polish: L9d
- Contingency tables, random: L6b3
- Two-way tables: L9b
Cauchy distribution: L4a1a2c, L5a1c, L5a2c, L6a3
Censored data: L4a3
Chi-squared distribution: L4a1a2c, L4a1a3c, L5a1c, L5a2c, L6a3
Cluster analysis: L14
- Constrained one-way: L14a2
- Display: L14c
- Distance matrix, compute: L14d
- Divisive: L14a1a2
- Joining: L14a1a1
- K-means: L14a1b
- Missing values, predict: L14a1a4
- Nested: L14a1a
- Non-nested: L14a1b
- One-way: L14a
- Service routines: L14d
- Single link: L14a1a1
- Switching: L14a1a3
- Two-way: L14b
- Unconstrained one-way: L14a1
Co-spectra: L10b3a6
Coherency spectrum: L10b3a6
Complex demodulation: L10a3b
- See Also Categorical data analysis
Correlation analysis: L11
Correlation matrices, random: L6b3
Correlation and covariance statistics: L1b, L1c1b
Covariance structure models: L13
Cross-amplitude spectra: L10b3a6
Cross-correlations and cross-covariances: L10b2a, L10c, L10d
Cross-periodogram analysis: L10b3a2
Cross-spectral analysis: L10b3a
Cross-spectrum estimation: L10b3a3, L10b3a4
- See Also Regression
- See Also Approximation
Density estimation, nonparametric: L4a1b2
Density and distribution function plots: L4a1a1, L4b1a1
- See Also Statistical functions
Difference filters: L10a1c1
Discriminant analysis: L12
Dispersion statistics: L1a1b, L4a1b1
- See Also Statistical data analysis
- See Also Statistical functions
- See Also Random number generation
- See Also Analysis of variance
- See Also Statistical data analysis
Divisive clustering algorithms: L14a1a2
Double exponential distribution: L4a1a2d, L5a1d, L6a4, L5a2d
EDA (exploratory data analysis): L3a3, L3b4, L3e4, L8h, L9d
Error function, distribution of: L5a1e, L5a2e
Errors in variables regression: L8a4
Experimental designs, generate random: L7f, L6b5
Exponential distribution: L4a1a2e, L5a1e, L6a5, L5a2e
Extreme value distribution: L4a1a4e, L5a1e, L5a2e, L6a5, L4a1a2e, L4a1a3e
F distribution: L4a1a2f, L5a1f, L6a6, L5a2f
Factor analysis: L13a
Factorial designs: L7d1
Forecasting in time series analysis: L10a2d3, L10b2, L10d
Filters: L10a1c
Finite population, data sampled from a: L4a4, L4b5
Frequency domain analysis: L10a3, L10b3, L10c
Frequency statistics: L1a1d, L1c1d
Frequency plots: L3a2, L3b2, L3e2
Gain spectrum: L10b3a6
Gamma distribution: L4a1a3g, L4a1a2g, L5a1g, L5a2g, L6a7
General linear models: L7d3
Geometric distribution: L4a1a3g, L4a1a2g, L5a1g, L5a2g, L6a7
Goodness-of-fit tests: L4a1c, L4b1c
- See Also Statistical graphics
Grouped data: L1a3, L4a3, L4b4
Halfnormal distribution: L4a1a2h, L5a1h, L6a8, L5a2h
Histograms: L3a1, L3e1, L3b1
Hypergeometric distribution: L5a1h, L6a8
- See Also Statistical data analysis
Indicator variables, construct: L2e
Inverse distribution functions: L5a2, L5b2
Inverse regression: L8a1d
Joining clustering algorithms: L14a1a1
K-means clustering algorithms: L14a1b
Kalman filtering: L10a2e, L10c
Kendall F statistic distribution: L5a1k
Kolmogorov-Smirnov distribution: L5a1k
L-1 approximation: L6b12
L-1 regression: L8a2, L8c3
- See Also Regression
L-infinity regression: L8a2, L8c3
Lag plots: L3a7, L3b3c
Lambda distribution: L4a1a3l, L4a1a2l, L5a1l, L5a2l, L6a12
Latin squares: L7c
Life testing: L15
- See Also Regression
- See Also Regression
Locally stationary time series: L10a2f
Location statistics: L1a1a, L4a1b1, L1b, L1c
Log-linear models: L9c
Logistic distribution: L4a1a2l, L5a1l, L5a2l, L6a12
Logistic and logit regression: L8e1a
Lognormal distribution: L4a1a2l, L5a1l, L5a2l, L6a12
Matrices of bivariate scatter diagrams: L3e3d
Maximum entropy methods: L10a3a5
Measurement error models: L8c5, L8e5
Median polish: L9d
Merge data sets: L2d
Missing values, predict using cluster analysis: L14a1a4
Missing values, statistics for data with: L1a1, L1c1, L1c2
Moving averages: L10a1c2
Multidimensional scaling: L16
Multinomial distribution: L6b13
Multiple linear regression: L8c
Multi-channel time series models: L10d
Negative binomial distribution: L4a1a2n, L5a1n, L5a2n, L6a14
Nested clustering algorithms: L14a1a
Noise spectrum: L10b3a6
Nonlinear regression: L8e
- See Also Statistical data analysis, elementary
Non-nested clustering algorithm: L14a1b
Normal distribution: L5b2n, L4a1a4n, L4a1a2n, L4a1a3n, L5a1n, L5a2n, L5b1n, L6a14, L6b14
Normal order statistics: L5a2n, L6a14
Ordinary least squares regression: L8a1, L8b1, L8c1, L8e1, L8f, L8g
Orthogonal matrices, random: L6b15
Outlier analysis: L4a1a6
- See Also Statistical data analysis
Pareto distribution: L4a1a3p, L4a1a2p, L5a2p, L5a1p, L6a16
Partial autocorrelations: L10a2a
Pascal distribution: L6a16
Percentile plots: L3e2, L3a2
Periodogram analysis: L10a3a2
Permutations, random: L6a16
Phase spectra: L10b3a6
Pie charts: L3a5
Piecewise polynomial regression: L8g
Poisson distribution: L4a1a4p, L4a1a2p, L4a1a3p, L5a1p, L5a2p, L6a16
Polynomial regression: L8b, L8d
Principal components analysis: L13b
Probability: L
Probability density functions, evaluate: L5a1, L5b1
Probability plot correlation coefficient plots: L4a1a3
Probability plots: L4a1a2
Probit regression: L8e1a
Quadrature spectra: L10b3a6
Rank tests: L4b1b, L4c1b
Random number generation: L6
- Beta distribution: L6a2
- Binomial distribution: L6a2
- Boolean distribution: L6a2
- Cauchy distribution: L6a3
- Chi-squared distribution: L6a3
- Contingency tables: L6b3
- Correlation matrices: L6b3
- Linear L-1 approximation: L6b12
- Double exponential distribution: L6a4
- Experimental designs: L6b5
- Exponential distribution: L6a5
- Extreme value distribution: L6a5
- F distribution: L6a6
- Gamma distribution: L6a7
- General (continuous and discrete) distribution: L6a7
- Geometric distribution: L6a7
- Halfnormal distribution: L6a8
- Hypergeometric distribution: L6a8
- Lambda distribution: L6a12
- Logistic distribution: L6a12
- Lognormal distribution: L6a12
- Multinomial distribution: L6b13
- Multivariate: L6b
- Negative binomial distribution: L6a14
- Normal distribution: L6a14, L6b14
- Normal order statistics: L6a14
- Orthogonal matrices: L6b15
- Pareto distribution: L6a16
- Pascal distribution: L6a16
- Permutations: L6a16
- Poisson distribution: L6a16
- Samples: L6a19
- Seeds: L6c
- Service routines: L6c
- Stable distribution: L6a19
- T distribution: L6a20
- Time series: L6a20
- Triangular distribution: L6a20
- Uniform distribution: L6b21, L6a21
- Uniform order statistics: L6a21
- Univariate: L6a
- Von Mises distribution: L6a22
- Weibull distribution: L6a23
Regression: L8
- Calibration: L8a1d
- Correlation and covariance data, using: L8c1a2, L8c1b2
- EDA: L8h
- Errors in variables: L8a4
- Inverse: L8a1d
- L-p for p different from 2: L8a2, L8c3
- Logistic and logit: L8e1a
- Measurement error models: L8c5, L8e5
- Models based on ranks: L8c6
- Multiple linear: L8c
- Nonlinear: L8e
- Ordinary least squares: L8a1, L8b1, L8c1, L8e1, L8f, L8g
- Piecewise polynomial: L8g
- Polynomial: L8b
- Polynomial in several variables: L8d
- Preference pairs, using: L8c1a3
- Principal components, using: L8c1a3
- Probit: L8e1a
- Response surface analysis: L8d
- Ridge: L8e2
- Robust: L8a3, L8c4
- Service routines: L8i
- Several multiple regressions: L8c2
- Simple linear: L8a
- Simultaneous: L8f
- Smoothing: L8h
- Spline: L8g
- Variable selection: L8c1a, L8e1a
See Also Approximation
See Also Optimization
Response surface analysis: L8d
Ridge regression: L8e2
Robust regression: L8a3, L8c4
Samples, random: L6a19
Scatter diagrams: L3e3, L3b3
Semicircular distribution: L4a1a2s
Sequence of numbers, analysis of a: L4a1d
Shape statistics: L1a1c, L4a1b1
Simple linear regression: L8a
Simultaneous regression: L8f
Single link clustering algorithms: L14a1a1
Sparsity functions: L5a2
Spectral analysis: L10a3a
Spectral functions: L10b3a6
Spectral windows: L10a3a6
Spectrum estimation: L10a3a3, L10a3a4, L10a3a5
Spline regression: L8g
Stable distribution: L6a19
State-space analysis: L10a2e, L10c
Stationarity analysis: L10a2b
Stationarity transformations: L10a1b
Statistical data analysis, elementary: L4
- Beta distribution: L4a1a2b
- Binomial distribution: L4a1a2b, L4a1a4b
- Categorical data: L4a5, L9
- Cauchy distribution: L4a1a2c
- Censored data: L4a3
- Chi-squared distribution: L4a1a2c, L4a1a3c
- Density and distribution function plots: L4a1a1, L4b1a1
- Density estimation, nonparametric: L4a1b2
- Double exponential distribution: L4a1a2d
- Exponential distribution: L4a1a2e
- Extreme value distributions: L4a1a4e, L4a1a2e, L4a1a3e
- F distribution: L4a1a2f
- Finite population, data sampled from a: L4a4, L4b5
- Gamma distribution: L4a1a3g, L4a1a2g
- Geometric distribution: L4a1a3g, L4a1a2g
- Goodness-of-fit tests: L4a1c, L4b1c
- Grouped data: L4a3, L4b4
- Halfnormal distribution: L4a1a2h
- Lambda distribution: L4a1a3l, L4a1a2l
- Logistic distribution: L4a1a2l
- Lognormal distribution: L4a1a2l
- Multi-dimensional data: L4c, L4e
- Negative binomial distribution: L4a1a2n
- Nonparametric analysis: L4a1b, L4a1c, L4a1d, L4a5, L4b1b, L4b1c, L4b3, L4b5, L4c1b
- Normal distribution: L4a1a2n, L4a1a3n, L4a1a4n
- One-dimensional data: L4a
- Outlier analysis: L4a1a6
- Pairwise dependent data: L4b3, L4b4
- Pairwise independent data: L4b1
- Parametric analysis: L4b1a, L4c1a, L4a1a, L4a3, L4a4, L4b4, L4b5, L4e
- Pareto distribution: L4a1a2p, L4a1a3p
- Poisson distribution: L4a1a2p, L4a1a4p, L4a1a3p
- Probability plot correlation coefficient plots: L4a1a3
- Probability plots: L4a1a2
- Rank tests: L4c1b, L4b1b
- Semicircular distribution: L4a1a2s
- Sequence of numbers: L4a1d
- T distribution: L4a1a2t, L4a1a3t
- Tail analysis: L4a1a6
- Tolerance limits: L4a1a7
- Transformation selection: L4a1a5
- Triangular distribution: L4a1a2t
- Two-dimensional data: L4b
- Uniform distribution: L4a1a2u, L4a1a4u
- Weibull distribution: L4a1a2w, L4a1a3w, L4a1a4w
Statistical data sets: L17
Statistical functions: L5
- Beta distribution: L5a1b, L5a2b
- Binomial distribution: L5a1b, L5a2b
- Cauchy distribution: L5a1c, L5a2c
- Chi-squared distribution: L5a1c, L5a2c
- Cumulative distribution functions: L5a1, L5b1
- Double exponential distribution: L5a1d, L5a2d
- Error function: L5a1e, L5a2e
- Exponential distribution: L5a1e, L5a2e
- Extreme value distribution: L5a1e, L5a2e
- F distribution: L5a1f, L5a2f
- Gamma distribution: L5a1g, L5a2g
- General distributions: L5a1g, L5a2g
- Geometric distribution: L5a1g, L5a2g
- Halfnormal distribution: L5a1h, L5a2h
- Hypergeometric distribution: L5a1h
- Inverse distribution functions: L5a2, L5b2
- Kendall F statistic: L5a1k
- Kolmogorov-Smirnov: L5a1k
- Lambda distribution: L5a1l, L5a2l
- Logistic distribution: L5a1l, L5a2l
- Lognormal distribution: L5a1l, L5a2l
- Multivariate distributions: L5b
- Negative binomial distribution: L5a1n, L5a2n
- Normal distribution: L5a1n, L5a2n, L5b1n, L5b2n
- Normal order statistics: L5a2n
- Pareto distribution: L5a1p, L5a2p
- Poisson distribution: L5a1p, L5a2p
- Probability density functions: L5a1, L5b1
- Sparsity functions: L5a2
- T distribution: L5a1t, L5a2t
- Uniform distribution: L5a1u, L5a2u
- Univariate distributions: L5a
- Von Mises distribution: L5a1v
- Weibull distribution: L5a1w, L5a2w
See Also Functions
Statistical graphics: L3
- Bar charts: L3a4
- Bivariate histograms: L3b1
- Box-plots: L3a3
- EDA: L3a3, L3e4, L3b4
- Frequency plots: L3a2, L3b2, L3e2
- Histograms: L3a1, L3b1, L3e1
- Lag plots: L3a7, L3b3c
- Matrices of bivariate scatter diagrams: L3e3d
- Multi-dimensional data: L3e
- One-dimensional data: L3a
- Percentile plots: L3a2, L3e2
- Pie charts: L3a5
- Scatter diagrams: L3b3, L3e3
- Stem-and-leaf plots: L3a3
- Superimposed histograms: L3b1
- Superimposed scatter diagrams: L3e3a, L3e3c
- Symbol plots: L3a6, L3b3b
- Three-dimensional data: L3c
- Two-dimensional data: L3b
- X(i) vs. i plots: L3a6
- X(i) vs. X(i-1) plots: L3a7
- X(i) vs. Y(i-j) plots: L3b3c
- Y vs. X plots: L3b3a, L3e3a
Statistics: L
Stem-and-leaf plots: L3a3
Subset extraction: L2c
Summary statistics: L1
- Correlation and covariance: L1c1b
- Dispersion: L1a1b
- Frequency: L1a1d, L1c1d
- Grouped data: L1a3
- Location: L1a1a
- Missing values: L1a1, L1c1, L1c2
- Multi-dimensional data: L1c
- One-dimensional data: L1a
- Shape: L1a1c
- Ties: L1a1e
- Two-dimensional data: L1b
Superimposed histograms: L3b1
Superimposed scatter diagrams: L3e3a, L3e3c
- See Also Approximation
- See Also Regression
Survival analysis: L15
Switching clustering algorithms: L14a1a3
Symbol plots: L3b3b, L3a6
Symmetric linear filters: L10a1c2
T distribution: L4a1a2t, L4a1a3t, L5a2t, L5a1t, L6a20
Tail analysis: L4a1a6
Tally data: L2b
Taper: L10a1d
Tie statistics: L1a1e
Time domain analysis: L10a2, L10b2, L10c, L10d
Time series analysis: L10
- ARMA and ARIMA filters: L10a1c4
- ARMA and ARIMA models: L10a2d, L10b2, L10c
- Autocorrelations and autocovariances: L10a2a
- Autoregressive linear filters: L10a1c3
- Autoregressive models: L10a2c
- Bivariate: L10b
- Box-Jenkins methods: L10a2d
- Co-spectra: L10b3a6
- Coherency spectrum: L10b3a6
- Complex demodulation: L10a3b
- Cross-amplitude spectra: L10b3a6
- Cross-correlations and cross-covariances: L10b2a, L10c, L10d
- Cross-periodogram analysis: L10b3a2
- Cross-spectrum estimation: L10b3a3, L10b3a4
- Cross-spectral analysis: L10b3a
- Difference filters: L10a1c1
- Filters: L10a1c
- Forecasting: L10a2d3, L10b2, L10d
- Frequency domain analysis: L10a3, L10b3, L10c
- Gain spectrum: L10b3a6
- Kalman filtering: L10a2e
- Locally stationary: L10a2f
- Maximum entropy methods: L10a3a5
- Moving averages: L10a1c2
- Multi-channel models: L10d
- Multivariate: L10c
- Noise spectrum: L10b3a6
- Partial autocorrelations: L10a2a2, L10c
- Periodogram analysis: L10a3a2
- Phase spectra: L10b3a6
- Pilot analysis: L10a3a1
- Quadrature spectra: L10b3a6
- Random time series: L6a20
- Spectral analysis: L10a3a
- Spectral functions: L10b3a6
- Spectral windows: L10a3a6
- Spectrum estimation: L10a3a3, L10a3a4, L10a3a5
- State-space analysis: L10a2e, L10c
- Stationarity analysis: L10a2b
- Stationarity transformations: L10a1b
- Symmetric linear filters: L10a1c2
- Taper: L10a1d
- Time domain analysis: L10a2, L10b2, L10c, L10d
- Transfer function model filters: L10a1c4
- Transfer function models: L10b2b
- Transformations: L10a1
- Univariate: L10a
Tolerance limits: L4a1a7
Transfer function models: L10b2b
Transfer function model filters: L10a1c4
Transformation selection: L4a1a5
Transform data: L2a, L10a1
Triangular distribution: L4a1a2t, L6a20
Pairwise dependent data: L4b4, L4b3
Pairwise independent data: L4b1
Two-way tables: L9b
Uniform distribution: L6a21, L4a1a2u, L4a1a4u, L5a1u, L5a2u, L6b21
Uniform order statistics: L6a21
Variable selection: L8c1a, L8e1a
Von Mises distribution: L5a1v, L6a22
Weibull distribution: L4a1a3w, L4a1a4w, L4a1a2w, L5a2w, L5a1w, L6a23
X(i) vs. i plots: L3a6
X(i) vs. X(i-1) plots: L3a7
X(i) vs. Y(i-j) plots: L3b3c
Y vs. X plots: L3b3a, L3e3a
Bit manipulation: N2
Character manipulation: N3
Computational geometry: P
Documentation retrieval: R4
Electrical network reliability: M3b
Enciphering: Z
Error handling: R3
Geometry, computational: P
Graphics: Q
Graph-theoretic algorithms: P
Hamiltonian circuits: P
Heaps (data structure): N4
Input of data: N1
Keywords, ACM: Z
Machine-dependent constants: R1
Markov models: M1b
Merge data sets: N7
Output of data: N1
PERT: M4
Permuting: N8
Program transformation tools: S1
Program analysis tools: S2, S3
Project optimization: M4
Quality control: M3a
Queueing: M2
Quicksort: N6a
Reliability: M3
Searching: N5
Simulation: M
- Continuous: M1b
- Discrete: M1a
- Electrical network: M3b
- Markov models: M1b
- PERT: M4
- Project optimization: M4
- Quality control: M3a
- Queueing: M2
- Reliability: M3
- Stochastic modeling: M
Software tools: S
- Dynamic program analysis: S3
- Program transformation: S1
- Static program analysis: S2
Sorting: N6
- Active: N6a2
- Passive: N6a1
- Internal: N6a
- External: N6b
Stacks (data structure): N4
Stochastic modeling: M
Storage management: N4
Symbolic computation: O
Text processing: Z
Trees (data structure): N4
- See Also Software tools
Absolute value: A3
Acosh: C4c
Adams method: I1a
Adaptive quadrature: H2
Algebraico-logarithmic integrals: H2a2
Arc cosine: C4a
Arc hyperbolic cosine: C4c
Arc hyperbolic sine: C4c
Arc hyperbolic tangent: C4c
Arc sine: C4a
Arc tangent: C4a
Argument of a complex number: A4
Asinh: C4c
Atanh: C4c
B-splines: E1a
Backward differentiation formulas: I1a2
Bairy function: C10d
Banded matrix: D2a2, D2b2, D2c2
Bickley functions: C10f
Cauchy principal value: H2a2
Chebyshev: D9a2, D9b2, K2
Clenshaw-Curtis method: H2a2
Complete beta function: C7b
Complete elliptic integral: C14
Complete gamma function: C7a
Complex Hermitian matrix: D2b, D3b
Complex linear equations: D2c, D2d
Complex number: A4
Complex polynomial: F1a2
Complex vectors: D1a
Condition number: D2, D3
Constrained least squares: K1a2, K1b2
Copy: D1a5, D1b8
Cos or sin in weight function: H2a2
Cosine: C4a
Cotangent: C4a
Covariance matrix: K
Cubic Hermite differentiation: H1
Cubic Hermite evaluation: E3c
Cubic Hermite interpolation: E1a
Cubic polynomial evaluation: C3
Data fitting: E1, K1a1
- See Also Regression
- See Also Approximation
Gamma function, derivatives: C7a
Digamma function: C7a
Downdate matrix: D2e
Duplication theorem: C14
E1 function: C5
Ei function: C5
End point singularities: H2a2
Erf: C8a
Erfc: C8a
Euclidean length: D1a3b
Exponential integrals: C8
Extrapolation: A7
Fourier integrals: H2a3, H2a4
Gauss quadrature: H2c
Gauss-Kronrod rules: H2a1
General system of linear equations: D2
Globally adaptive quadrature: H2
Hermite interpolation: E1a, E2a
Hermitian matrix: D3d
Hyperbolic Bessel function: C10b
I Bessel function: C10b
Incomplete beta function: C7b
Incomplete elliptic integral: C14
Integrals of Bessel functions: C10f
Integrand with oscillatory factor: H2a2
Integration between zeros: H2a2
Integration rules, functions with cos or sin factor: H2a2
J Bessel function: C10a
Jacobian: F3, G4c
K Bessel function: C10b
Linear algebra: D
Linear constraints: G2a, G2h2, K1b2a
Linear optimization: G2a
- See Also Linear equations
LINPACK: D
Logarithmic confluent hypergeometric function: C11
LP: G2a
LQ factorization: D2b4
MINPACK: F2, K1b1
Modified Bessel function: C10
Modified Givens rotation: D1a8, D1b10
Monotone interpolation: E1a
Newton-Cotes: H2c
Nonlinear data fitting: K1b
- See Also Regression
- See Also Approximation
Nonsymmetric matrix: D2, D3, D4
Numerical integration: H2, I1
Orthonormalization: D5
Plane rotation: D1b10
Polynomial roots: F1a1
Positive definite: D2, D3
Powell hybrid method: F2
RKF: I1a1a
Roots: F
Sequential sorting: N6
Shape-preserving interpolation: E1a
Sine: C4a
Singleton quicksort: N6
Smooth integrand quadrature: H2
Smooth interpolant: E
Tabulated data quadrature: H2
Tangent: C4a
Triad: D1a7
Tricomi: C7e
Tridiagonal matrix: D2, D3, D4
Unitary similarity transformation: D4c1b
Weight function quadrature: H2
Y Bessel function: C10a
Zeros: F
Fixed points: F
Calculus: H
Contour plotting: Q
Voronoi diagrams: P
Minimization: G
Matrix inversion: D2
BLAS: D1
Prime numbers: B
Linear systems: D2
Sparse matrix: D2a4, D2b4, D2c4, D2d4, D3a4, D3b4, D3c4, D3d4, D4a7, G2a2
Nonlinear optimization: G2h
Continuation: F
Parabolic PDE: I2a1
Elliptic PDE: I2b
Hyperbolic PDE: I2a2
Convex hull: P
Conformal mapping: P
Inverse matrix: D2
Diagonalization: D4
Contouring: Q
Plotting: Q, L3
Dynamical systems: F
Band matrix: D2a2, D2c2, D3a2, D3c2, D4a6, D4b5
Delauney triangulation: P, I2b4a
Best approximation: K
Visualisation: Q
Trust region: G
Total least squares: K1a1a3, K1b1a2, L8c5, L8e1, L8e5
Sylvester equation: D8
Homotopy: F
Spherical Bessel functions: C10a

[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology

This page was generated on Sat May 10, 2008 at 03:06:56 UTC