Search Results for ""

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

The main diagonal of a square matrix can be extracted in the Wolfram Language using Tr[m, List].

A function used to study ordinary differential equations.

A function f which may (but does not necessarily) associate a given member of the range of f with more than one member of the domain of f. For example, trigonometric ...

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.