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

LocatorPane[{x, y}, back] represents a pane with a locator at position {x, y} and background back.LocatorPane[Dynamic[pt], back] takes the locator position to be the ...

RotationMatrix[\[Theta]] gives the 2D rotation matrix that rotates 2D vectors counterclockwise by \[Theta] radians.RotationMatrix[\[Theta], w] gives the 3D rotation matrix ...

lhs = rhs evaluates rhs and assigns the result to be the value of lhs. From then on, lhs is replaced by rhs whenever it appears. {l_1, l_2, ...} = {r_1, r_2, ...} evaluates ...

SetPrecision[expr, p] yields a version of expr in which all numbers have been set to have precision p.

Mathematica includes many controls and structures related to controls as part of its core language. These control objects are supported in a completely seamless way ...

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 ...

Cellular automata provide a convenient way to represent many kinds of systems in which the values of cells in an array are updated in discrete steps according to a local ...

Exact global optimization problems can be solved exactly using Minimize and Maximize. This computes the radius of the circle, centered at the origin, circumscribed about the ...