Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...
The function FindClusters finds clusters in a dataset based on a distance or dissimilarity function. This package contains functions for generating cluster hierarchies and ...
ND
(Numerical Calculus Package Symbol) ND[expr, x, x_0] gives a numerical approximation to the derivative of expr with respect to x at the point x_0.ND[expr, {x, n}, x_0] gives a numerical approximation to the ...
AdjacencyGraph[amat] gives the graph with adjacency matrix amat.AdjacencyGraph[{v_1, v_2, ...}, amat] gives the graph with vertices v_i and adjacency matrix amat.
Annuity
(Built-in Mathematica Symbol) Annuity[p, t] represents an annuity of fixed payments p made over t periods.Annuity[p, t, q] represents a series of payments occurring at time intervals q.Annuity[{p, ...
AstronomicalData["name", " property"] gives the value of the specified property of the astronomical object with the specified name.AstronomicalData["name", {"property", ...
BinormalDistribution[{\[Mu]_1, \[Mu]_2}, {\[Sigma]_1, \[Sigma]_\ 2}, \[Rho]] represents a bivariate normal distribution with mean {\[Mu]_1, \[Mu]_2} and covariance matrix ...
CandlestickChart[{{date_1, {open_1, high_1, low_1, close_1}}, ...}] makes a chart with candles representing open, high, low, and close prices for each date. ...
CirculantGraph[n, j] gives the circulant graph with n vertices and jump j C_n (j).CirculantGraph[n, {j_1, j_2, ...}] gives the circulant graph with n vertices and jumps j_1, ...
CompleteGraph[n] gives the complete graph with n vertices K_n.CompleteGraph[{n_1, n_2, ..., n_k}] gives the complete k-partite graph with n_1 + n_2 + \[CenterEllipsis] + n_k ...