Nearest is used to find elements in a list that are closest to a given data point. Nearest function. Nearest works with numeric lists, tensors, or a list of strings.

TetGenConvexHull[points] generates a convex hull for a 3D point set.

The first part of this User Guide describes using J/Link to allow you to call from Mathematica into Java, thereby extending the Mathematica environment to include the ...

PieChart3D[{y_1, y_2, ...}] makes a 3D pie chart with sector angle proportional to y_1, y_2, ....PieChart3D[{..., w_i[y_i, ...], ..., w_j[y_j, ...], ...}] makes a 3D pie ...

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

GatherBy[list, f] gathers into sublists each set of elements in list that gives the same value when f is applied.GatherBy[list, {f_1, f_2, ...}] gathers list into nested ...

SetSharedFunction[f_1, f_2, ...] declares the symbols f_i as shared functions whose downvalues are synchronized among all parallel kernels.

Finding the date and time. This gives the current date and time. The Mathematica DateList function returns whatever your computer system gives as the current date and time. ...

The method "DoubleStep" performs a single application of Richardson's extrapolation for any one-step integration method. Although it is not always optimal, it is a general ...

Newton's method for nonlinear equations is based on a linear approximation so the Newton step is found simply by setting M_k(p)=0, Near a root of the equations, Newton's ...