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
/*
Copyright (C) 2010,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"
TEST_FUNCTION_START(nmod_mat_solve_tril_recursive, state)
{
slong i;
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
nmod_mat_t A, X, B, Y;
ulong m;
slong rows, cols;
int unit;
m = n_randtest_prime(state, 0);
rows = n_randint(state, 100);
cols = n_randint(state, 100);
unit = n_randint(state, 2);
nmod_mat_init(A, rows, rows, m);
nmod_mat_init(B, rows, cols, m);
nmod_mat_init(X, rows, cols, m);
nmod_mat_init(Y, rows, cols, m);
nmod_mat_randtril(A, state, unit);
nmod_mat_randtest(X, state);
nmod_mat_mul(B, A, X);
/* Check Y = A^(-1) * (A * X) = X */
nmod_mat_solve_tril_recursive(Y, A, B, unit);
if (!nmod_mat_equal(Y, X))
TEST_FUNCTION_FAIL(
"A = %{nmod_mat}\n"
"X = %{nmod_mat}\n"
"B = %{nmod_mat}\n"
"Y = %{nmod_mat}\n",
A, X, B, Y);
/* Check aliasing */
nmod_mat_solve_tril_recursive(B, A, B, unit);
if (!nmod_mat_equal(B, X))
TEST_FUNCTION_FAIL(
"Aliasing test failed\n"
"A = %{nmod_mat}\n"
"B = %{nmod_mat}\n",
A, B);
nmod_mat_clear(A);
nmod_mat_clear(B);
nmod_mat_clear(X);
nmod_mat_clear(Y);
}
TEST_FUNCTION_END(state);
}