Minimization and maximization. Minimize and Maximize yield lists giving the value attained at the minimum or maximum, together with rules specifying where the minimum or ...

When a differential system has a certain structure, it is advantageous if a numerical integration method preserves the structure. In certain situations it is useful to solve ...

A possible way of working with permutations is by relating them to the reorderings of the elements of a list. This is the standard point of view in the combinatorial approach ...

Button[label, action] represents a button that is labeled with label, and evaluates action whenever it is clicked.

DiscreteRiccatiSolve[{a, b}, {q, r}] gives the matrix x that is the stabilizing solution of the discrete algebraic Riccati equation ConjugateTranspose[a].x.a - x - ...

N[expr] gives the numerical value of expr. N[expr, n] attempts to give a result with n-digit precision.

Polygon[{pt_1, pt_2, ...}] is a graphics primitive that represents a filled polygon. Polygon[{{pt_11, pt_12, ...}, {pt_21, ...}, ...}] represents a collection of polygons.

SchurDecomposition[m] yields the Schur decomposition for a numerical matrix m, given as a list {q, t} where q is an orthonormal matrix and t is a block upper-triangular ...

TuringMachine[rule, init, t] generates a list representing the evolution of the Turing machine with the specified rule from initial condition init for t steps. ...

The names of built-in functions follow some general guidelines. The main expression or object on which a built-in function acts is usually given as the first argument to the ...