2016-04-26 17:20:05 +02:00
|
|
|
/*
|
2014-05-16 14:04:28 +02:00
|
|
|
Copyright (C) 2012, 2013 Fredrik Johansson
|
|
|
|
|
2016-04-26 17:20:05 +02:00
|
|
|
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/>.
|
|
|
|
*/
|
2014-05-16 14:04:28 +02:00
|
|
|
|
|
|
|
#include "acb_poly.h"
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
2015-11-05 17:51:23 +00:00
|
|
|
slong iter;
|
2014-05-16 14:04:28 +02:00
|
|
|
flint_rand_t state;
|
|
|
|
|
2015-11-06 16:17:27 +00:00
|
|
|
flint_printf("tan_series....");
|
2014-05-16 14:04:28 +02:00
|
|
|
fflush(stdout);
|
|
|
|
|
|
|
|
flint_randinit(state);
|
|
|
|
|
2016-04-10 17:24:58 +02:00
|
|
|
for (iter = 0; iter < 2000 * arb_test_multiplier(); iter++)
|
2014-05-16 14:04:28 +02:00
|
|
|
{
|
2015-11-05 17:51:23 +00:00
|
|
|
slong m, n, rbits1, rbits2;
|
2014-05-16 14:04:28 +02:00
|
|
|
acb_poly_t a, b, c, d, e;
|
|
|
|
|
2016-03-31 02:02:22 +02:00
|
|
|
rbits1 = 2 + n_randint(state, 100);
|
|
|
|
rbits2 = 2 + n_randint(state, 100);
|
|
|
|
|
|
|
|
if (n_randint(state, 10) == 0)
|
|
|
|
{
|
|
|
|
m = 1 + n_randint(state, 50);
|
|
|
|
n = 1 + n_randint(state, 50);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m = 1 + n_randint(state, 20);
|
|
|
|
n = 1 + n_randint(state, 20);
|
|
|
|
}
|
2014-05-16 14:04:28 +02:00
|
|
|
|
|
|
|
acb_poly_init(a);
|
|
|
|
acb_poly_init(b);
|
|
|
|
acb_poly_init(c);
|
|
|
|
acb_poly_init(d);
|
|
|
|
acb_poly_init(e);
|
|
|
|
|
|
|
|
acb_poly_randtest(a, state, m, rbits1, 10);
|
|
|
|
acb_poly_tan_series(b, a, n, rbits2);
|
|
|
|
|
|
|
|
/* check tan(x) = 2*tan(x/2)/(1-tan(x/2)^2) */
|
|
|
|
acb_poly_scalar_mul_2exp_si(c, a, -1);
|
|
|
|
acb_poly_tan_series(c, c, n, rbits2);
|
|
|
|
acb_poly_mullow(d, c, c, n, rbits2);
|
|
|
|
acb_poly_one(e);
|
|
|
|
acb_poly_sub(e, e, d, rbits2);
|
|
|
|
acb_poly_div_series(c, c, e, n, rbits2);
|
|
|
|
acb_poly_scalar_mul_2exp_si(c, c, 1);
|
|
|
|
|
|
|
|
if (!acb_poly_overlaps(b, c))
|
|
|
|
{
|
2015-11-06 16:17:27 +00:00
|
|
|
flint_printf("FAIL\n\n");
|
|
|
|
flint_printf("bits2 = %wd\n", rbits2);
|
2014-05-16 14:04:28 +02:00
|
|
|
|
2015-11-06 16:17:27 +00:00
|
|
|
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");
|
2014-05-16 14:04:28 +02:00
|
|
|
|
2017-02-28 16:50:03 +01:00
|
|
|
flint_abort();
|
2014-05-16 14:04:28 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
acb_poly_tan_series(a, a, n, rbits2);
|
|
|
|
if (!acb_poly_equal(a, b))
|
|
|
|
{
|
2015-11-06 16:17:27 +00:00
|
|
|
flint_printf("FAIL (aliasing)\n\n");
|
2017-02-28 16:50:03 +01:00
|
|
|
flint_abort();
|
2014-05-16 14:04:28 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
acb_poly_clear(a);
|
|
|
|
acb_poly_clear(b);
|
|
|
|
acb_poly_clear(c);
|
|
|
|
acb_poly_clear(d);
|
|
|
|
acb_poly_clear(e);
|
|
|
|
}
|
|
|
|
|
|
|
|
flint_randclear(state);
|
|
|
|
flint_cleanup();
|
2015-11-06 16:17:27 +00:00
|
|
|
flint_printf("PASS\n");
|
2014-05-16 14:04:28 +02:00
|
|
|
return EXIT_SUCCESS;
|
|
|
|
}
|
|
|
|
|