503 changes: 503 additions & 0 deletions fmprb_poly/mullow_block2.c
View file

Large diffs are not rendered by default.

5 changes: 3 additions & 2 deletions fmprb_poly/mullow_scaled.c
View file
Expand Up @@ -25,8 +25,9 @@

#include "fmprb_poly.h"

static __inline__ void
_fmprb_poly_get_scale(fmpz_t scale, fmprb_srcptr x, long xlen, fmprb_srcptr y, long ylen)
void
_fmprb_poly_get_scale(fmpz_t scale, fmprb_srcptr x, long xlen,
fmprb_srcptr y, long ylen)
{
long xa, xb, ya, yb, den;

Expand Down
4 changes: 2 additions & 2 deletions fmprb_poly/test/t-mullow_block.c
View file
Expand Up @@ -36,7 +36,7 @@ int main()
flint_randinit(state);

/* compare with fmpq_poly */
for (iter = 0; iter < 10000; iter++)
for (iter = 0; iter < 1000; iter++)
{
long qbits1, qbits2, rbits1, rbits2, rbits3, trunc;
fmpq_poly_t A, B, C;
Expand Down Expand Up @@ -136,7 +136,7 @@ int main()
fmprb_poly_clear(d);
}

for (iter = 0; iter < 3000; iter++)
for (iter = 0; iter < 1000; iter++)
{
long rbits1, rbits2, rbits3, trunc;
fmprb_poly_t a, b, c, ab, ac, bc, abc, abc2;
Expand Down
223 changes: 223 additions & 0 deletions fmprb_poly/test/t-mullow_block2.c
View file
@@ -0,0 +1,223 @@
/*=============================================================================
This file is part of ARB.
ARB 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.
ARB 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 ARB; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2012, 2013 Fredrik Johansson
******************************************************************************/

#include "fmprb_poly.h"

int main()
{
long iter;
flint_rand_t state;

printf("mullow_block2....");
fflush(stdout);

flint_randinit(state);

/* compare with fmpq_poly */
for (iter = 0; iter < 10000; iter++)
{
long qbits1, qbits2, rbits1, rbits2, rbits3, trunc;
fmpq_poly_t A, B, C;
fmprb_poly_t a, b, c, d;

qbits1 = 2 + n_randint(state, 1000);
qbits2 = 2 + n_randint(state, 1000);
rbits1 = 2 + n_randint(state, 1000);
rbits2 = 2 + n_randint(state, 1000);
rbits3 = 2 + n_randint(state, 1000);
trunc = n_randint(state, 100);

fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(C);

fmprb_poly_init(a);
fmprb_poly_init(b);
fmprb_poly_init(c);
fmprb_poly_init(d);

fmpq_poly_randtest(A, state, 1 + n_randint(state, 100), qbits1);
fmpq_poly_randtest(B, state, 1 + n_randint(state, 100), qbits2);
fmpq_poly_mullow(C, A, B, trunc);

fmprb_poly_set_fmpq_poly(a, A, rbits1);
fmprb_poly_set_fmpq_poly(b, B, rbits2);
fmprb_poly_mullow_block2(c, a, b, trunc, rbits3);

if (!fmprb_poly_contains_fmpq_poly(c, C))
{
printf("FAIL\n\n");
printf("bits3 = %ld\n", rbits3);
printf("trunc = %ld\n", trunc);

printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("B = "); fmpq_poly_print(B); printf("\n\n");
printf("C = "); fmpq_poly_print(C); printf("\n\n");

printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");

abort();
}

fmprb_poly_set(d, a);
fmprb_poly_mullow_block2(d, d, b, trunc, rbits3);
if (!fmprb_poly_equal(d, c))
{
printf("FAIL (aliasing 1)\n\n");
abort();
}

fmprb_poly_set(d, b);
fmprb_poly_mullow_block2(d, a, d, trunc, rbits3);
if (!fmprb_poly_equal(d, c))
{
printf("FAIL (aliasing 2)\n\n");
abort();
}

/* test squaring */
fmprb_poly_set(b, a);
fmprb_poly_mullow_block2(c, a, b, trunc, rbits3);
fmprb_poly_mullow_block2(d, a, a, trunc, rbits3);
if (!fmprb_poly_overlaps(c, d)) /* not guaranteed to be identical */
{
printf("FAIL (squaring)\n\n");

printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");

abort();
}

fmprb_poly_mullow_block2(a, a, a, trunc, rbits3);
if (!fmprb_poly_equal(d, a))
{
printf("FAIL (aliasing, squaring)\n\n");

printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("d = "); fmprb_poly_printd(d, 15); printf("\n\n");

abort();
}

fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(C);

fmprb_poly_clear(a);
fmprb_poly_clear(b);
fmprb_poly_clear(c);
fmprb_poly_clear(d);
}

for (iter = 0; iter < 3000; iter++)
{
long rbits1, rbits2, rbits3, trunc;
fmprb_poly_t a, b, c, ab, ac, bc, abc, abc2;

rbits1 = 2 + n_randint(state, 300);
rbits2 = 2 + n_randint(state, 300);
rbits3 = 2 + n_randint(state, 300);
trunc = n_randint(state, 100);

fmprb_poly_init(a);
fmprb_poly_init(b);
fmprb_poly_init(c);
fmprb_poly_init(ab);
fmprb_poly_init(ac);
fmprb_poly_init(bc);
fmprb_poly_init(abc);
fmprb_poly_init(abc2);

fmprb_poly_randtest(a, state, 1 + n_randint(state, 100), rbits1, 1 + n_randint(state, 100));
fmprb_poly_randtest(b, state, 1 + n_randint(state, 100), rbits2, 1 + n_randint(state, 100));
fmprb_poly_randtest(c, state, 1 + n_randint(state, 100), rbits2, 1 + n_randint(state, 100));

/* check a*(b+c) = a*b + a*c */
fmprb_poly_mullow_block2(ab, a, b, trunc, rbits3);
fmprb_poly_mullow_block2(ac, a, c, trunc, rbits3);
fmprb_poly_add(abc, ab, ac, rbits3);

fmprb_poly_add(bc, b, c, rbits3);
fmprb_poly_mullow_block2(abc2, a, bc, trunc, rbits3);

if (!fmprb_poly_overlaps(abc, abc2))
{
printf("FAIL (a*(b+c) = a*b + a*c) \n\n");
printf("bits3 = %ld\n", rbits3);
printf("trunc = %ld\n", trunc);

printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");

abort();
}

/* check (b+c)^2 = b^2 + 2bc + c^2 */
fmprb_poly_mullow_block2(a, b, c, trunc, rbits3);
fmprb_poly_scalar_mul_2exp_si(a, a, 1);
fmprb_poly_mullow_block2(abc, b, b, trunc, rbits3);
fmprb_poly_mullow_block2(abc2, c, c, trunc, rbits3);
fmprb_poly_add(abc, abc, a, rbits3);
fmprb_poly_add(abc, abc, abc2, rbits3);

fmprb_poly_mullow_block2(abc2, bc, bc, trunc, rbits3);

if (!fmprb_poly_overlaps(abc, abc2))
{
printf("FAIL ((b+c)^2 = b^2 + 2bc + c^2) \n\n");
printf("bits3 = %ld\n", rbits3);
printf("trunc = %ld\n", trunc);

printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");

printf("abc = "); fmprb_poly_printd(abc, 15); printf("\n\n");
printf("abc2 = "); fmprb_poly_printd(abc2, 15); printf("\n\n");

abort();
}

fmprb_poly_clear(a);
fmprb_poly_clear(b);
fmprb_poly_clear(c);
fmprb_poly_clear(ab);
fmprb_poly_clear(ac);
fmprb_poly_clear(bc);
fmprb_poly_clear(abc);
fmprb_poly_clear(abc2);
}

flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}

4 changes: 2 additions & 2 deletions fmprb_poly/test/t-mullow_block_scaled.c
View file
Expand Up @@ -36,7 +36,7 @@ int main()
flint_randinit(state);

/* compare with fmpq_poly */
for (iter = 0; iter < 10000; iter++)
for (iter = 0; iter < 1000; iter++)
{
long qbits1, qbits2, rbits1, rbits2, rbits3, trunc;
fmpq_poly_t A, B, C;
Expand Down Expand Up @@ -136,7 +136,7 @@ int main()
fmprb_poly_clear(d);
}

for (iter = 0; iter < 3000; iter++)
for (iter = 0; iter < 1000; iter++)
{
long rbits1, rbits2, rbits3, trunc;
fmprb_poly_t a, b, c, ab, ac, bc, abc, abc2;
Expand Down