1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
/*
Copyright (C) 2013 Fredrik Johansson
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/>.
*/
#include "acb_poly.h"
int main()
{
slong iter;
flint_rand_t state;
flint_printf("binomial_transform_convolution....");
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_convolution(b, a, n, prec);
acb_poly_binomial_transform_convolution(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");
flint_abort();
}
acb_poly_set(d, a);
acb_poly_binomial_transform_convolution(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");
flint_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");
flint_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;
}
|
