The ability to generate pseudorandom numbers is important for simulating events, estimating probabilities and other quantities, making randomized assignments or selections, ...

This section is concerned with the way that CUDALink is set up and configured for your machine. It will also help to track down and correct problems. CUDALink is designed to ...

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

This loads packages containing some test problems and utility functions. One of the first and simplest methods for solving initial value problems was proposed by Euler: ...

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

A method like "Newton's" method chooses a step, but the validity of that step only goes as far as the Newton quadratic model for the function really reflects the function. ...

FindHamiltonianCycle[g] attempts to find a Hamiltonian cycle.

HistogramList[{x_1, x_2, ...}] gives a list of bins and histogram heights of the values x_i.HistogramList[{{x_1, y_1, ...}, {x_2, y_2, ...}, ...}] gives a list of bins and ...

ListCorrelate[ker, list] forms the correlation of the kernel ker with list. ListCorrelate[ker, list, k] forms the cyclic correlation in which the k \[Null]^th element of ker ...

Even more so than for other special functions, you need to be very careful about the arguments you give to elliptic integrals and elliptic functions. There are several ...