forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 2
/
grid_dataset.html
267 lines (230 loc) · 6.96 KB
/
grid_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
260
261
262
263
264
265
266
267
<html>
<head>
<title>
GRID_DATASET - Generate Grid Datasets
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
GRID_DATASET <br> Generate Grid Datasets
</h1>
<hr>
<p>
<b>GRID_DATASET</b>
is a FORTRAN90 program which
creates a grid dataset.
</p>
<p>
Note that, unless N is an Mth power of an integer, the program
must generate a regular grid with too many points, and then omit some.
Choosing which points to omit is done with a random number generator,
whose actions are controlled by SEED.
</p>
<p>
The actual placement of the grid within the unit hypercube
leaves some options for the use. It is easiest to describe the
options in the 1 dimensional case, and in terms of where the
first and last grid point are. Assuming we have N evenly spaced
points to place between 0 and 1, the centering options are
<ul>
<li>
CENTER = 1: first point is 0.0, last point is 1.0;
</li>
<li>
CENTER = 2: first point is 1/(N+1), last point is N/(N+1);
</li>
<li>
CENTER = 3: first point is 0, last point is (N-1)/N;
</li>
<li>
CENTER = 4: first point is 1/N, last point is 1;
</li>
<li>
CENTER = 5: first point is 1/(2*N), last point is (2*N-1)/(2*N);
</li>
</ul>
</p>
<h3 align = "center">
Usage:
</h3>
<p>
<blockquote>
<b>grid_dataset</b> <i>m</i> <i>n</i> <i>seed</i> <i>center</i>
</blockquote>
where
<ul>
<li>
<i>m</i> is the spatial dimension;
</li>
<li>
<i>n</i> is the number of points to generate;
</li>
<li>
<i>seed</i> is the random number generator seed;
</li>
<li>
<i>center</i> is the centering option.
</li>
</ul>
The data is written to the file <b>grid_<i>m</i>_<i>n</i>_<i>center</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>GRID_DATASET</b> is available in
<a href = "../../cpp_src/grid_dataset/grid_dataset.html">a C++ version</a> and
<a href = "../../f_src/grid_dataset/grid_dataset.html">a FORTRAN90 version</a> and
<a href = "../../m_src/grid_dataset/grid_dataset.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/faure_dataset/faure_dataset.html">
FAURE_DATASET</a>,
a FORTRAN90 program which
creates a Faure quasirandom dataset;
</p>
<p>
<a href = "../../f_src/grid/grid.html">
GRID</a>,
a FORTRAN90 library which
can define a grid dataset. <b>GRID_DATASET</b> needs
a compiled copy of that library in order to build the program.
</p>
<p>
<a href = "../../datasets/grid/grid.html">
GRID</a>,
a dataset directory which
contains a number of sample grid datasets.
</p>
<p>
<a href = "../../f_src/latin_center_dataset/latin_center_dataset.html">
LATIN_CENTER_DATASET</a>,
a FORTRAN90 program which
creates a Latin Center Hypercube dataset;
</p>
<p>
<a href = "../../f_src/latin_edge_dataset/latin_edge_dataset.html">
LATIN_EDGE_DATASET</a>,
a FORTRAN90 program which
creates a Latin Edge Hypercube dataset;
</p>
<p>
<a href = "../../f_src/latin_random_dataset/latin_random_dataset.html">
LATIN_RANDOM_DATASET</a>,
a FORTRAN90 program which
creates a Latin Random Hypercube dataset;
</p>
<p>
<a href = "../../f_src/niederreiter2_dataset/niederreiter2_dataset.html">
NIEDERREITER2_DATASET</a>,
a FORTRAN90 program which
creates a Niederreiter quasirandom dataset with base 2;
</p>
<p>
<a href = "../../f_src/normal_dataset/normal_dataset.html">
NORMAL_DATASET</a>,
a FORTRAN90 program which
generates a dataset of multivariate normal pseudorandom values and writes them to a file.
</p>
<p>
<a href = "../../f_src/sobol_dataset/sobol_dataset.html">
SOBOL_DATASET</a>,
a FORTRAN90 program which
computes a Sobol quasirandom sequence and writes it to a file.
</p>
<p>
<a href = "../../f_src/triangle_grid/triangle_grid.html">
TRIANGLE_GRID</a>,
a FORTRAN90 library which
computes a triangular grid of points.
</p>
<p>
<a href = "../../f_src/uniform_dataset/uniform_dataset.html">
UNIFORM_DATASET</a>,
a FORTRAN90 program which
generates a dataset of multivariate uniform pseudorandom values and writes them to a file.
</p>
<p>
<a href = "../../f_src/van_der_corput_dataset/van_der_corput_dataset.html">
VAN_DER_CORPUT_DATASET</a>,
a FORTRAN90 program which
creates a van der Corput quasirandom sequence and writes it to a file.
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "grid_dataset.f90">grid_dataset.f90</a>,
the source code.
</li>
<li>
<a href = "grid_dataset.sh">grid_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 GRID_DATASET.
</li>
<li>
<b>GET_SEED</b> returns a seed for the random number generator.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>GRID_GENERATE</b> generates a grid dataset.
</li>
<li>
<b>GRID_SIDE</b> finds the smallest grid containing at least N points.
</li>
<li>
<b>I4_HUGE</b> returns a "huge" I4.
</li>
<li>
<b>KSUB_RANDOM2</b> selects a random subset of size K from a set of size N.
</li>
<li>
<b>R8_UNIFORM_01</b> returns a unit pseudorandom R8.
</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>
<li>
<b>TUPLE_NEXT_FAST</b> computes the next element of a tuple space, "fast".
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 30 August 2005.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>