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
/*
Copyright (C) 2011 Fredrik Johansson
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include "test_helpers.h"
#include "ulong_extras.h"
#include "nmod_mat.h"
#include "nmod_poly_mat.h"
TEST_FUNCTION_START(nmod_poly_mat_rank, state)
{
slong i;
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
nmod_poly_mat_t A;
nmod_mat_t Ax;
ulong mod, x;
slong j, m, n, deg, rank, zrank;
float density;
/* Don't pick a too small modulus, to avoid failure in
the probabilistic rank computation (todo: test
for small moduli) */
do {
mod = n_randtest_prime(state, 0);
} while (mod < 20);
m = n_randint(state, 15);
n = n_randint(state, 15);
deg = 1 + n_randint(state, 5);
density = n_randint(state, 100) * 0.01;
nmod_poly_mat_init(A, m, n, mod);
nmod_mat_init(Ax, m, n, mod);
nmod_poly_mat_randtest_sparse(A, state, deg, density);
/* Probabilistic rank computation */
zrank = 0;
for (j = 0; j < 5; j++)
{
slong r;
x = n_randint(state, mod);
nmod_poly_mat_evaluate_nmod(Ax, A, x);
r = nmod_mat_rank(Ax);
zrank = FLINT_MAX(zrank, r);
}
rank = nmod_poly_mat_rank(A);
if (rank != zrank)
{
flint_printf("FAIL:\n");
flint_printf("A:\n");
nmod_poly_mat_print(A, "x");
flint_printf("Computed rank: %wd (zrank = %wd)\n", rank, zrank);
fflush(stdout);
flint_abort();
}
nmod_mat_clear(Ax);
nmod_poly_mat_clear(A);
}
TEST_FUNCTION_END(state);
}