mirror of
https://github.com/vale981/arb
synced 2025-03-06 09:51:39 -05:00
98 lines
3.3 KiB
C
98 lines
3.3 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) 2014 Fredrik Johansson
|
|
|
|
******************************************************************************/
|
|
|
|
#include "acb_hypgeom.h"
|
|
|
|
int main()
|
|
{
|
|
long iter;
|
|
flint_rand_t state;
|
|
|
|
printf("pfq_sum_bs....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
for (iter = 0; iter < 10000; iter++)
|
|
{
|
|
acb_ptr a, b;
|
|
acb_t z, s1, s2, t1, t2;
|
|
long i, p, q, n, prec1, prec2;
|
|
|
|
p = n_randint(state, 5);
|
|
q = n_randint(state, 5);
|
|
n = n_randint(state, 300);
|
|
prec1 = 2 + n_randint(state, 500);
|
|
prec2 = 2 + n_randint(state, 500);
|
|
|
|
acb_init(z);
|
|
acb_init(s1);
|
|
acb_init(s2);
|
|
acb_init(t1);
|
|
acb_init(t2);
|
|
|
|
acb_randtest_special(z, state, 1 + n_randint(state, 500), 1 + n_randint(state, 100));
|
|
acb_randtest_special(s1, state, 1 + n_randint(state, 500), 1 + n_randint(state, 100));
|
|
acb_randtest_special(t1, state, 1 + n_randint(state, 500), 1 + n_randint(state, 100));
|
|
acb_randtest_special(s2, state, 1 + n_randint(state, 500), 1 + n_randint(state, 100));
|
|
acb_randtest_special(t2, state, 1 + n_randint(state, 500), 1 + n_randint(state, 100));
|
|
|
|
a = _acb_vec_init(p);
|
|
b = _acb_vec_init(q);
|
|
|
|
for (i = 0; i < p; i++)
|
|
acb_randtest(a + i, state, 1 + n_randint(state, 100), 1 + n_randint(state, 10));
|
|
for (i = 0; i < q; i++)
|
|
acb_randtest(b + i, state, 1 + n_randint(state, 100), 1 + n_randint(state, 10));
|
|
|
|
acb_hypgeom_pfq_sum_forward(s1, t1, a, p, b, q, z, n, prec1);
|
|
acb_hypgeom_pfq_sum_bs(s2, t2, a, p, b, q, z, n, prec2);
|
|
|
|
if (!acb_overlaps(s1, s2) || !acb_overlaps(t1, t2))
|
|
{
|
|
printf("FAIL: overlap\n\n");
|
|
printf("z = "); acb_print(a); printf("\n\n");
|
|
printf("s1 = "); acb_print(s1); printf("\n\n");
|
|
printf("s2 = "); acb_print(s2); printf("\n\n");
|
|
printf("t1 = "); acb_print(t1); printf("\n\n");
|
|
printf("t2 = "); acb_print(t2); printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
_acb_vec_clear(a, p);
|
|
_acb_vec_clear(b, q);
|
|
|
|
acb_clear(z);
|
|
acb_clear(s1);
|
|
acb_clear(s2);
|
|
acb_clear(t1);
|
|
acb_clear(t2);
|
|
}
|
|
|
|
flint_randclear(state);
|
|
flint_cleanup();
|
|
printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|