The execution of a Mathematica program involves the evaluation of a sequence of Mathematica expressions. In simple programs, the expressions to be evaluated may be separated ...
One of the most important issues for using a database is the conversion of data as it is stored and retrieved from a database. This tutorial will discuss how Mathematica ...
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 ...
DeBruijnGraph[m, n] gives the n-dimensional De Bruijn graph with m symbols.DeBruijnGraph[m, n, type] gives the De Bruijn graph with connectivity given by type.
DiscretePlot3D[expr, {i, i_min, i_max}, {j, j_min, j_max}] generates a plot of the values of expr when i runs from i_min to i_max and j runs from j_min to ...
NSolve
(Built-in Mathematica Symbol) NSolve[expr, vars] attempts to find numerical approximations to the solutions of the system expr of equations or inequalities for the variables vars. NSolve[expr, vars, ...
Plot
(Built-in Mathematica Symbol) Plot[f, {x, x_min, x_max}] generates a plot of f as a function of x from x_min to x_max. Plot[{f_1, f_2, ...}, {x, x_min, x_max}] plots several functions f_i.
TetGenLink is a Mathematica application that makes the functions of TetGen available to Mathematica. This is done with Wolfram LibraryLink, which allows TetGen to be used in ...
NProbability[pred, x \[Distributed] dist] gives the numerical probability for an event that satisfies the predicate pred under the assumption that x follows the probability ...
Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...