FindArgMin[f, x] gives the position x_min of a local minimum of f.FindArgMin[f, {x, x_0}] gives the position x_min of a local minimum of f, found by a search starting from ...

Mathematica has been used to make many important discoveries in discrete mathematics over the past two decades. Its integration of highly efficient and often original ...

Mathematica 6.0 represented a major new level in Mathematica's distinguished twenty-year history of broad cutting-edge algorithm development. Mathematica's unified ...

The representation of algebraic numbers. When you enter a Root object, the polynomial that appears in it is automatically reduced to a minimal form. This extracts the pure ...

WaveletBestBasis[dwd] computes a best basis representation in the DiscreteWaveletData object dwd.WaveletBestBasis[dwd, cspec] computes a best basis representation using the ...

Code generation from Mathematica involves converting programs written in the Mathematica language into other languages and then supporting them so that they can be executed. ...

Constrained optimization problems are problems for which a function f(x) is to be minimized or maximized subject to constraints Φ(x). Here f:^n  is called the objective ...

Although Diophantine equations provide classic examples of undecidability, Mathematica in practice succeeds in solving a remarkably wide range of such equations—automatically ...

WaveletThreshold[dwd] thresholds the detail wavelet coefficients in the DiscreteWaveletData object dwd.WaveletThreshold[dwd, tspec] thresholds the coefficients using the ...

FindEdgeCover[g] finds an edge cover of the graph g with a minimum number of edges.