MapThread (Built-in Mathematica Symbol)

MapThread[f, {{a_1, a_2, ...}, {b_1, b_2, ...}, ...}] gives {f[a_1, b_1, ...], f[a_2, b_2, ...], ...}. MapThread[f, {expr_1, expr_2, ...}, n] applies f to the parts of the ...

Input a Matrix (Mathematica How To)

Mathematica supports operations on matrices of any size and has a range of input methods appropriate for different needs, from small formatted matrices via keyboard or ...

Map a Function over a List (Mathematica How To)

Mathematica includes many powerful operations for working with lists. It is often desirable to map a function onto each individual element in a list. While listable functions ...

PartitionsQ (Built-in Mathematica Symbol)

PartitionsQ[n] gives the number q (n) of partitions of the integer n into distinct parts.

Reap (Built-in Mathematica Symbol)

Reap[expr] gives the value of expr together with all expressions to which Sow has been applied during its evaluation. Expressions sown using Sow[e] or Sow[e, tag_i] with ...

Writing Java Programs That Use ... (JLink Tutorial)

The first part of this User Guide describes using J/Link to allow you to call from Mathematica into Java, thereby extending the Mathematica environment to include the ...

Compilation Target (Compiled Function Tools Tutorial)

The CompilationTarget option of Compile specifies the target runtime system for the compiled function. The default setting is "MVM", which creates code for the traditional ...

Parallel Computation (Compiled Function Tools Tutorial)

The Mathematica compiler can run computations in parallel. It does this by threading a compiled function over lists of data in parallel. A first step is to create a compiled ...

CirculantGraph (Built-in Mathematica Symbol)

CirculantGraph[n, j] gives the circulant graph with n vertices and jump j C_n (j).CirculantGraph[n, {j_1, j_2, ...}] gives the circulant graph with n vertices and jumps j_1, ...

CompleteGraph (Built-in Mathematica Symbol)

CompleteGraph[n] gives the complete graph with n vertices K_n.CompleteGraph[{n_1, n_2, ..., n_k}] gives the complete k-partite graph with n_1 + n_2 + \[CenterEllipsis] + n_k ...