Computes a smooth bivariate interpolant to scattered data that is locally a quintic polynomial in two variables.

Indicates a condition has occurred in a user-supplied function necessitating a return to the calling function.

Computes basic univariate statistics.

Smooth one-dimensional data by error detection.

Sorts a vector by algebraic value. Optionally, a vector can be sorted by absolute value, and a sort per­mutation can be returned.

Sorts an integer vector by algebraic value. Optionally, a vector can be sorted by absolute value, and a sort permutation can be returned.

Computes the Cholesky factorization of a sparse real symmetric positive definite matrix A by an OpenMP parallelized supernodal algorithm and solves the sparse real positive definite system of linear equations Ax = b.

Computes the Cholesky factorization of a sparse (complex) Hermitian positive definite matrix A by an OpenMP parallelized supernodal algorithm and solves the sparse Hermitian positive definite system of linear equations Ax = b.

Solves a sparse linear programming problem by an infeasible primal-dual interior-point method.

Solves a sparse convex quadratic programming problem by an infeasible primal-dual interior-point method.

Evaluates the integral of a tensor-product spline on a rectangular domain.

Computes a two-dimensional, tensor-product spline interpolant from two-dimensional, tensor-product data.

Computes a two-dimensional, tensor-product spline approximant using least squares.

Computes the value of a tensor-product spline or the value of one of its partial deriva­tives.

Computes the integral of a spline.

Computes a spline interpolant.

Computes the knots for a spline interpolant.

Computes a least-squares spline approximation.

Computes a least-squares constrained spline approximation.

Performs a multidimensional interpolation and differentiation for up to 7 dimensions.

Computes the value of a spline or the value of one of its derivatives.

Computes the LU factorization of a general sparse matrix by a column method and solves the real sparse linear system of equations Ax = b.

Computes the LU factorization of a general complex sparse matrix by a column method and solves the complex sparse linear system of equations Ax = b.

Computes the LU factorization of a general sparse matrix by a left-looking column method using OpenMP parallelism, and solves the real sparse linear system of equations Ax = b

Computes the LU factorization of a general complex sparse matrix by a left-looking column method using OpenMP parallelism and solves the complex sparse linear system of equations Ax = b.