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
|
--- a/SRC/smatgen.c 2016-12-28 01:06:35.529467943 +0000
+++ b/SRC/smatgen.c 2016-12-28 01:06:06.949710330 +0000
@@ -102,77 +102,3 @@
xa[n] = lasta;
}
-
-double dlaran_(int *iseed)
-{
-/* -- LAPACK auxiliary routine (version 2.0) --
- Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
- Courant Institute, Argonne National Lab, and Rice University
- February 29, 1992
-
- Purpose
- =======
-
- DLARAN returns a random real number from a uniform (0,1)
- distribution.
-
- Arguments
- =========
-
- ISEED (input/output) INT array, dimension (4)
- On entry, the seed of the random number generator; the array
-
- elements must be between 0 and 4095, and ISEED(4) must be
- odd.
- On exit, the seed is updated.
-
- Further Details
- ===============
-
- This routine uses a multiplicative congruential method with modulus
- 2**48 and multiplier 33952834046453 (see G.S.Fishman,
- 'Multiplicative congruential random number generators with modulus
- 2**b: an exhaustive analysis for b = 32 and a partial analysis for
- b = 48', Math. Comp. 189, pp 331-344, 1990).
-
- 48-bit integers are stored in 4 integer array elements with 12 bits
- per element. Hence the routine is portable across machines with
- integers of 32 bits or more.
-
- =====================================================================
-*/
-
- /* Local variables */
- int it1, it2, it3, it4;
-
- --iseed;
-
- /* multiply the seed by the multiplier modulo 2**48 */
- it4 = iseed[4] * 2549;
- it3 = it4 / 4096;
- it4 -= it3 << 12;
- it3 = it3 + iseed[3] * 2549 + iseed[4] * 2508;
- it2 = it3 / 4096;
- it3 -= it2 << 12;
- it2 = it2 + iseed[2] * 2549 + iseed[3] * 2508 + iseed[4] * 322;
- it1 = it2 / 4096;
- it2 -= it1 << 12;
- it1 = it1 + iseed[1] * 2549 + iseed[2] * 2508 + iseed[3] * 322 + iseed[4]
- * 494;
- it1 %= 4096;
-
- /* return updated seed */
-
- iseed[1] = it1;
- iseed[2] = it2;
- iseed[3] = it3;
- iseed[4] = it4;
-
- /* convert 48-bit integer to a real number in the interval (0,1) */
-
- return ((double) it1 +
- ((double) it2 + ((double) it3 + (double) it4 * 2.44140625e-4) *
- 2.44140625e-4) * 2.44140625e-4) * 2.44140625e-4;
-
-} /* dlaran_ */
-
--- a/SRC/zmatgen.c 2016-12-28 01:07:05.819211056 +0000
+++ b/SRC/zmatgen.c 2016-12-28 01:07:26.329037112 +0000
@@ -102,77 +102,3 @@
xa[n] = lasta;
}
-
-double dlaran_(int *iseed)
-{
-/* -- LAPACK auxiliary routine (version 2.0) --
- Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
- Courant Institute, Argonne National Lab, and Rice University
- February 29, 1992
-
- Purpose
- =======
-
- DLARAN returns a random real number from a uniform (0,1)
- distribution.
-
- Arguments
- =========
-
- ISEED (input/output) INT array, dimension (4)
- On entry, the seed of the random number generator; the array
-
- elements must be between 0 and 4095, and ISEED(4) must be
- odd.
- On exit, the seed is updated.
-
- Further Details
- ===============
-
- This routine uses a multiplicative congruential method with modulus
- 2**48 and multiplier 33952834046453 (see G.S.Fishman,
- 'Multiplicative congruential random number generators with modulus
- 2**b: an exhaustive analysis for b = 32 and a partial analysis for
- b = 48', Math. Comp. 189, pp 331-344, 1990).
-
- 48-bit integers are stored in 4 integer array elements with 12 bits
- per element. Hence the routine is portable across machines with
- integers of 32 bits or more.
-
- =====================================================================
-*/
-
- /* Local variables */
- int it1, it2, it3, it4;
-
- --iseed;
-
- /* multiply the seed by the multiplier modulo 2**48 */
- it4 = iseed[4] * 2549;
- it3 = it4 / 4096;
- it4 -= it3 << 12;
- it3 = it3 + iseed[3] * 2549 + iseed[4] * 2508;
- it2 = it3 / 4096;
- it3 -= it2 << 12;
- it2 = it2 + iseed[2] * 2549 + iseed[3] * 2508 + iseed[4] * 322;
- it1 = it2 / 4096;
- it2 -= it1 << 12;
- it1 = it1 + iseed[1] * 2549 + iseed[2] * 2508 + iseed[3] * 322 + iseed[4]
- * 494;
- it1 %= 4096;
-
- /* return updated seed */
-
- iseed[1] = it1;
- iseed[2] = it2;
- iseed[3] = it3;
- iseed[4] = it4;
-
- /* convert 48-bit integer to a real number in the interval (0,1) */
-
- return ((double) it1 +
- ((double) it2 + ((double) it3 + (double) it4 * 2.44140625e-4) *
- 2.44140625e-4) * 2.44140625e-4) * 2.44140625e-4;
-
-} /* dlaran_ */
-
--- a/SRC/cmatgen.c 2016-12-28 00:57:45.513963020 +0000
+++ b/SRC/cmatgen.c 2016-12-28 00:58:46.413446529 +0000
@@ -102,77 +102,3 @@
xa[n] = lasta;
}
-
-double dlaran_(int *iseed)
-{
-/* -- LAPACK auxiliary routine (version 2.0) --
- Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
- Courant Institute, Argonne National Lab, and Rice University
- February 29, 1992
-
- Purpose
- =======
-
- DLARAN returns a random real number from a uniform (0,1)
- distribution.
-
- Arguments
- =========
-
- ISEED (input/output) INT array, dimension (4)
- On entry, the seed of the random number generator; the array
-
- elements must be between 0 and 4095, and ISEED(4) must be
- odd.
- On exit, the seed is updated.
-
- Further Details
- ===============
-
- This routine uses a multiplicative congruential method with modulus
- 2**48 and multiplier 33952834046453 (see G.S.Fishman,
- 'Multiplicative congruential random number generators with modulus
- 2**b: an exhaustive analysis for b = 32 and a partial analysis for
- b = 48', Math. Comp. 189, pp 331-344, 1990).
-
- 48-bit integers are stored in 4 integer array elements with 12 bits
- per element. Hence the routine is portable across machines with
- integers of 32 bits or more.
-
- =====================================================================
-*/
-
- /* Local variables */
- int it1, it2, it3, it4;
-
- --iseed;
-
- /* multiply the seed by the multiplier modulo 2**48 */
- it4 = iseed[4] * 2549;
- it3 = it4 / 4096;
- it4 -= it3 << 12;
- it3 = it3 + iseed[3] * 2549 + iseed[4] * 2508;
- it2 = it3 / 4096;
- it3 -= it2 << 12;
- it2 = it2 + iseed[2] * 2549 + iseed[3] * 2508 + iseed[4] * 322;
- it1 = it2 / 4096;
- it2 -= it1 << 12;
- it1 = it1 + iseed[1] * 2549 + iseed[2] * 2508 + iseed[3] * 322 + iseed[4]
- * 494;
- it1 %= 4096;
-
- /* return updated seed */
-
- iseed[1] = it1;
- iseed[2] = it2;
- iseed[3] = it3;
- iseed[4] = it4;
-
- /* convert 48-bit integer to a real number in the interval (0,1) */
-
- return ((double) it1 +
- ((double) it2 + ((double) it3 + (double) it4 * 2.44140625e-4) *
- 2.44140625e-4) * 2.44140625e-4) * 2.44140625e-4;
-
-} /* dlaran_ */
-
|
GitWeb