Search Results for ""

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.

Let S be partitioned into r×s disjoint sets E_i and F_j where the general subset is denoted E_i intersection F_j. Then the marginal probability of E_i is ...

An algorithm which constructs allowed mathematical statements from simple ingredients.

A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.

The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...

Numerical maximization is implemented as NMaximize[f, vars]5.0.

A distribution with zero kurtosis excess, i.e., gamma_2=0.

A minimization of the maximum error for a fixed number of terms.

Numerical minimization is implemented NMinimize[f, vars].

The covering of a plane curve with disks of radius epsilon whose centers lie on the curve.