int main()
{
long iter;
flint_rand_t state;
printf("compose_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 3000; iter++)
{
long qbits1, qbits2, rbits1, rbits2, rbits3, n;
fmpq_poly_t A, B, C;
acb_poly_t a, b, c, d;
qbits1 = 2 + n_randint(state, 200);
qbits2 = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
n = 2 + n_randint(state, 25);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(C);
acb_poly_init(a);
acb_poly_init(b);
acb_poly_init(c);
acb_poly_init(d);
fmpq_poly_randtest(A, state, 1 + n_randint(state, 25), qbits1);
fmpq_poly_randtest(B, state, 1 + n_randint(state, 25), qbits2);
fmpq_poly_set_coeff_ui(B, 0, 0);
fmpq_poly_compose_series(C, A, B, n);
acb_poly_randtest(c, state, 1 + n_randint(state, 20), rbits1, 4);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_set_fmpq_poly(b, B, rbits2);
acb_poly_compose_series(c, a, b, n, rbits3);
if (!acb_poly_contains_fmpq_poly(c, C))
{
printf("FAIL\n\n");
printf("n = %ld, bits3 = %ld\n", n, rbits3);
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 = ");
acb_poly_printd(a, 15);
printf("\n\n");
printf("b = ");
acb_poly_printd(b, 15);
printf("\n\n");
printf("c = ");
acb_poly_printd(c, 15);
printf("\n\n");
abort();
}
acb_poly_set(d, a);
acb_poly_compose_series(d, d, b, n, rbits3);
if (!acb_poly_equal(d, c))
{
printf("FAIL (aliasing 1)\n\n");
abort();
}
acb_poly_set(d, b);
acb_poly_compose_series(d, a, d, n, rbits3);
if (!acb_poly_equal(d, c))
{
printf("FAIL (aliasing 2)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(C);
acb_poly_clear(a);
acb_poly_clear(b);
acb_poly_clear(c);
acb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("binomial_transform....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 500 * arb_test_multiplier(); iter++)
{
acb_poly_t a, b, c, d;
slong j, n, prec;
acb_poly_init(a);
acb_poly_init(b);
acb_poly_init(c);
acb_poly_init(d);
n = n_randint(state, 20);
prec = 2 + n_randint(state, 200);
acb_poly_randtest(a, state, n, prec, 10);
acb_poly_randtest(b, state, n, prec, 10);
acb_poly_randtest(c, state, n, prec, 10);
/* check self-inversion property */
acb_poly_binomial_transform(b, a, n, prec);
acb_poly_binomial_transform(c, b, n, prec);
acb_poly_set(d, a);
acb_poly_truncate(d, n);
if (!acb_poly_contains(c, d))
{
flint_printf("FAIL (containment)\n\n");
flint_printf("n = %wd, prec = %wd\n\n", n, prec);
flint_printf("a: "); acb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b: "); acb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c: "); acb_poly_printd(c, 15); flint_printf("\n\n");
flint_printf("d: "); acb_poly_printd(d, 15); flint_printf("\n\n");
abort();
}
acb_poly_set(d, a);
acb_poly_binomial_transform(d, d, n, prec);
if (!acb_poly_equal(d, b))
{
flint_printf("FAIL (aliasing)\n\n");
flint_printf("a: "); acb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b: "); acb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("d: "); acb_poly_printd(d, 15); flint_printf("\n\n");
abort();
}
/* compare with power series operations */
acb_poly_zero(d);
for (j = 1; j < n; j++)
acb_poly_set_coeff_si(d, j, -1);
acb_poly_compose_series(c, a, d, n, prec);
for (j = 0; j < n; j++)
acb_poly_set_coeff_si(d, j, 1);
acb_poly_mullow(c, c, d, n, prec);
if (!acb_poly_overlaps(b, c))
{
flint_printf("FAIL (power series)\n\n");
flint_printf("a: "); acb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b: "); acb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c: "); acb_poly_printd(c, 15); flint_printf("\n\n");
abort();
}
acb_poly_clear(a);
acb_poly_clear(b);
acb_poly_clear(c);
acb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
