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
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
|
/* ---------------------------------------------------------------------
*
* -- Integer Matrix Library (IML)
* (C) Copyright 2004, 2006 All Rights Reserved
*
* -- IML routines -- Version 1.0.1 -- November, 2006
*
* Author : Zhuliang Chen
* Contributor(s) : Arne Storjohann
* University of Waterloo -- School of Computer Science
* Waterloo, Ontario, N2L3G1 Canada
*
* ---------------------------------------------------------------------
*
* -- Copyright notice and Licensing terms:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions, and the following disclaimer in
* the documentation and/or other materials provided with the distri-
* bution.
* 3. The name of the University, the IML group, or the names of its
* contributors may not be used to endorse or promote products deri-
* ved from this software without specific written permission.
*
* -- Disclaimer:
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEO-
* RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (IN-
* CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
/* test file for large entry (mpz_t) input matrix */
#include "gmp.h"
#include "../src/common.h"
#include "../src/iml.h"
long tstcertsolveMP(const long certflag, const long nullcol, const long n,
const long m, const double den, const mpz_t mp_alpha, \
const mpz_t mp_beta);
mpz_t *
randomMPMat (const long n, const long m, const double den, const mpz_t mp_bd);
int main(void)
{
double den;
long certflag, n, m, count, ret, nullcol;
mpz_t mp_alpha, mp_beta;
mpz_init(mp_alpha);
mpz_init(mp_beta);
mpz_ui_pow_ui(mp_alpha, 2, 100); mpz_ui_pow_ui(mp_beta, 2, 100);
nullcol = 11;
/* test square dense matrix */
n = 5; m = 5; certflag = 1; den = 1;
ret = tstcertsolveMP(certflag, nullcol, n, m, den, mp_alpha, mp_beta);
if (ret == 1) { return 1; }
/* test rectangular dense matrix */
n = 5; m = 20;
den = 1;
certflag = 1;
ret = tstcertsolveMP(certflag, nullcol, n, m, den, mp_alpha, mp_beta);
if (ret == 1) { return 1; }
certflag = 0;
ret = tstcertsolveMP(certflag, nullcol, n, m, den, mp_alpha, mp_beta);
if (ret == 1) { return 1; }
/* test rectangular sparse matrix */
den = 0.2;
certflag = 1;
ret = tstcertsolveMP(certflag, nullcol, n, m, den, mp_alpha, mp_beta);
if (ret == 1) { return 1; }
certflag = 0;
ret = tstcertsolveMP(certflag, nullcol, n, m, den, mp_alpha, mp_beta);
if (ret == 1) { return 1; }
/* pass test */
mpz_clear(mp_alpha);
mpz_clear(mp_beta);
return 0;
}
long tstcertsolveMP(const long certflag, const long nullcol, const long n, \
const long m, const double den, const mpz_t mp_alpha, \
const mpz_t mp_beta)
{
long i, j, l, r, ret, n1, m1;
mpz_t mp_D, mp_DZ, mp_temp, mp_temp1;
mpz_t *mp_A, *mp_b, *mp_N, *mp_NZ=NULL;
mp_A = randomMPMat(n, m, den, mp_alpha);
mp_b = randomMPMat(n, 1, den, mp_beta);
mp_N = XMALLOC(mpz_t, m);
for (i = 0; i < m; i++) { mpz_init(mp_N[i]); }
mpz_init(mp_D); mpz_init(mp_DZ);
if (certflag == 1)
{
mp_NZ = XMALLOC(mpz_t, n);
for (i = 0; i < n; i++) { mpz_init(mp_NZ[i]); }
}
ret = certSolveMP(certflag, n, m, mp_A, mp_b, mp_N, mp_D, mp_NZ, mp_DZ);
/* test solution */
mpz_init(mp_temp); mpz_init(mp_temp1);
if (ret != 3)
{
/* solution exists, check solution */
for (l = 0; l < n; l++)
{
mpz_mul(mp_temp, mp_N[0], mp_A[l*m]);
for (j = 1; j < m; j++)
mpz_addmul(mp_temp, mp_N[j], mp_A[l*m+j]);
mpz_mul(mp_temp1, mp_D, mp_b[l]);
if (mpz_cmp(mp_temp, mp_temp1) != 0) { return 1; }
}
if ((certflag == 1) && (ret == 1))
{
/* check certificate z.A */
for (l = 0; l < m; l++)
{
mpz_mul(mp_temp, mp_NZ[0], mp_A[l]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_A[j*m+l]);
if (!mpz_divisible_p(mp_temp, mp_DZ)) { return 1; }
}
/* check denom(z.b) */
mpz_mul(mp_temp, mp_NZ[0], mp_b[0]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_b[j]);
mpz_gcd(mp_temp1, mp_temp, mp_DZ);
mpz_divexact(mp_temp1, mp_DZ, mp_temp1);
if (mpz_cmp(mp_temp1, mp_D) != 0) { return 1; }
}
}
else if (certflag == 1)
{
/* solution doesn't exist */
for (l = 0; l < m; l++)
{
mpz_mul(mp_temp, mp_NZ[0], mp_A[l]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_A[j*m+l]);
if (mpz_cmp_ui(mp_temp, 0) != 0) { return 1; }
}
mpz_mul(mp_temp, mp_NZ[0], mp_b[0]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_b[j]);
if (!mpz_cmp_ui(mp_temp, 0)) { return 1; }
}
mpz_clear(mp_temp); mpz_clear(mp_temp1);
ret = certSolveRedMP(certflag, nullcol, n, m, mp_A, mp_b, mp_N, mp_D, \
mp_NZ, mp_DZ);
/* test solution */
mpz_init(mp_temp); mpz_init(mp_temp1);
if (ret != 3)
{
/* solution exists, check solution */
for (l = 0; l < n; l++)
{
mpz_mul(mp_temp, mp_N[0], mp_A[l*m]);
for (j = 1; j < m; j++)
mpz_addmul(mp_temp, mp_N[j], mp_A[l*m+j]);
mpz_mul(mp_temp1, mp_D, mp_b[l]);
if (mpz_cmp(mp_temp, mp_temp1) != 0) { return 1; }
}
if ((certflag == 1) && (ret == 1))
{
/* check certificate z.A */
for (l = 0; l < m; l++)
{
mpz_mul(mp_temp, mp_NZ[0], mp_A[l]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_A[j*m+l]);
if (!mpz_divisible_p(mp_temp, mp_DZ)) { return 1; }
}
/* check denom(z.b) */
mpz_mul(mp_temp, mp_NZ[0], mp_b[0]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_b[j]);
mpz_gcd(mp_temp1, mp_temp, mp_DZ);
mpz_divexact(mp_temp1, mp_DZ, mp_temp1);
if (mpz_cmp(mp_temp1, mp_D) != 0) { return 1; }
}
}
else if (certflag == 1)
{
/* solution doesn't exist */
for (l = 0; l < m; l++)
{
mpz_mul(mp_temp, mp_NZ[0], mp_A[l]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_A[j*m+l]);
if (mpz_cmp_ui(mp_temp, 0) != 0) { return 1; }
}
mpz_mul(mp_temp, mp_NZ[0], mp_b[0]);
for (j = 1; j < n; j++)
mpz_addmul(mp_temp, mp_NZ[j], mp_b[j]);
if (!mpz_cmp_ui(mp_temp, 0)) { return 1; }
}
mpz_clear(mp_temp); mpz_clear(mp_temp1);
{ mpz_clear(mp_D); mpz_clear(mp_DZ); }
for (i = 0; i < m; i++) { mpz_clear(mp_N[i]); } { free(mp_N); }
if (certflag == 1)
for (i = 0; i < n; i++) { mpz_clear(mp_NZ[i]); } { free(mp_NZ); }
for (i = 0; i < n*m; i++) { mpz_clear(mp_A[i]); } { free(mp_A); }
for (i = 0; i < n; i++) { mpz_clear(mp_b[i]); } { free(mp_b); }
return 0;
}
mpz_t *
randomMPMat (const long n, const long m, const double den, const mpz_t mp_bd)
{
long i, j, h, flag;
mpz_t mp_rand, mp_sign;
gmp_randstate_t state;
unsigned long seed;
mpz_t *mp_B;
FILE* devrandom;
static unsigned long inc = 0;
#if HAVE_TIME_H
time_t t1;
#endif
#ifdef HAVE_FLOOR
if (den <= 0.5) { h = (long)floor(1.0/den); flag = 1; }
else { h = (long)floor(1.0/(1-den)); flag = 0; }
#else
{ h = 2; flag = 1; }
#endif
mp_B = XMALLOC(mpz_t, n*m);
mpz_init(mp_sign);
mpz_init(mp_rand);
gmp_randinit_default(state);
seed = 387439;
/* generate random seed using /dev/random */
if ((devrandom = fopen("/dev/urandom", "r")) != NULL)
{
fread(&seed, sizeof(seed), 1, devrandom);
seed += inc;
inc += 1;
gmp_randseed_ui(state, seed);
if (flag == 1)
{
for (i = 0; i < n*m; i++)
{
mpz_urandomm(mp_rand, state, mp_bd);
/* with probability 1/h the entry is non-zero */
if ((!mpz_divisible_ui_p(mp_rand, h)) || (den == 0.0))
mpz_init_set_ui(mp_B[i], 0);
else
{
mpz_urandomb(mp_sign, state, 1);
if (mpz_sgn(mp_sign) == 0) { mpz_neg(mp_rand, mp_rand); }
mpz_init_set(mp_B[i], mp_rand);
}
}
}
else
{
for (i = 0; i < n*m; i++)
{
mpz_urandomm(mp_rand, state, mp_bd);
/* with probability 1/h the entry is non-zero */
if ((mpz_divisible_ui_p(mp_rand, h) != 0) && (den != 1.0))
mpz_init_set_ui(mp_B[i], 0);
else
{
mpz_urandomb(mp_sign, state, 1);
if (mpz_sgn(mp_sign) == 0) { mpz_neg(mp_rand, mp_rand); }
mpz_init_set(mp_B[i], mp_rand);
}
}
}
fclose(devrandom);
}
else
{
#if HAVE_TIME_H
time(&t1);
seed = (unsigned long)t1;
#endif
seed += inc;
inc += 1;
gmp_randseed_ui(state, seed);
if (flag == 1)
{
mpz_urandomm(mp_rand, state, mp_bd);
for (i = 0; i < n*m; i++)
{
/* with probability 1/h the entry is non-zero */
if ((!mpz_divisible_ui_p(mp_rand, h)) || (den == 0.0))
mpz_init_set_ui(mp_B[i], 0);
else
{
mpz_urandomb(mp_sign, state, 1);
if (mpz_sgn(mp_sign) == 0) { mpz_neg(mp_rand, mp_rand); }
mpz_init_set(mp_B[i], mp_rand);
}
}
}
else
{
for (i = 0; i < n*m; i++)
{
mpz_urandomm(mp_rand, state, mp_bd);
/* with probability 1/h the entry is non-zero */
if ((mpz_divisible_ui_p(mp_rand, h) != 0) && (den != 1.0))
mpz_init_set_ui(mp_B[i], 0);
else
{
mpz_urandomb(mp_sign, state, 1);
if (mpz_sgn(mp_sign) == 0) { mpz_neg(mp_rand, mp_rand); }
mpz_init_set(mp_B[i], mp_rand);
}
}
}
}
mpz_clear(mp_rand);
mpz_clear(mp_sign);
gmp_randclear(state);
return mp_B;
}
|
