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
/*
Copyright (C) 2010 Fredrik Johansson
Copyright (C) 2012 Lina Kulakova
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 "fmpz.h"
#include "fmpz_vec.h"
#include "fmpz_mod_mat.h"
static void
check_rref(fmpz_mod_mat_t A)
{
slong i, j, prev_pivot, prev_row_zero;
prev_row_zero = 0;
prev_pivot = -1;
for (i = 0; i < A->r; i++)
{
for (j = 0; j < A->c; j++)
{
/* Found nonzero entry */
if (!fmpz_is_zero(fmpz_mod_mat_entry(A, i, j)))
{
if (prev_row_zero)
{
flint_printf("nonzero row after zero row\n");
fflush(stdout);
flint_abort();
}
if (j <= prev_pivot)
{
flint_printf("pivot not strictly to the right of previous\n");
fflush(stdout);
flint_abort();
}
prev_pivot = j;
break;
}
prev_row_zero = (j + 1 == A->c);
}
}
}
TEST_FUNCTION_START(fmpz_mod_mat_rref, state)
{
fmpz_mod_mat_t A;
fmpz_mod_ctx_t ctx;
slong i, m, n, d, r, rank;
/* Maximally sparse matrices of given rank */
for (i = 0; i < 10000; i++)
{
m = n_randint(state, 10);
n = n_randint(state, 10);
fmpz_mod_ctx_init_rand_bits_prime(ctx, state, 100);
for (r = 0; r <= FLINT_MIN(m, n); r++)
{
fmpz_mod_mat_init(A, m, n, ctx);
fmpz_mod_mat_randrank(A, state, r, ctx);
rank = fmpz_mod_mat_rref(A, A, ctx);
if (r < rank)
{
fmpz_mod_mat_print_pretty(A, ctx);
flint_printf("FAIL:\n");
flint_printf("wrong rank!\n");
fflush(stdout);
flint_abort();
}
check_rref(A);
fmpz_mod_mat_clear(A, ctx);
}
fmpz_mod_ctx_clear(ctx);
}
/* Dense */
for (i = 0; i < 10000; i++)
{
m = n_randint(state, 5);
n = n_randint(state, 4);
fmpz_mod_ctx_init_rand_bits_prime(ctx, state, 100);
for (r = 0; r <= FLINT_MIN(m, n); r++)
{
d = n_randint(state, 2 * m * n + 1);
fmpz_mod_mat_init(A, m, n, ctx);
fmpz_mod_mat_randrank(A, state, r, ctx);
fmpz_mod_mat_randops(A, state, d, ctx);
rank = fmpz_mod_mat_rref(A, A, ctx);
if (r < rank)
{
flint_printf("FAIL:\n");
flint_printf("wrong rank!\n");
fflush(stdout);
flint_abort();
}
check_rref(A);
fmpz_mod_mat_clear(A, ctx);
}
fmpz_mod_ctx_clear(ctx);
}
TEST_FUNCTION_END(state);
}