I. Quantum Monte Carlo Method
Quantum Monte Carlo and Harmonic Oscillator (PDF Document)
II. On Random Numbers:
(Best random number generator in the Universe)
Caution: MT is for MonteCarlo,
and is NOT SECURE for CRYPTOGRAPHY as is.
See the following
Frequently Asked Question.
What is Mersenne Twister?
Mersenne Twister(MT) is a pseudorandom number generator
developed by Makoto Matsumoto and Takuji Nishimura
MT has the following merits:
- It is designed with consideration on the flaws
of various existing generators.
- The algorithm is coded into a C source downloadable below.
- Far longer period and far higher order of equidistribution
than any other implemented generators.
(It is proved that the period is 2^19937-1,
and 623-dimensional equidistribution property is assured.)
- Fast generation.
(Although it depends on the system, it is reported that
MT is sometimes faster than the standard ANSI-C library
in a system with pipeline and cache memory.)
- Efficient use of the memory.
(The implemented C-code mt19937.c consumes only 624 words
of working area.)
The scientific paper on MT
- mt.ps.gz M. Matsumoto and T. Nishimura,
"Mersenne Twister: A 623-dimensionally equidistributed uniform
pseudorandom number generator", ACM Trans. on Modeling and Computer
Simulation Vol. 8, No. 1, Januray pp.3-30 1998
The implemented C-code([0,1]-interval
Unsigned 32-bit integer version
Standard MT codes and outputs, 99/10/29 version
click here ('99/10/29)
Hiroshi Takano at Department of Physics at
Keio Univ. kindly wrote Fortran versions:
mt19937.f for real
mt19937int.f for integer.
These codes yielded the same output as C-code in
f77 and f90 on HP-UX 10.20,
g77 on SunOS 4.1.4, and
f77 on NEWS-OS 4.2.1R, but yet to be tested.