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;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("find_roots....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
acb_poly_t A;
acb_poly_t B;
acb_poly_t C;
acb_t t;
acb_ptr roots;
slong i, deg, isolated;
slong prec = 10 + n_randint(state, 400);
acb_init(t);
acb_poly_init(A);
acb_poly_init(B);
acb_poly_init(C);
do {
acb_poly_randtest(A, state, 2 + n_randint(state, 15), prec, 5);
} while (A->length == 0);
deg = A->length - 1;
roots = _acb_vec_init(deg);
isolated = acb_poly_find_roots(roots, A, NULL, 0, prec);
if (isolated == deg)
{
acb_poly_fit_length(B, 1);
acb_set(B->coeffs, A->coeffs + deg);
_acb_poly_set_length(B, 1);
for (i = 0; i < deg; i++)
{
acb_poly_fit_length(C, 2);
acb_one(C->coeffs + 1);
acb_neg(C->coeffs + 0, roots + i);
_acb_poly_set_length(C, 2);
acb_poly_mul(B, B, C, prec);
}
if (!acb_poly_contains(B, A))
{
flint_printf("FAIL: product does not equal polynomial\n");
acb_poly_printd(A, 15); flint_printf("\n\n");
acb_poly_printd(B, 15); flint_printf("\n\n");
flint_abort();
}
}
for (i = 0; i < isolated; i++)
{
acb_poly_evaluate(t, A, roots + i, prec);
if (!acb_contains_zero(t))
{
flint_printf("FAIL: poly(root) does not contain zero\n");
acb_poly_printd(A, 15); flint_printf("\n\n");
acb_printd(roots + i, 15); flint_printf("\n\n");
acb_printd(t, 15); flint_printf("\n\n");
flint_abort();
}
}
_acb_vec_clear(roots, deg);
acb_clear(t);
acb_poly_clear(A);
acb_poly_clear(B);
acb_poly_clear(C);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
