1 /*
2 Copyright (C) 2014 Fredrik Johansson
3
4 This file is part of Arb.
5
6 Arb is free software: you can redistribute it and/or modify it under
7 the terms of the GNU Lesser General Public License (LGPL) as published
8 by the Free Software Foundation; either version 2.1 of the License, or
9 (at your option) any later version. See <http://www.gnu.org/licenses/>.
10 */
11
12 #include "acb_modular.h"
13
main()14 int main()
15 {
16 slong iter;
17 flint_rand_t state;
18
19 flint_printf("theta_sum....");
20 fflush(stdout);
21
22 flint_randinit(state);
23
24 /* Very weak test, just testing the error bounds and not
25 that we compute the right functions */
26 for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
27 {
28 acb_ptr t1a, t1b, t2a, t2b, t3a, t3b, t4a, t4b;
29 acb_t w, q;
30 int w_is_unit;
31 slong prec0, e0, prec1, prec2, len1, len2, i;
32
33 acb_init(w);
34 acb_init(q);
35
36 e0 = 1 + n_randint(state, 100);
37 prec0 = 2 + n_randint(state, 3000);
38 prec1 = 2 + n_randint(state, 3000);
39 prec2 = 2 + n_randint(state, 3000);
40 len1 = 1 + n_randint(state, 30);
41 len2 = 1 + n_randint(state, 30);
42
43 t1a = _acb_vec_init(len1);
44 t2a = _acb_vec_init(len1);
45 t3a = _acb_vec_init(len1);
46 t4a = _acb_vec_init(len1);
47
48 t1b = _acb_vec_init(len2);
49 t2b = _acb_vec_init(len2);
50 t3b = _acb_vec_init(len2);
51 t4b = _acb_vec_init(len2);
52
53 if (n_randint(state, 2))
54 {
55 arb_randtest(acb_realref(q), state, prec0, e0);
56 arb_zero(acb_imagref(q));
57 acb_exp_pi_i(w, q, prec0);
58 w_is_unit = n_randint(state, 2);
59 }
60 else
61 {
62 acb_randtest(w, state, prec0, e0);
63 w_is_unit = 0;
64 }
65
66 acb_randtest(q, state, prec0, e0);
67
68 for (i = 0; i < len1; i++)
69 {
70 acb_randtest(t1a + i, state, prec0, e0);
71 acb_randtest(t2a + i, state, prec0, e0);
72 acb_randtest(t3a + i, state, prec0, e0);
73 acb_randtest(t4a + i, state, prec0, e0);
74 }
75
76 for (i = 0; i < len2; i++)
77 {
78 acb_randtest(t1b + i, state, prec0, e0);
79 acb_randtest(t2b + i, state, prec0, e0);
80 acb_randtest(t3b + i, state, prec0, e0);
81 acb_randtest(t4b + i, state, prec0, e0);
82 }
83
84 acb_modular_theta_sum(t1a, t2a, t3a, t4a,
85 w, w_is_unit, q, len1, prec1);
86
87 acb_modular_theta_sum(t1b, t2b, t3b, t4b,
88 w, w_is_unit & n_randint(state, 2), q, len2, prec2);
89
90 for (i = 0; i < FLINT_MIN(len1, len2); i++)
91 {
92 if (!acb_overlaps(t1a + i, t1b + i)
93 || !acb_overlaps(t2a + i, t2b + i)
94 || !acb_overlaps(t3a + i, t3b + i)
95 || !acb_overlaps(t4a + i, t4b + i))
96 {
97 flint_printf("FAIL (overlap) iter = %wd\n", iter);
98 flint_printf("len1 = %wd, len2 = %wd, prec1 = %wd, prec2 = %wd\n\n",
99 len1, len2, prec1, prec2);
100 flint_printf("i = %wd\n\n", i);
101 flint_printf("q = "); acb_printd(q, 50); flint_printf("\n\n");
102 flint_printf("w = "); acb_printd(w, 50); flint_printf("\n\n");
103 flint_printf("t1a = "); acb_printd(t1a + i, 50); flint_printf("\n\n");
104 flint_printf("t1b = "); acb_printd(t1b + i, 50); flint_printf("\n\n");
105 flint_printf("t2a = "); acb_printd(t2a + i, 50); flint_printf("\n\n");
106 flint_printf("t2b = "); acb_printd(t2b + i, 50); flint_printf("\n\n");
107 flint_printf("t3a = "); acb_printd(t3a + i, 50); flint_printf("\n\n");
108 flint_printf("t3b = "); acb_printd(t3b + i, 50); flint_printf("\n\n");
109 flint_printf("t4a = "); acb_printd(t4a + i, 50); flint_printf("\n\n");
110 flint_printf("t4b = "); acb_printd(t4b + i, 50); flint_printf("\n\n");
111 flint_abort();
112 }
113 }
114
115 _acb_vec_clear(t1a, len1);
116 _acb_vec_clear(t2a, len1);
117 _acb_vec_clear(t3a, len1);
118 _acb_vec_clear(t4a, len1);
119 _acb_vec_clear(t1b, len2);
120 _acb_vec_clear(t2b, len2);
121 _acb_vec_clear(t3b, len2);
122 _acb_vec_clear(t4b, len2);
123
124 acb_clear(w);
125 acb_clear(q);
126 }
127
128 flint_randclear(state);
129 flint_cleanup();
130 flint_printf("PASS\n");
131 return EXIT_SUCCESS;
132 }
133
134