arb/arb_mat/mul_classical.c

97 lines
2.3 KiB
C
Raw Normal View History

/*
Copyright (C) 2012, 2018 Fredrik Johansson
2014-05-14 16:59:09 +02:00
This file is part of Arb.
Arb 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 2.1 of the License, or
(at your option) any later version. See <http://www.gnu.org/licenses/>.
*/
2014-05-14 16:59:09 +02:00
#include "arb_mat.h"
void
arb_mat_mul_classical(arb_mat_t C, const arb_mat_t A, const arb_mat_t B, slong prec)
2014-05-14 16:59:09 +02:00
{
slong ar, ac, br, bc, i, j, k;
2014-05-14 16:59:09 +02:00
2018-08-28 15:54:25 +02:00
if (A == B && (arb_mat_nrows(A) <= 2 ||
(prec >= 1024 && arb_mat_nrows(A) < 8)))
{
arb_mat_sqr_classical(C, A, prec);
return;
}
2014-05-14 16:59:09 +02:00
ar = arb_mat_nrows(A);
ac = arb_mat_ncols(A);
br = arb_mat_nrows(B);
bc = arb_mat_ncols(B);
if (ac != br || ar != arb_mat_nrows(C) || bc != arb_mat_ncols(C))
{
flint_printf("arb_mat_mul: incompatible dimensions\n");
flint_abort();
2014-05-14 16:59:09 +02:00
}
if (br == 0)
{
arb_mat_zero(C);
return;
}
if (A == C || B == C)
{
arb_mat_t T;
arb_mat_init(T, ar, bc);
2017-08-01 14:01:05 +02:00
arb_mat_mul_classical(T, A, B, prec);
arb_mat_swap_entrywise(T, C);
2014-05-14 16:59:09 +02:00
arb_mat_clear(T);
return;
}
if (br <= 2)
2014-05-14 16:59:09 +02:00
{
for (i = 0; i < ar; i++)
2014-05-14 16:59:09 +02:00
{
for (j = 0; j < bc; j++)
{
/* todo: efficient fmma code */
arb_mul(arb_mat_entry(C, i, j),
arb_mat_entry(A, i, 0),
arb_mat_entry(B, 0, j), prec);
for (k = 1; k < br; k++)
{
arb_addmul(arb_mat_entry(C, i, j),
arb_mat_entry(A, i, k),
arb_mat_entry(B, k, j), prec);
}
}
}
}
else
{
arb_ptr tmp;
TMP_INIT;
2014-05-14 16:59:09 +02:00
TMP_START;
tmp = TMP_ALLOC(sizeof(arb_struct) * br * bc);
for (i = 0; i < br; i++)
for (j = 0; j < bc; j++)
tmp[j * br + i] = *arb_mat_entry(B, i, j);
for (i = 0; i < ar; i++)
{
for (j = 0; j < bc; j++)
2014-05-14 16:59:09 +02:00
{
arb_dot(arb_mat_entry(C, i, j), NULL, 0,
A->rows[i], 1, tmp + j * br, 1, br, prec);
2014-05-14 16:59:09 +02:00
}
}
TMP_END;
2014-05-14 16:59:09 +02:00
}
}