Reduce[expr, vars] reduces the statement expr by solving equations or inequalities for vars and eliminating quantifiers. Reduce[expr, vars, dom] does the reduction over the ...

Groups admit many different representations. In particular, all finite groups can be represented as permutation groups, that is, they are always isomorphic to a subgroup of ...

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 ...

J/Link provides Mathematica users with the ability to interact with arbitrary Java classes directly from Mathematica. You can create objects and call methods directly in the ...

The CCompilerDriver package lets you work with C compilers that are installed on your computer. It lets you build executables, libraries, and object files from C source code. ...

Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...

ProductDistribution[dist_1, dist_2, ...] represents the joint distribution with independent component distributions dist_1, dist_2, ....

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...

When numerically solving Hamiltonian dynamical systems it is advantageous if the numerical method yields a symplectic map. If the Hamiltonian can be written in separable ...

Many differential equations exhibit some form of stiffness, which restricts the step size and hence effectiveness of explicit solution methods. A number of implicit methods ...