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
/*
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 "nmod_poly.h"
#include "nmod_poly_mat.h"
void
nmod_poly_mat_mul_classical(nmod_poly_mat_t C, const nmod_poly_mat_t A,
const nmod_poly_mat_t B)
{
slong ar, bc, br;
slong i, j, k;
nmod_poly_t t;
ar = A->r;
br = B->r;
bc = B->c;
if (br == 0 || ar == 0 || bc == 0)
{
nmod_poly_mat_zero(C);
return;
}
if (C == A || C == B)
{
nmod_poly_mat_t T;
nmod_poly_mat_init(T, ar, bc, nmod_poly_mat_modulus(A));
nmod_poly_mat_mul_classical(T, A, B);
nmod_poly_mat_swap_entrywise(C, T);
nmod_poly_mat_clear(T);
return;
}
nmod_poly_init(t, nmod_poly_mat_modulus(A));
for (i = 0; i < ar; i++)
{
for (j = 0; j < bc; j++)
{
nmod_poly_mul(nmod_poly_mat_entry(C, i, j),
nmod_poly_mat_entry(A, i, 0),
nmod_poly_mat_entry(B, 0, j));
for (k = 1; k < br; k++)
{
nmod_poly_mul(t, nmod_poly_mat_entry(A, i, k),
nmod_poly_mat_entry(B, k, j));
nmod_poly_add(nmod_poly_mat_entry(C, i, j),
nmod_poly_mat_entry(C, i, j), t);
}
}
}
nmod_poly_clear(t);
}