FindClusters[{e_1, e_2, ...}] partitions the e i into clusters of similar elements. FindClusters[{e_1 -> v_1, e_2 -> v_2, ...}] returns the v_i corresponding to the e i in ...

LinearProgramming[c, m, b] finds a vector x that minimizes the quantity c.x subject to the constraints m.x >= b and x >= 0. LinearProgramming[c, m, {{b_1, s_1}, {b_2, s_2}, ...

RowReduce[m] gives the row-reduced form of the matrix m.

SchurDecomposition[m] yields the Schur decomposition for a numerical matrix m, given as a list {q, t} where q is an orthonormal matrix and t is a block upper-triangular ...

Total[list] gives the total of the elements in list. Total[list, n] totals all elements down to level n. Total[list, {n}] totals elements at level n. Total[list, {n_1, n_2}] ...

Some operators used in basic arithmetic and algebra. Note that the  for ∖[Cross] is distinguished by being drawn slightly smaller than the × for ∖[Times]. Interpretation of ...

Vectors and matrices in Mathematica are simply represented by lists and by lists of lists, respectively. The representation of vectors and matrices by lists. This is a 2×2 ...

Because GPUs are SIMD machines, to exploit CUDA's potential you must pose the problem in an SIMD manner. Computation that can be partitioned in such a way that each thread ...

Erfc[z] gives the complementary error function erfc(z).

Erf[z] gives the error function erf(z). Erf[z_0, z_1] gives the generalized error function erf(z_1) - erf(z_0).