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
131
|
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2011 Fredrik Johansson
******************************************************************************/
#include "fmpz_mat.h"
#include "longlong.h"
void
fmpz_mat_mul_classical_inline(fmpz_mat_t C, const fmpz_mat_t A,
const fmpz_mat_t B)
{
slong ar, bc, br;
slong i, j, k;
fmpz a, b;
mpz_t t;
mp_limb_t au, bu;
mp_limb_t pos[3];
mp_limb_t neg[3];
ar = A->r;
br = B->r;
bc = B->c;
mpz_init(t);
for (i = 0; i < ar; i++)
{
for (j = 0; j < bc; j++)
{
flint_mpz_set_ui(t, UWORD(0));
pos[2] = pos[1] = pos[0] = neg[2] = neg[1] = neg[0] = UWORD(0);
for (k = 0; k < br; k++)
{
a = A->rows[i][k];
b = B->rows[k][j];
if (a == 0 || b == 0)
continue;
if (!COEFF_IS_MPZ(a)) /* a is small */
{
if (!COEFF_IS_MPZ(b)) /* both are small */
{
au = FLINT_ABS(a);
bu = FLINT_ABS(b);
umul_ppmm(au, bu, au, bu);
if ((a ^ b) >= WORD(0))
add_sssaaaaaa(pos[2], pos[1], pos[0],
pos[2], pos[1], pos[0], 0, au, bu);
else
add_sssaaaaaa(neg[2], neg[1], neg[0],
neg[2], neg[1], neg[0], 0, au, bu);
}
else
{
if (a >= 0)
flint_mpz_addmul_ui(t, COEFF_TO_PTR(b), a);
else
flint_mpz_submul_ui(t, COEFF_TO_PTR(b), -a);
}
}
else if (!COEFF_IS_MPZ(b)) /* b is small */
{
if (b >= 0)
flint_mpz_addmul_ui(t, COEFF_TO_PTR(a), b);
else
flint_mpz_submul_ui(t, COEFF_TO_PTR(a), -b);
}
else
{
mpz_addmul(t, COEFF_TO_PTR(a), COEFF_TO_PTR(b));
}
}
if (mpz_sgn(t) != 0 || pos[2] || neg[2] || pos[1] || neg[1])
{
__mpz_struct r;
r._mp_size = pos[2] ? 3 : (pos[1] ? 2 : pos[0] != 0);
r._mp_alloc = r._mp_size;
r._mp_d = pos;
mpz_add(t, t, &r);
r._mp_size = neg[2] ? 3 : (neg[1] ? 2 : neg[0] != 0);
r._mp_alloc = r._mp_size;
r._mp_d = neg;
mpz_sub(t, t, &r);
fmpz_set_mpz(fmpz_mat_entry(C, i, j), t);
}
else
{
if (neg[0] > pos[0])
fmpz_neg_ui(fmpz_mat_entry(C, i, j), neg[0] - pos[0]);
else
fmpz_set_ui(fmpz_mat_entry(C, i, j), pos[0] - neg[0]);
}
}
}
mpz_clear(t);
}
|
