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

Some integer functions. The remainder on dividing 17 by 3. The integer part of 17/3.

This section is designed to discuss how to make compiled functions run efficiently. It will cover features that make them run faster, as well as problems that can make them ...

FindMinValue[f, x] gives the value at a local minimum of f.FindMinValue[f, {x, x_0}] gives the value at a local minimum of f, found by a search starting from the point x = ...

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

RecurrenceTable[eqns, expr, {n, n_max}] generates a list of values of expr for successive n based on solving the recurrence equations eqns.RecurrenceTable[eqns, expr, nspec] ...

PoissonConsulDistribution[\[Mu], \[Lambda]] represents a Poisson\[Dash]Consul distribution with parameters \[Mu] and \[Lambda].

DifferenceDelta[f, i] gives the discrete difference \[DifferenceDelta]_i f = f(i + 1) - f(i).DifferenceDelta[f, {i, n}] gives the multiple difference DifferenceDelta[f, {i, ...

This loads packages containing some test problems and utility functions. One of the first and simplest methods for solving initial value problems was proposed by Euler: ...

NProbability[pred, x \[Distributed] dist] gives the numerical probability for an event that satisfies the predicate pred under the assumption that x follows the probability ...