The function FindRoot has a Jacobian option; the functions FindMinimum, FindMaximum, and FindFit have a Gradient option; and the "Newton" method has a method option Hessian. ...
All the test problems presented in [MGH81] have been coded into Mathematica in the Optimization`UnconstrainedProblems` package. A data structure is used so that the problems ...
DiscreteWaveletTransform[data] gives the discrete wavelet transform (DWT) of an array of data.DiscreteWaveletTransform[data, wave] gives the discrete wavelet transform using ...
Probability[pred, x \[Distributed] dist] gives the probability for an event that satisfies the predicate pred under the assumption that x follows the probability distribution ...
Solve
(Built-in Mathematica Symbol) Solve[expr, vars] attempts to solve the system expr of equations or inequalities for the variables vars. Solve[expr, vars, dom] solves over the domain dom. Common choices of ...
As of Version 8, much of the functionality covered by Combinatorica has been implemented in the Mathematica kernel. BooleanAlgebra CodeToLabeledTree HasseDiagram ...
Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...
Mathematically, sufficient conditions for a local minimum of a smooth function are quite straightforward: x^* is a local minimum if ∇f(x^*)=0 and the Hessian ∇^2f(x^*) is ...
Groups admit many different representations. In particular, all finite groups can be represented as permutation groups, that is, they are always isomorphic to a subgroup of ...
"Introduction to Manipulate" and "Introduction to Dynamic" provide most of the information you need to use Mathematica's interactive features accessible through the functions ...