forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlatin_center.html
341 lines (296 loc) · 8.47 KB
/
latin_center.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
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
<html>
<head>
<title>
LATIN_CENTER - Latin Center Squares in M dimensions
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
LATIN_CENTER <br> Latin Center Squares in M dimensions
</h1>
<hr>
<p>
<b>LATIN_CENTER</b>
is a C++ library which
makes Latin Center Squares.
</p>
<p>
A Latin square is a selection of one point from each row and
column of a square matrix or table. In M dimensions, the
corresponding item is a set of N points, where, in each dimension,
there is exactly one point whose coordinates are in a given
"column" or range of values. To emphasize the
use of higher dimensions, these objects are sometimes called
Latin hypersquares.
</p>
<p>
Once a Latin Square has been created, a Latin Center Square is
determined by choosing the center of each subsquare.
</p>
<p>
Here is an image of a Latin centered grid with spatial
dimension <b>M</b> = 2
and number of points <b>N</b> = 10.
<img src = "../../datasets/latin_center/latin_center_02_00010.png"
height = "440"
width = "340">
</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>LATIN_CENTER</b> is available in
<a href = "../../cpp_src/latin_center/latin_center.html">a C++ version</a> and
<a href = "../../f_src/latin_center/latin_center.html">a FORTRAN90 version</a> and
<a href = "../../m_src/latin_center/latin_center.html">a MATLAB version.</a>
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/box_behnken/box_behnken.html">
BOX_BEHNKEN</a>,
a C++ library which
computes a Box-Behnken design,
that is, a set of arguments to sample the behavior
of a function of multiple parameters;
</p>
<p>
<a href = "../../cpp_src/cvt/cvt.html">
CVT</a>,
a C++ library which
computes points in
a Centroidal Voronoi Tessellation.
</p>
<p>
<a href = "../../cpp_src/faure/faure.html">
FAURE</a>,
a C++ library which
computes Faure
sequences.
</p>
<p>
<a href = "../../cpp_src/grid/grid.html">
GRID</a>,
a C++ library which
computes points on a grid.
</p>
<p>
<a href = "../../cpp_src/halton/halton.html">
HALTON</a>,
a C++ library which
computes Halton
sequences.
</p>
<p>
<a href = "../../cpp_src/hammersley/hammersley.html">
HAMMERSLEY</a>,
a C++ library which
computes Hammersley
sequences.
</p>
<p>
<a href = "../../cpp_src/hex_grid/hex_grid.html">
HEX_GRID</a>,
a C++ library which
computes
sets of points in a 2D hexagonal grid.
</p>
<p>
<a href = "../../cpp_src/ihs/ihs.html">
IHS</a>,
a C++ library which
computes
improved Latin Hypercube datasets.
</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_cover/latin_cover.html">
LATIN_COVER</a>,
a C++ library which
produces N Latin squares which cover an NxN square,
or NxN Latin cubes which cover an NxNxN cube.
</p>
<p>
<a href = "../../cpp_src/latin_edge/latin_edge.html">
LATIN_EDGE</a>,
a C++ library which
computes Latin square data choosing the edge value.
</p>
<p>
<a href = "../../cpp_src/latin_random/latin_random.html">
LATIN_RANDOM</a>,
a C++ library which
computes Latin square data choosing a random value in the square.
</p>
<p>
<a href = "../../cpp_src/niederreiter2/niederreiter2.html">
NIEDERREITER2</a>,
a C++ library which
computes Niederreiter sequences with base 2.
</p>
<p>
<a href = "../../cpp_src/normal/normal.html">
NORMAL</a>,
a C++ library which
computes elements of a sequence of pseudorandom normally distributed values.
</p>
<p>
<a href = "../../cpp_src/sobol/sobol.html">
SOBOL</a>,
a C++ library which
computes Sobol sequences.
</p>
<p>
<a href = "../../cpp_src/uniform/uniform.html">
UNIFORM</a>,
a C++ library which
computes uniform random values.
</p>
<p>
<a href = "../../cpp_src/van_der_corput/van_der_corput.html">
VAN_DER_CORPUT</a>,
a C++ library which
computes van der Corput sequences.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Paul Bratley, Bennett Fox, Linus Schrage,<br>
A Guide to Simulation,<br>
Springer Verlag, pages 201-202, 1983.
</li>
<li>
C J Colbourn and J H Dinitz,<br>
CRC Handbook of Combinatorial Design,<br>
CRC, 1996.
</li>
<li>
Bennett Fox,<br>
Algorithm 647:<br>
Implementation and Relative Efficiency of Quasirandom
Sequence Generators,<br>
ACM Transactions on Mathematical Software,<br>
Volume 12, Number 4, pages 362-376, 1986.
</li>
<li>
M D McKay, W J Conover, R J Beckman,<br>
A Comparison of Three Methods for Selecting Values of Input
Variables in the Analysis of Output From a Computer Code,<br>
Technometrics,<br>
Volume 21, pages 239-245, 1979.
</li>
<li>
Albert Nijenhuis and Herbert Wilf,<br>
Combinatorial Algorithms,<br>
Academic Press, 1978, second edition,<br>
ISBN 0-12-519260-6.
</li>
<li>
Herbert Ryser,<br>
Combinatorial Mathematics,<br>
Mathematical Association of America, 1963.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "latin_center.cpp">latin_center.cpp</a>, the source code.
</li>
<li>
<a href = "latin_center.hpp">latin_center.hpp</a>, the include file.
</li>
<li>
<a href = "latin_center.sh">latin_center.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "latin_center_prb.cpp">latin_center_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "latin_center_prb.sh">latin_center_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "latin_center_prb_output.txt">latin_center_prb_output.txt</a>,
the output from a run of the sample program.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>GET_SEED</b> returns a random seed for the random number generator.
</li>
<li>
<b>I4_MAX</b> returns the maximum of two integers.
</li>
<li>
<b>I4_MIN</b> returns the smaller of two integers.
</li>
<li>
<b>I4_SWAP</b> switches two integer values.
</li>
<li>
<b>I4_UNIFORM</b> returns a scaled pseudorandom I4.
</li>
<li>
<b>LATIN_CENTER</b> returns center points in a Latin square.
</li>
<li>
<b>PERM_UNIFORM</b> selects a random permutation of N objects.
</li>
<li>
<b>R4_ABS</b> returns the absolute value of an R4.
</li>
<li>
<b>R4_NINT</b> returns the nearest integer to an R4.
</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 01 December 2006.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>