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

ZTransform[expr, n, z] gives the Z transform of expr. ZTransform[expr, {n_1, n_2, ...}, {z_1, z_2, ...}] gives the multidimensional Z transform of expr.

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

Mathematica 6.0 fundamentally redefined Mathematica and introduced a major new paradigm for computation. Building on Mathematica's time-tested core symbolic architecture, ...

LinearModelFit[{y_1, y_2, ...}, {f_1, f_2, ...}, x] constructs a linear model of the form \[Beta]_0 + \[Beta]_1 f_1 + \[Beta]_2 f_2 + ... that fits the y_i for successive x ...

Mathematica immediately allows you to do arithmetic not only with individual numbers, but also with arbitrary lists or arrays—as well as symbolic and algebraic forms. ...

Extrapolation methods are a class of arbitrary-order methods with automatic order and step-size control. The error estimate comes from computing a solution over an interval ...

DSolve can be used for finding the general solution to a differential equation or system of differential equations. The general solution gives information about the structure ...

FindIntegerNullVector[{x_1, x_2, ..., x_n}] finds a list of integers a_i such that a_1 x_1 + a_2 x_2 + \[CenterEllipsis] + a_n x_n == 0. FindIntegerNullVector[{x_1, x_2, ..., ...

FindSequenceFunction[{a_1, a_2, a_3, ...}] attempts to find a simple function that yields the sequence a_n when given successive integer arguments.FindSequenceFunction[{{n_1, ...