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. ...
UniformSumDistribution[n] represents the distribution of a sum of n random variables uniformly distributed from 0 to 1.UniformSumDistribution[n, {min, max}] represents the ...
WatsonUSquareTest[data] tests whether data is normally distributed using the Watson U^2 test.WatsonUSquareTest[data, dist] tests whether data is distributed according to dist ...
Mathematica provides functions that allow users to write their own file format converters and integrate them with the Mathematica Import and Export framework. You can ...
For minimization problems for which the objective function is a sum of squares, it is often advantageous to use the special structure of the problem. Time and effort can be ...
There are many variants of quasi-Newton methods. In all of them, the idea is to base the matrix B_k in the quadratic model on an approximation of the Hessian matrix built up ...
SurvivalDistribution[{e_1, e_2, ...}] represents a survival distribution with event times e_i.SurvivalDistribution[{w_1, w_2, ...} -> {e_1, e_2, ...}] represents a survival ...
When numerically solving Hamiltonian dynamical systems it is advantageous if the numerical method yields a symplectic map. If the Hamiltonian can be written in separable ...
FindMaximum[f, x] searches for a local maximum in f, starting from an automatically selected point.FindMaximum[f, {x, x_0}] searches for a local maximum in f, starting from ...
FindMinimum[f, x] searches for a local minimum in f, starting from an automatically selected point.FindMinimum[f, {x, x_0}] searches for a local minimum in f, starting from ...