79 lines
2.2 KiB
C
79 lines
2.2 KiB
C
|
/*=============================================================================
|
||
|
|
||
|
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 <stdlib.h>
|
||
|
#include "flint.h"
|
||
|
#include "nmod_poly.h"
|
||
|
#include "nmod_poly_mat.h"
|
||
|
|
||
|
static __inline__ void
|
||
|
nmod_poly_sqr(nmod_poly_t y, const nmod_poly_t x)
|
||
|
{
|
||
|
nmod_poly_mul(y, x, x);
|
||
|
}
|
||
|
|
||
|
#define E nmod_poly_mat_entry
|
||
|
|
||
|
void
|
||
|
nmod_poly_mat_sqr_classical(nmod_poly_mat_t B, const nmod_poly_mat_t A)
|
||
|
{
|
||
|
slong n = A->r;
|
||
|
|
||
|
if (n == 0)
|
||
|
return;
|
||
|
|
||
|
if (n == 1)
|
||
|
{
|
||
|
nmod_poly_sqr(E(B, 0, 0), E(A, 0, 0));
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
if (n == 2)
|
||
|
{
|
||
|
nmod_poly_t t, u;
|
||
|
|
||
|
nmod_poly_init(t, nmod_poly_mat_modulus(A));
|
||
|
nmod_poly_init(u, nmod_poly_mat_modulus(A));
|
||
|
|
||
|
nmod_poly_add(t, E(A, 0, 0), E(A, 1, 1));
|
||
|
nmod_poly_mul(u, E(A, 0, 1), E(A, 1, 0));
|
||
|
|
||
|
nmod_poly_sqr(E(B, 0, 0), E(A, 0, 0));
|
||
|
nmod_poly_add(E(B, 0, 0), E(B, 0, 0), u);
|
||
|
|
||
|
nmod_poly_sqr(E(B, 1, 1), E(A, 1, 1));
|
||
|
nmod_poly_add(E(B, 1, 1), E(B, 1, 1), u);
|
||
|
|
||
|
nmod_poly_mul(E(B, 0, 1), E(A, 0, 1), t);
|
||
|
nmod_poly_mul(E(B, 1, 0), E(A, 1, 0), t);
|
||
|
|
||
|
nmod_poly_clear(t);
|
||
|
nmod_poly_clear(u);
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
nmod_poly_mat_mul_classical(B, A, A);
|
||
|
}
|