forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
faure_dataset.html
259 lines (224 loc) · 6.79 KB
/
faure_dataset.html
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
<html>
<head>
<title>
FAURE_DATASET - Generate Datasets of Faure Quasirandom Sequences
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
FAURE_DATASET <br> Generate Datasets<br> of Faure Quasirandom Sequences
</h1>
<hr>
<p>
<b>FAURE_DATASET</b>
is a C++ program which
creates a Faure quasirandom sequence
and writes it to a file.
</p>
<h3 align = "center">
Usage:
</h3>
<p>
<blockquote>
<b>faure_dataset</b> <i>m</i> <i>n</i> <i>skip</i>
</blockquote>
where
<ul>
<li>
<i>m</i> is the spatial dimension. This implicitly determines
<b>base</b>, which is the smallest prime number greater than or
equal to <i>m</i>;
</li>
<li>
<i>n</i> is the number of points to generate;
</li>
<li>
<i>skip</i> is the initial number of points to skip over.
The recommended value of <i>skip</i> is <b>base^4-1</b>.
</li>
</ul>
The data is written to the file <b>faure_<i>m</i>_<i>n</i>.txt</b>.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>FAURE_DATASET</b> is available in
<a href = "../../cpp_src/faure_dataset/faure_dataset.html">a C++ version</a> and
<a href = "../../f_src/faure_dataset/faure_dataset.html">a FORTRAN90 version</a> and
<a href = "../../m_src/faure_dataset/faure_dataset.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../datasets/faure/faure.html">
FAURE</a>,
a dataset directory which
contains examples of the datasets created by <b>FAURE_DATASET</b>.
</p>
<p>
<a href = "../../cpp_src/faure/faure.html">
FAURE</a>,
a C++ library which
computes elements of a Faure sequence.
</p>
<p>
<a href = "../../cpp_src/grid_dataset/grid_dataset.html">
GRID_DATASET</a>,
a C++ program which
creates a grid sequence and writes it to a file.
</p>
<p>
<a href = "../../cpp_src/latin_center_dataset/latin_center_dataset.html">
LATIN_CENTER_DATASET</a>,
a C++ program which
creates a Latin Center Hypercube dataset;
</p>
<p>
<a href = "../../cpp_src/latin_edge_dataset/latin_edge_dataset.html">
LATIN_EDGE_DATASET</a>,
a C++ program which
creates a Latin Edge Hypercube dataset;
</p>
<p>
<a href = "../../cpp_src/latin_random_dataset/latin_random_dataset.html">
LATIN_RANDOM_DATASET</a>,
a C++ program which
creates a Latin Random Hypercube dataset;
</p>
<p>
<a href = "../../cpp_src/niederreiter2_dataset/niederreiter2_dataset.html">
NIEDERREITER2_DATASET</a>,
a C++ program which
creates a Niederreiter quasirandom dataset with base 2;
</p>
<p>
<a href = "../../cpp_src/normal_dataset/normal_dataset.html">
NORMAL_DATASET</a>,
a C++ program which
generates a dataset of multivariate normal pseudorandom values and writes them to a file.
</p>
<p>
<a href = "../../cpp_src/sobol_dataset/sobol_dataset.html">
SOBOL_DATASET</a>,
a C++ program which
computes a Sobol quasirandom sequence and writes it to a file.
</p>
<p>
<a href = "../../cpp_src/uniform_dataset/uniform_dataset.html">
UNIFORM_DATASET</a>,
a C++ program which
generates a dataset of multivariate uniform pseudorandom values and writes them to a file.
</p>
<p>
<a href = "../../cpp_src/van_der_corput_dataset/van_der_corput_dataset.html">
VAN_DER_CORPUT_DATASET</a>,
a C++ program which
creates a van der Corput quasirandom sequence and writes it to a file.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Paul Bratley, Bennett Fox, Harald Niederreiter,<br>
Implementation and Tests of Low Discrepancy Sequences,<br>
ACM Transactions on Modeling and Computer Simulation,<br>
Volume 2, Number 3, pages 195-213, 1992.
</li>
<li>
Henri Faure,<br>
Discrepance de suites associees a un systeme de numeration
(en dimension s),<br>
Acta Arithmetica,<br>
Volume XLI, 1982, pages 337-351, especially page 342.
</li>
<li>
Henri Faure,<br>
Good permutations for extreme discrepancy,<br>
Journal of Number Theory,<br>
Volume 42, 1992, pages 47-56.
</li>
<li>
Bennett Fox,<br>
Algorithm 647:
Implementation and Relative Efficiency of Quasirandom
Sequence Generators,<br>
ACM Transactions on Mathematical Software,<br>
Volume 12, Number 4, pages 362-376, 1986.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "faure_dataset.cpp">faure_dataset.cpp</a>,
the source code.
</li>
<li>
<a href = "faure_dataset.sh">faure_dataset.sh</a>,
commands to compile and load the source code.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for FAURE_DATASET.
</li>
<li>
<b>BINOMIAL_TABLE</b> computes a table of bionomial coefficients MOD QS.
</li>
<li>
<b>FAURE</b> generates a new quasirandom Faure vector with each call.
</li>
<li>
<b>FAURE_GENERATE</b> generates a Faure dataset.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>I4_LOG_I4</b> returns the logarithm of an I4 to an I4 base.
</li>
<li>
<b>PRIME_GE</b> returns the smallest prime greater than or equal to N.
</li>
<li>
<b>PRIME</b> returns any of the first PRIME_MAX prime numbers.
</li>
<li>
<b>R8MAT_WRITE</b> writes an R8MAT file.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 11 December 2009.
</i>
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>