Contours is an option for contour plots that specifies the contours to draw.

One of the key problems in graphs is navigation. In particular, the problem is finding the shortest path between two vertices, whether that is finding the way out of a maze ...

Mathematica 7 represents another major achievement in Mathematica's long history of innovation in mathematics and algorithms. Building on the broad capabilities of ...

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

MinimumBandwidthOrdering[g] attempts to find a vertex ordering that minimizes the bandwidth of the undirected graph g.MinimumBandwidthOrdering[m] attempts to find row and ...

Fit[data, funs, vars] finds a least-squares fit to a list of data as a linear combination of the functions funs of variables vars.

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient-based methods use first ...

NMinimize, NMaximize, Minimize, and Maximize employ global optimization algorithms, and are thus suitable when a global optimum is needed. Minimize and Maximize can find ...

Simplifying expressions. Mathematica does not automatically simplify an algebraic expression like this. Simplify performs the simplification.

D[f, x] gives the partial derivative \[PartialD]f/\[PartialD]x. D[f, {x, n}] gives the multiple derivative \[PartialD]^n f/\[PartialD]x^n. D[f, x, y, ...] differentiates f ...