mirror of
https://github.com/vale981/arb
synced 2025-03-06 09:51:39 -05:00
105 lines
3.2 KiB
C
105 lines
3.2 KiB
C
/*=============================================================================
|
|
|
|
This file is part of ARB.
|
|
|
|
ARB is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ARB is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with ARB; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
=============================================================================*/
|
|
/******************************************************************************
|
|
|
|
Copyright (C) 2013 Fredrik Johansson
|
|
|
|
******************************************************************************/
|
|
|
|
#include "acb_poly.h"
|
|
|
|
extern slong acb_poly_newton_exp_cutoff;
|
|
|
|
int main()
|
|
{
|
|
slong iter;
|
|
flint_rand_t state;
|
|
|
|
flint_printf("exp_series....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
|
|
{
|
|
slong m, n, bits1, bits2, bits3;
|
|
acb_poly_t a, b, c, d;
|
|
|
|
bits1 = 2 + n_randint(state, 100);
|
|
bits2 = 2 + n_randint(state, 100);
|
|
bits3 = 2 + n_randint(state, 100);
|
|
|
|
if (iter > 1000)
|
|
{
|
|
acb_poly_newton_exp_cutoff = 5 + n_randint(state, 50);
|
|
}
|
|
|
|
if (n_randint(state, 100) == 0)
|
|
{
|
|
m = 1 + n_randint(state, 100);
|
|
n = 1 + n_randint(state, 100);
|
|
}
|
|
else
|
|
{
|
|
m = 1 + n_randint(state, 20);
|
|
n = 1 + n_randint(state, 20);
|
|
}
|
|
|
|
acb_poly_init(a);
|
|
acb_poly_init(b);
|
|
acb_poly_init(c);
|
|
acb_poly_init(d);
|
|
|
|
acb_poly_randtest(a, state, m, bits1, 5);
|
|
acb_poly_randtest(b, state, m, bits1, 5);
|
|
|
|
acb_poly_randtest(c, state, 1 + n_randint(state, 300), bits1, 10);
|
|
acb_poly_randtest(d, state, 1 + n_randint(state, 300), bits1, 10);
|
|
|
|
/* check exp(a+b) = exp(a) exp(b) */
|
|
acb_poly_exp_series(c, a, n, bits2);
|
|
acb_poly_exp_series(d, b, n, bits2);
|
|
acb_poly_mullow(c, c, d, n, bits2);
|
|
|
|
acb_poly_add(d, a, b, bits3);
|
|
acb_poly_exp_series(d, d, n, bits3); /* also aliasing test */
|
|
|
|
if (!acb_poly_overlaps(c, d))
|
|
{
|
|
flint_printf("FAIL\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_printf("d = "); acb_poly_printd(d, 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;
|
|
}
|