mirror of
https://github.com/vale981/arb
synced 2025-03-06 09:51:39 -05:00
134 lines
4.3 KiB
C
134 lines
4.3 KiB
C
/*
|
|
Copyright (C) 2017 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 "arb_poly.h"
|
|
|
|
int main()
|
|
{
|
|
slong iter;
|
|
flint_rand_t state;
|
|
|
|
flint_printf("lambertw_series....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
|
|
{
|
|
arb_poly_t x1, x2, t, w1, w2;
|
|
slong prec1, prec2, n1, n2, ebits;
|
|
int branch;
|
|
|
|
arb_poly_init(x1);
|
|
arb_poly_init(x2);
|
|
arb_poly_init(t);
|
|
arb_poly_init(w1);
|
|
arb_poly_init(w2);
|
|
|
|
branch = n_randint(state, 2);
|
|
n1 = n_randint(state, 15);
|
|
n2 = n_randint(state, 15);
|
|
|
|
if (n_randint(state, 4) == 0)
|
|
{
|
|
prec1 = 2 + n_randint(state, 3000);
|
|
prec2 = 2 + n_randint(state, 3000);
|
|
ebits = 1 + n_randint(state, 1000);
|
|
}
|
|
else
|
|
{
|
|
prec1 = 2 + n_randint(state, 300);
|
|
prec2 = 2 + n_randint(state, 300);
|
|
ebits = 1 + n_randint(state, 50);
|
|
}
|
|
|
|
arb_poly_randtest(x1, state, 1 + n_randint(state, 10), 1 + n_randint(state, 1000), ebits);
|
|
arb_poly_randtest(x2, state, 1 + n_randint(state, 10), 1 + n_randint(state, 1000), ebits);
|
|
arb_poly_randtest(t, state, 1 + n_randint(state, 10), 1 + n_randint(state, 1000), ebits);
|
|
arb_poly_randtest(w1, state, 1 + n_randint(state, 10), 1 + n_randint(state, 1000), ebits);
|
|
arb_poly_randtest(w2, state, 1 + n_randint(state, 10), 1 + n_randint(state, 1000), ebits);
|
|
|
|
if (n_randint(state, 4) == 0)
|
|
{
|
|
arb_t u;
|
|
arb_init(u);
|
|
arb_const_e(u, 2 * prec1);
|
|
arb_inv(u, u, 2 * prec1);
|
|
arb_poly_set_arb(t, u);
|
|
arb_poly_sub(x1, x1, t, 2 * prec1);
|
|
arb_clear(u);
|
|
}
|
|
|
|
if (n_randint(state, 2))
|
|
{
|
|
arb_poly_set(x2, x1);
|
|
}
|
|
else
|
|
{
|
|
arb_poly_add(x2, x1, t, 2 * prec1);
|
|
arb_poly_sub(x2, x2, t, 2 * prec1);
|
|
}
|
|
|
|
arb_poly_lambertw_series(w1, x1, branch, n1, prec1);
|
|
|
|
if (n_randint(state, 2))
|
|
{
|
|
arb_poly_set(w2, x2);
|
|
arb_poly_lambertw_series(w2, w2, branch, n2, prec1);
|
|
}
|
|
else
|
|
{
|
|
arb_poly_lambertw_series(w2, x2, branch, n2, prec1);
|
|
}
|
|
|
|
arb_poly_truncate(w1, FLINT_MIN(n1, n2));
|
|
arb_poly_truncate(w2, FLINT_MIN(n1, n2));
|
|
|
|
if (!arb_poly_overlaps(w1, w2))
|
|
{
|
|
flint_printf("FAIL: overlap\n\n");
|
|
flint_printf("branch = %d, prec1 = %wd, prec2 = %wd\n\n", branch, prec1, prec2);
|
|
flint_printf("x1 = "); arb_poly_printd(x1, 50); flint_printf("\n\n");
|
|
flint_printf("x2 = "); arb_poly_printd(x2, 50); flint_printf("\n\n");
|
|
flint_printf("w1 = "); arb_poly_printd(w1, 50); flint_printf("\n\n");
|
|
flint_printf("w2 = "); arb_poly_printd(w2, 50); flint_printf("\n\n");
|
|
flint_abort();
|
|
}
|
|
|
|
arb_poly_exp_series(t, w1, FLINT_MIN(n1, n2), prec1);
|
|
arb_poly_mullow(t, t, w1, FLINT_MIN(n1, n2), prec1);
|
|
arb_poly_truncate(x1, FLINT_MIN(n1, n2));
|
|
|
|
if (!arb_poly_contains(t, x1))
|
|
{
|
|
flint_printf("FAIL: functional equation\n\n");
|
|
flint_printf("branch = %d, prec1 = %wd, prec2 = %wd\n\n", branch, prec1, prec2);
|
|
flint_printf("x1 = "); arb_poly_printd(x1, 50); flint_printf("\n\n");
|
|
flint_printf("x2 = "); arb_poly_printd(x2, 50); flint_printf("\n\n");
|
|
flint_printf("w1 = "); arb_poly_printd(w1, 50); flint_printf("\n\n");
|
|
flint_printf("w2 = "); arb_poly_printd(w2, 50); flint_printf("\n\n");
|
|
flint_printf("t = "); arb_poly_printd(t, 50); flint_printf("\n\n");
|
|
flint_abort();
|
|
}
|
|
|
|
arb_poly_clear(x1);
|
|
arb_poly_clear(x2);
|
|
arb_poly_clear(t);
|
|
arb_poly_clear(w1);
|
|
arb_poly_clear(w2);
|
|
}
|
|
|
|
flint_randclear(state);
|
|
flint_cleanup();
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|