mirror of
https://github.com/vale981/arb
synced 2025-03-08 18:51:40 -05:00
153 lines
4.4 KiB
C
153 lines
4.4 KiB
C
/*
|
|
Copyright (C) 2016 Pascal Molin
|
|
|
|
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_dirichlet.h"
|
|
|
|
int main()
|
|
{
|
|
|
|
slong k;
|
|
slong prec = 100, digits = 30;
|
|
slong nq = 13;
|
|
ulong q[13] = { 2, 3, 4, 5, 6, 23, 10, 15, 30, 59, 308, 335, 961};
|
|
flint_rand_t state;
|
|
|
|
flint_printf("dft....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
/* cyclic dft */
|
|
for (k = 0; k < nq; k++)
|
|
{
|
|
slong i;
|
|
acb_ptr v, w1, w2;
|
|
|
|
v = _acb_vec_init(q[k]);
|
|
w1 = _acb_vec_init(q[k]);
|
|
w2 = _acb_vec_init(q[k]);
|
|
|
|
for (i = 0; i < q[k]; i++)
|
|
acb_set_si(v + i, i);
|
|
|
|
acb_dirichlet_dft_pol(w1, v, q[k], prec);
|
|
acb_dirichlet_dft_fast(w2, v, q[k], prec);
|
|
|
|
for (i = 0; i < q[k]; i++)
|
|
{
|
|
if (!acb_overlaps(w1 + i, w2 + i))
|
|
{
|
|
flint_printf("differ from index %ld / %ld \n\n",i,q[k]);
|
|
flint_printf("pol =\n");
|
|
acb_vec_printd(w1, q[k], digits);
|
|
flint_printf("fast =\n");
|
|
acb_vec_printd(w2, q[k], digits);
|
|
flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
}
|
|
|
|
_acb_vec_clear(v, q[k]);
|
|
_acb_vec_clear(w1, q[k]);
|
|
_acb_vec_clear(w2, q[k]);
|
|
}
|
|
|
|
/* Dirichlet group DFT */
|
|
for (k = 0; k < nq; k++)
|
|
{
|
|
slong i, j, len;
|
|
acb_dirichlet_group_t G;
|
|
acb_dirichlet_conrey_t x, y;
|
|
acb_t chiy;
|
|
acb_ptr v, w1, w2;
|
|
|
|
acb_dirichlet_group_init(G, q[k]);
|
|
|
|
len = G->phi_q;
|
|
v = _acb_vec_init(len);
|
|
w1 = _acb_vec_init(len);
|
|
w2 = _acb_vec_init(len);
|
|
|
|
acb_dirichlet_conrey_init(x, G);
|
|
acb_dirichlet_conrey_one(x, G);
|
|
for (i = 0; i < len; i++)
|
|
acb_randtest_precise(v + i, state, prec, 0);
|
|
|
|
/* naive */
|
|
acb_init(chiy);
|
|
acb_dirichlet_conrey_init(y, G);
|
|
acb_dirichlet_conrey_one(x, G);
|
|
for (i = 0; i < len; i++)
|
|
{
|
|
acb_zero(w1 + i);
|
|
acb_dirichlet_conrey_one(y, G);
|
|
for (j = 0; j < len; j++)
|
|
{
|
|
acb_dirichlet_pairing_conrey(chiy, G, x, y, prec);
|
|
acb_addmul(w1 + i, chiy, v + j, prec);
|
|
acb_dirichlet_conrey_next(y, G);
|
|
}
|
|
acb_dirichlet_conrey_next(x, G);
|
|
}
|
|
acb_clear(chiy);
|
|
acb_dirichlet_conrey_clear(y);
|
|
acb_dirichlet_conrey_clear(x);
|
|
|
|
/* dft */
|
|
acb_dirichlet_dft_conrey(w2, v, G, prec);
|
|
|
|
for (i = 0; i < len; i++)
|
|
{
|
|
if (!acb_overlaps(w1 + i, w2 + i))
|
|
{
|
|
flint_printf("FAIL\n\n");
|
|
flint_printf("q = %wu\n", q[k]);
|
|
flint_printf("v [size %wu]\n", len);
|
|
acb_vec_printd(v, len, digits);
|
|
flint_printf("\nDFT differ from index %ld / %ld \n", i, len);
|
|
flint_printf("\nnaive =\n");
|
|
acb_vec_printd(w1, len, digits);
|
|
flint_printf("\nfast =\n");
|
|
acb_vec_printd(w2, len, digits);
|
|
flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
else if (acb_rel_accuracy_bits(w1 + i) < 30
|
|
|| acb_rel_accuracy_bits(w2 + i) < 30)
|
|
{
|
|
flint_printf("FAIL\n\n");
|
|
flint_printf("q = %wu\n", q[k]);
|
|
flint_printf("\nDFT inaccurate from index %ld / %ld \n", i, len);
|
|
flint_printf("\nnaive =\n");
|
|
acb_printd(w1 + i, digits);
|
|
flint_printf("\nfast =\n");
|
|
acb_printd(w2 + i, digits);
|
|
flint_printf("\nerrors %ld & %ld [prec = %wu]\n",
|
|
acb_rel_accuracy_bits(w1 + i),
|
|
acb_rel_accuracy_bits(w2 + i), prec
|
|
);
|
|
abort();
|
|
}
|
|
}
|
|
|
|
_acb_vec_clear(v, len);
|
|
_acb_vec_clear(w1, len);
|
|
_acb_vec_clear(w2, len);
|
|
|
|
acb_dirichlet_group_clear(G);
|
|
}
|
|
|
|
flint_randclear(state);
|
|
flint_cleanup();
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|