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
/*
Copyright (C) 2010 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"
TEST_FUNCTION_START(nmod_mat_rank, state)
{
nmod_mat_t A;
slong i, m, n, d, r;
ulong mod;
/* Maximally sparse matrices of given rank */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
m = n_randint(state, 20);
n = n_randint(state, 20);
mod = n_randtest_prime(state, 0);
for (r = 0; r <= FLINT_MIN(m,n); r++)
{
nmod_mat_init(A, m, n, mod);
nmod_mat_randrank(A, state, r);
/* flint_printf("SPARSE %wd\n", r);
nmod_mat_print_pretty(A); */
if (r != nmod_mat_rank(A))
TEST_FUNCTION_FAIL("Wrong rank\n");
nmod_mat_clear(A);
}
}
/* Dense */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
m = n_randint(state, 20);
n = n_randint(state, 20);
mod = n_randtest_prime(state, 0);
for (r = 0; r <= FLINT_MIN(m,n); r++)
{
d = n_randint(state, 2*m*n + 1);
nmod_mat_init(A, m, n, mod);
nmod_mat_randrank(A, state, r);
nmod_mat_randops(A, state, d);
/*
flint_printf("DENSE %wd %wd\n", r, d);
nmod_mat_print_pretty(A); */
if (r != nmod_mat_rank(A))
TEST_FUNCTION_FAIL("Wrong rank\n");
nmod_mat_clear(A);
}
}
TEST_FUNCTION_END(state);
}