InverseJacobiDC[v, m] gives the inverse Jacobi elliptic function dc -1 (v \[VerticalSeparator] m).
InverseJacobiNC[v, m] gives the inverse Jacobi elliptic function nc -1 (v \[VerticalSeparator] m).
InverseJacobiNS[v, m] gives the inverse Jacobi elliptic function ns -1 (v \[VerticalSeparator] m).
Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...
EulerEquations[f, u[x ], x] returns the Euler\[Dash]Lagrange differential equation obeyed by u[x] derived from the functional f, where f depends on the function u[x] and its ...
ArithmeticGeometricMean[a, b] gives the arithmetic-geometric mean of a and b.
RowReduce[m] gives the row-reduced form of the matrix m.
Part
(Built-in Mathematica Symbol) expr[[i]] or Part[expr, i] gives the i\[Null]^th part of expr. expr[[-i]] counts from the end. expr[[i, j, ...]] or Part[expr, i, j, ...] is equivalent to expr[[i]][[j]] .... ...
NMaximize[f, x] maximizes f numerically with respect to x.NMaximize[f, {x, y, ...}] maximizes f numerically with respect to x, y, .... NMaximize[{f, cons}, {x, y, ...}] ...
NMinimize[f, x] minimizes f numerically with respect to x.NMinimize[f, {x, y, ...}] minimizes f numerically with respect to x, y, .... NMinimize[{f, cons}, {x, y, ...}] ...