1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
/*
Copyright (C) 2000, 2001, 2002 RiskMap srl
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it under the
terms of the QuantLib license. You should have received a copy of the
license along with this program; if not, please email ferdinando@ametrano.net
The license is also available online at http://quantlib.org/html/license.html
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the license for more details.
*/
/*! \file knuthuniformrng.hpp
\brief Knuth uniform random number generator
\fullpath
ql/RandomNumbers/%knuthuniformrng.hpp
*/
// $Id: knuthuniformrng.hpp,v 1.7 2002/01/16 14:41:27 nando Exp $
#ifndef quantlib_knuth_uniform_rng_h
#define quantlib_knuth_uniform_rng_h
#include <ql/MonteCarlo/sample.hpp>
#include <vector>
namespace QuantLib {
//! Random Number Generators and Low Discrepancy Sequences
/*! See sect. \ref randomnumbers */
namespace RandomNumbers {
//! Uniform random number generator
/*! Random number generator by Knuth.
For more details see Knuth, Seminumerical Algorithms,
3rd edition, Section 3.6.
\note This is <b>not</b> Knuth's original implementation which
is available at
http://www-cs-faculty.stanford.edu/~knuth/programs.html,
but rather a slightly modified version wrapped in a C++ class.
Such modifications did not affect the code but only the data
structures used, which were converted in their C++/STL
equivalents.
*/
class KnuthUniformRng {
public:
typedef MonteCarlo::Sample<double> sample_type;
/*! if the given seed is 0, a random seed will be chosen
based on clock() */
explicit KnuthUniformRng(long seed = 0);
/*! returns a sample with weight 1.0 containing a random number
uniformly chosen from (0.0,1.0) */
sample_type next() const;
private:
/* Knuth's names and routines were preserved as much as possible
while changing the data structures to more modern ones. */
static const int KK, LL, TT, QUALITY;
mutable std::vector<double> ranf_arr_buf;
mutable std::vector<double>::const_iterator ranf_arr_ptr,
ranf_arr_sentinel;
mutable std::vector<double> ran_u;
double mod_sum(double x, double y) const;
bool is_odd(int s) const;
void ranf_start(long seed);
void ranf_array(std::vector<double>& aa, int n) const;
double ranf_arr_cycle() const;
};
// inline definitions
inline KnuthUniformRng::sample_type KnuthUniformRng::next() const {
double result = (ranf_arr_ptr != ranf_arr_sentinel ?
*ranf_arr_ptr++ :
ranf_arr_cycle());
return sample_type(result,1.0);
}
inline double KnuthUniformRng::mod_sum(double x, double y) const {
return (x+y)-int(x+y);
}
inline bool KnuthUniformRng::is_odd(int s) const {
return (s&1) != 0;
}
}
}
#endif
|
