ergo
template_lapack_laruv.h
Go to the documentation of this file.
1/* Ergo, version 3.8, a program for linear scaling electronic structure
2 * calculations.
3 * Copyright (C) 2019 Elias Rudberg, Emanuel H. Rubensson, Pawel Salek,
4 * and Anastasia Kruchinina.
5 *
6 * This program is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 *
19 * Primary academic reference:
20 * Ergo: An open-source program for linear-scaling electronic structure
21 * calculations,
22 * Elias Rudberg, Emanuel H. Rubensson, Pawel Salek, and Anastasia
23 * Kruchinina,
24 * SoftwareX 7, 107 (2018),
25 * <http://dx.doi.org/10.1016/j.softx.2018.03.005>
26 *
27 * For further information about Ergo, see <http://www.ergoscf.org>.
28 */
29
30 /* This file belongs to the template_lapack part of the Ergo source
31 * code. The source files in the template_lapack directory are modified
32 * versions of files originally distributed as CLAPACK, see the
33 * Copyright/license notice in the file template_lapack/COPYING.
34 */
35
36
37#ifndef TEMPLATE_LAPACK_LARUV_HEADER
38#define TEMPLATE_LAPACK_LARUV_HEADER
39
40
41template<class Treal>
42int dlaruv_(integer *iseed, const integer *n, Treal *x)
43{
44/* -- LAPACK auxiliary routine (version 3.0) --
45 Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
46 Courant Institute, Argonne National Lab, and Rice University
47 October 31, 1992
48
49
50 Purpose
51 =======
52
53 DLARUV returns a vector of n random real numbers from a uniform (0,1)
54 distribution (n <= 128).
55
56 This is an auxiliary routine called by DLARNV and ZLARNV.
57
58 Arguments
59 =========
60
61 ISEED (input/output) INTEGER array, dimension (4)
62 On entry, the seed of the random number generator; the array
63 elements must be between 0 and 4095, and ISEED(4) must be
64 odd.
65 On exit, the seed is updated.
66
67 N (input) INTEGER
68 The number of random numbers to be generated. N <= 128.
69
70 X (output) DOUBLE PRECISION array, dimension (N)
71 The generated random numbers.
72
73 Further Details
74 ===============
75
76 This routine uses a multiplicative congruential method with modulus
77 2**48 and multiplier 33952834046453 (see G.S.Fishman,
78 'Multiplicative congruential random number generators with modulus
79 2**b: an exhaustive analysis for b = 32 and a partial analysis for
80 b = 48', Math. Comp. 189, pp 331-344, 1990).
81
82 48-bit integers are stored in 4 integer array elements with 12 bits
83 per element. Hence the routine is portable across machines with
84 integers of 32 bits or more.
85
86 =====================================================================
87
88 Parameter adjustments */
89 /* Initialized data */
90 integer mm[512] /* was [128][4] */ = { 494,2637,255,2008,1253,
91 3344,4084,1739,3143,3468,688,1657,1238,3166,1292,3422,1270,2016,
92 154,2862,697,1706,491,931,1444,444,3577,3944,2184,1661,3482,657,
93 3023,3618,1267,1828,164,3798,3087,2400,2870,3876,1905,1593,1797,
94 1234,3460,328,2861,1950,617,2070,3331,769,1558,2412,2800,189,287,
95 2045,1227,2838,209,2770,3654,3993,192,2253,3491,2889,2857,2094,
96 1818,688,1407,634,3231,815,3524,1914,516,164,303,2144,3480,119,
97 3357,837,2826,2332,2089,3780,1700,3712,150,2000,3375,1621,3090,
98 3765,1149,3146,33,3082,2741,359,3316,1749,185,2784,2202,2199,1364,
99 1244,2020,3160,2785,2772,1217,1822,1245,2252,3904,2774,997,2573,
100 1148,545,322,789,1440,752,2859,123,1848,643,2405,2638,2344,46,
101 3814,913,3649,339,3808,822,2832,3078,3633,2970,637,2249,2081,4019,
102 1478,242,481,2075,4058,622,3376,812,234,641,4005,1122,3135,2640,
103 2302,40,1832,2247,2034,2637,1287,1691,496,1597,2394,2584,1843,336,
104 1472,2407,433,2096,1761,2810,566,442,41,1238,1086,603,840,3168,
105 1499,1084,3438,2408,1589,2391,288,26,512,1456,171,1677,2657,2270,
106 2587,2961,1970,1817,676,1410,3723,2803,3185,184,663,499,3784,1631,
107 1925,3912,1398,1349,1441,2224,2411,1907,3192,2786,382,37,759,2948,
108 1862,3802,2423,2051,2295,1332,1832,2405,3638,3661,327,3660,716,
109 1842,3987,1368,1848,2366,2508,3754,1766,3572,2893,307,1297,3966,
110 758,2598,3406,2922,1038,2934,2091,2451,1580,1958,2055,1507,1078,
111 3273,17,854,2916,3971,2889,3831,2621,1541,893,736,3992,787,2125,
112 2364,2460,257,1574,3912,1216,3248,3401,2124,2762,149,2245,166,466,
113 4018,1399,190,2879,153,2320,18,712,2159,2318,2091,3443,1510,449,
114 1956,2201,3137,3399,1321,2271,3667,2703,629,2365,2431,1113,3922,
115 2554,184,2099,3228,4012,1921,3452,3901,572,3309,3171,817,3039,
116 1696,1256,3715,2077,3019,1497,1101,717,51,981,1978,1813,3881,76,
117 3846,3694,1682,124,1660,3997,479,1141,886,3514,1301,3604,1888,
118 1836,1990,2058,692,1194,20,3285,2046,2107,3508,3525,3801,2549,
119 1145,2253,305,3301,1065,3133,2913,3285,1241,1197,3729,2501,1673,
120 541,2753,949,2361,1165,4081,2725,3305,3069,3617,3733,409,2157,
121 1361,3973,1865,2525,1409,3445,3577,77,3761,2149,1449,3005,225,85,
122 3673,3117,3089,1349,2057,413,65,1845,697,3085,3441,1573,3689,2941,
123 929,533,2841,4077,721,2821,2249,2397,2817,245,1913,1997,3121,997,
124 1833,2877,1633,981,2009,941,2449,197,2441,285,1473,2741,3129,909,
125 2801,421,4073,2813,2337,1429,1177,1901,81,1669,2633,2269,129,1141,
126 249,3917,2481,3941,2217,2749,3041,1877,345,2861,1809,3141,2825,
127 157,2881,3637,1465,2829,2161,3365,361,2685,3745,2325,3609,3821,
128 3537,517,3017,2141,1537 };
129 /* System generated locals */
130 integer i__1;
131 /* Local variables */
132 integer i__, i1, i2, i3, i4, it1, it2, it3, it4;
133#define mm_ref(a_1,a_2) mm[(a_2)*128 + a_1 - 129]
134
135 --iseed;
136 --x;
137
138 /* Initialization added by Elias to get rid of compiler warnings. */
139 it1 = it2 = it3 = it4 = 0;
140 /* Function Body */
141
142 i1 = iseed[1];
143 i2 = iseed[2];
144 i3 = iseed[3];
145 i4 = iseed[4];
146
147 i__1 = minMACRO(*n,128);
148 for (i__ = 1; i__ <= i__1; ++i__) {
149
150/* Multiply the seed by i-th power of the multiplier modulo 2**48 */
151
152 it4 = i4 * mm_ref(i__, 4);
153 it3 = it4 / 4096;
154 it4 -= it3 << 12;
155 it3 = it3 + i3 * mm_ref(i__, 4) + i4 * mm_ref(i__, 3);
156 it2 = it3 / 4096;
157 it3 -= it2 << 12;
158 it2 = it2 + i2 * mm_ref(i__, 4) + i3 * mm_ref(i__, 3) + i4 * mm_ref(
159 i__, 2);
160 it1 = it2 / 4096;
161 it2 -= it1 << 12;
162 it1 = it1 + i1 * mm_ref(i__, 4) + i2 * mm_ref(i__, 3) + i3 * mm_ref(
163 i__, 2) + i4 * mm_ref(i__, 1);
164 it1 %= 4096;
165
166/* Convert 48-bit integer to a real number in the interval (0,1) */
167
168 x[i__] = ((Treal) it1 + ((Treal) it2 + ((Treal) it3 + (
169 Treal) it4 * 2.44140625e-4) * 2.44140625e-4) *
170 2.44140625e-4) * 2.44140625e-4;
171/* L10: */
172 }
173
174/* Return final value of seed */
175
176 iseed[1] = it1;
177 iseed[2] = it2;
178 iseed[3] = it3;
179 iseed[4] = it4;
180 return 0;
181
182/* End of DLARUV */
183
184} /* dlaruv_ */
185
186#undef mm_ref
187
188
189#endif
int integer
Definition: template_blas_common.h:40
#define minMACRO(a, b)
Definition: template_blas_common.h:46
#define mm_ref(a_1, a_2)
int dlaruv_(integer *iseed, const integer *n, Treal *x)
Definition: template_lapack_laruv.h:42