mirror of
https://github.com/vale981/arb
synced 2025-03-05 17:31:38 -05:00
95 lines
3.1 KiB
C
95 lines
3.1 KiB
C
/*
|
|
Copyright (C) 2021 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_hypgeom.h"
|
|
|
|
void
|
|
rising_algorithm(arb_ptr res, const arb_t x, ulong n, ulong m, slong len, slong prec, int alg)
|
|
{
|
|
if (alg == 0)
|
|
arb_hypgeom_rising_ui_jet_powsum(res, x, n, len, prec);
|
|
else if (alg == 1)
|
|
arb_hypgeom_rising_ui_jet_rs(res, x, n, m, len, prec);
|
|
else if (alg == 2)
|
|
arb_hypgeom_rising_ui_jet_bs(res, x, n, len, prec);
|
|
else
|
|
arb_hypgeom_rising_ui_jet(res, x, n, len, prec);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
slong iter;
|
|
flint_rand_t state;
|
|
|
|
flint_printf("rising_ui_jet....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
|
|
{
|
|
arb_t x, xk;
|
|
arb_ptr y, ya, yb, yayb;
|
|
ulong k, n, m1, m2, m3, len;
|
|
slong prec;
|
|
int alg1, alg2, alg3;
|
|
|
|
prec = 2 + n_randint(state, 200);
|
|
len = 1 + n_randint(state, 6);
|
|
k = n_randint(state, 10);
|
|
n = n_randint(state, 50);
|
|
m1 = n_randint(state, 2) ? 0 : 1 + n_randint(state, FLINT_MAX(n + k, 1));
|
|
m2 = n_randint(state, 2) ? 0 : 1 + n_randint(state, FLINT_MAX(k, 1));
|
|
m3 = n_randint(state, 2) ? 0 : 1 + n_randint(state, FLINT_MAX(n, 1));
|
|
alg1 = n_randint(state, 4);
|
|
alg2 = n_randint(state, 4);
|
|
alg3 = n_randint(state, 4);
|
|
|
|
arb_init(x);
|
|
arb_init(xk);
|
|
y = _arb_vec_init(len);
|
|
ya = _arb_vec_init(len);
|
|
yb = _arb_vec_init(len);
|
|
yayb = _arb_vec_init(len);
|
|
|
|
arb_randtest(x, state, prec, 10);
|
|
arb_add_ui(xk, x, k, prec);
|
|
|
|
rising_algorithm(y, x, n + k, m1, len, prec, alg1);
|
|
rising_algorithm(ya, x, k, m2, len, prec, alg2);
|
|
rising_algorithm(yb, xk, n, m3, len, prec, alg3);
|
|
_arb_poly_mullow(yayb, ya, len, yb, len, len, prec);
|
|
|
|
if (!_arb_poly_overlaps(y, len, yayb, len))
|
|
{
|
|
flint_printf("FAIL\n\n");
|
|
flint_printf("len = %wd, k = %wu, n = %wu, m1 = %wu, m2 = %wu, m3 = %wu\n\n", len, k, n, m1, m2, m3);
|
|
flint_printf("x = "); arb_printn(x, 100, 0); flint_printf("\n\n");
|
|
flint_printf("y = "); _arb_vec_printn(y, len, 100, 0); flint_printf("\n\n");
|
|
flint_printf("ya = "); _arb_vec_printn(ya, len, 100, 0); flint_printf("\n\n");
|
|
flint_printf("yb = "); _arb_vec_printn(yb, len, 100, 0); flint_printf("\n\n");
|
|
flint_printf("yayb = "); _arb_vec_printn(yayb, len, 100, 0); flint_printf("\n\n");
|
|
flint_abort();
|
|
}
|
|
|
|
arb_clear(x);
|
|
arb_clear(xk);
|
|
_arb_vec_clear(y, len);
|
|
_arb_vec_clear(ya, len);
|
|
_arb_vec_clear(yb, len);
|
|
_arb_vec_clear(yayb, len);
|
|
}
|
|
|
|
flint_randclear(state);
|
|
flint_cleanup();
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|