next up previous
Next: 3.1.2 Shift Register Generators Up: 3.1 Equidistribution Previous: 3.1 Equidistribution


3.1.1 Linear Congruential Generators


$\displaystyle \fbox{
$
I_{n+1} = \left[ \,a \, I_{n} + b \,\right] \, \mbox{mod} \, m
$
}$      


where $a$ is some (odd) multiplicative factor, $m$ is the largest integer (hardware-dependent, e.g. $m=2^{32}$), and $b$ is relatively prime with respect to $m$.

To obtain random numbers $x_{n}$ of type real, equidistributed over the interval $(0,1)$, divide $I_{n}$ by $m$.

$\Longrightarrow$Library or internal routines RAND, RND, RAN etc.

To minimize serial correlations:


% latex2html id marker 8496
\fbox{
\begin{minipage}{600pt}
{\bf \lq\lq Erasing trac...
...om number
$\in (0,1)$; return to (\ref{ENERASC}).
\end{enumerate}\end{minipage}}


Franz J. Vesely Oct 2005
See also:
"Computational Physics - An Introduction," Kluwer-Plenum 2001