FindEulerianCycle[g] finds an Eulerian cycle in the graph g if one exists.FindEulerianCycle[g, k] finds at most k Eulerian cycles.

LinearSolve[m, b] finds an x which solves the matrix equation m.x == b. LinearSolve[m] generates a LinearSolveFunction[...] which can be applied repeatedly to different b.

Projection[u, v] finds the projection of the vector u onto the vector v.Projection[u, v, f] finds projections with respect to the inner product function f.

CUDAFourier[list] finds the discrete Fourier transform of a list of complex numbers.CUDAFourier[mem] finds the discrete Fourier transform of a CUDAMemory.

Polynomial algorithms are at the core of classical "computer algebra". Incorporating methods that span from antiquity to the latest cutting-edge research at Wolfram Research, ...

Mathematica normally assumes that variables which appear in equations can stand for arbitrary complex numbers. But when you use Reduce, you can explicitly tell Mathematica ...

The introduction of Mathematica 6 in 2007 represented a revolutionary redefinition of Mathematica. Arriving only 18 months after Mathematica 6, Mathematica 7 represents ...

Resolve[expr] attempts to resolve expr into a form that eliminates ForAll and Exists quantifiers. Resolve[expr, dom] works over the domain dom. Common choices of dom are ...

DiscreteUniformDistribution[{i_min, i_max}] represents a discrete uniform distribution over the integers from i_min to i_max.DiscreteUniformDistribution[{{i_min, i_max}, ...

The function NDSolve discussed in "Numerical Differential Equations" allows you to find numerical solutions to differential equations. NDSolve handles both single ...