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
|
/* rng/ranmar.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 James Theiler, Brian Gough
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* 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 GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <config.h>
#include <stdlib.h>
#include <gsl/gsl_rng.h>
/* This is the RANMAR lagged fibonacci generator of Marsaglia, Zaman
and Tsang. The sequence is a series of 24-bit integers, x_n,
x_n = (y_n - c_n + 2^24) mod 2^24
where,
y_n = (y_{n-97) - y_{n-33} + 2^24) mod 2^24
c_n = (c_{n-1} - 7654321 + 2^24 - 3) mod (2^24 - 3)
The period of this generator is 2^144.
The generator provides about 900 million different subsequences
each of length O(10^30). Thus each seed up to 900,000,000 gives an
independent sequence.
Although it was good in its day this generator now has known
statistical defects and has been superseded by RANLUX.
From: F. James, "A Review of Pseudorandom number generators",
Computer Physics Communications 60, 329 (1990).
G. Marsaglia, A. Zaman and W.W. Tsang, Stat. Prob. Lett. 9, 35 (1990) */
static inline unsigned long int ranmar_get (void *vstate);
static double ranmar_get_double (void *vstate);
static void ranmar_set (void *state, unsigned long int s);
static const unsigned long int two24 = 16777216; /* 2^24 */
typedef struct
{
unsigned int i;
unsigned int j;
long int carry;
unsigned long int u[97];
}
ranmar_state_t;
static inline unsigned long int
ranmar_get (void *vstate)
{
ranmar_state_t *state = (ranmar_state_t *) vstate;
unsigned int i = state->i;
unsigned int j = state->j;
long int carry = state->carry;
long int delta = state->u[i] - state->u[j];
if (delta < 0)
delta += two24 ;
state->u[i] = delta;
if (i == 0)
{
i = 96;
}
else
{
i--;
}
state->i = i;
if (j == 0)
{
j = 96;
}
else
{
j--;
}
state->j = j;
carry += - 7654321 ;
if (carry < 0)
carry += two24 - 3;
state->carry = carry ;
delta += - carry ;
if (delta < 0)
delta += two24 ;
return delta;
}
static double
ranmar_get_double (void *vstate)
{
return ranmar_get (vstate) / 16777216.0 ;
}
static void
ranmar_set (void *vstate, unsigned long int s)
{
ranmar_state_t *state = (ranmar_state_t *) vstate;
unsigned long int ij = s / 30082 ;
unsigned long int kl = s % 30082 ;
int i = (ij / 177) % 177 + 2 ;
int j = (ij % 177) + 2 ;
int k = (kl / 169) % 178 + 1 ;
int l = (kl % 169) ;
int a, b;
for (a = 0; a < 97; a++)
{
unsigned long int sum = 0 ;
unsigned long int t = two24 ;
for (b = 0; b < 24; b++)
{
unsigned long int m = (((i * j) % 179) * k) % 179 ;
i = j ;
j = k ;
k = m ;
l = (53 * l + 1) % 169 ;
t >>= 1 ;
if ((l * m) % 64 >= 32)
sum += t ;
}
state->u[a] = sum ;
}
state->i = 96;
state->j = 32;
state->carry = 362436 ;
}
static const gsl_rng_type ranmar_type =
{"ranmar", /* name */
0x00ffffffUL, /* RAND_MAX */
0, /* RAND_MIN */
sizeof (ranmar_state_t),
&ranmar_set,
&ranmar_get,
&ranmar_get_double};
const gsl_rng_type *gsl_rng_ranmar = &ranmar_type;
|
