mirror of
https://github.com/vale981/arb
synced 2025-03-06 09:51:39 -05:00
124 lines
3.7 KiB
C
124 lines
3.7 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 "arith.h"
|
|
#include "acb_poly.h"
|
|
|
|
int main()
|
|
{
|
|
long iter;
|
|
flint_rand_t state;
|
|
|
|
printf("rising2_ui....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
for (iter = 0; iter < 1000; iter++)
|
|
{
|
|
acb_t a, u, v, u2, v2;
|
|
fmpz *f;
|
|
acb_ptr g;
|
|
ulong n;
|
|
long i, prec;
|
|
|
|
acb_init(a);
|
|
acb_init(u);
|
|
acb_init(v);
|
|
acb_init(u2);
|
|
acb_init(v2);
|
|
|
|
acb_randtest(a, state, 1 + n_randint(state, 4000), 10);
|
|
acb_randtest(u, state, 1 + n_randint(state, 4000), 10);
|
|
acb_randtest(v, state, 1 + n_randint(state, 4000), 10);
|
|
n = n_randint(state, 120);
|
|
|
|
f = _fmpz_vec_init(n + 1);
|
|
g = _acb_vec_init(n + 1);
|
|
|
|
prec = 2 + n_randint(state, 4000);
|
|
acb_rising2_ui(u, v, a, n, prec);
|
|
|
|
arith_stirling_number_1u_vec(f, n, n + 1);
|
|
for (i = 0; i <= n; i++)
|
|
acb_set_fmpz(g + i, f + i);
|
|
_acb_poly_evaluate(u2, g, n + 1, a, prec);
|
|
|
|
_acb_poly_derivative(g, g, n + 1, prec);
|
|
_acb_poly_evaluate(v2, g, n, a, prec);
|
|
|
|
if (!acb_overlaps(u, u2) || !acb_overlaps(v, v2))
|
|
{
|
|
printf("FAIL: overlap\n\n");
|
|
printf("n = %lu\n", n);
|
|
printf("a = "); acb_printd(a, 15); printf("\n\n");
|
|
printf("u = "); acb_printd(u, 15); printf("\n\n");
|
|
printf("u2 = "); acb_printd(u2, 15); printf("\n\n");
|
|
printf("v = "); acb_printd(v, 15); printf("\n\n");
|
|
printf("v2 = "); acb_printd(v2, 15); printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
acb_set(u2, a);
|
|
acb_rising2_ui(u2, v, u2, n, prec);
|
|
|
|
if (!acb_equal(u2, u))
|
|
{
|
|
printf("FAIL: aliasing 1\n\n");
|
|
printf("a = "); acb_printd(a, 15); printf("\n\n");
|
|
printf("u = "); acb_printd(u, 15); printf("\n\n");
|
|
printf("u2 = "); acb_printd(u2, 15); printf("\n\n");
|
|
printf("n = %lu\n", n);
|
|
abort();
|
|
}
|
|
|
|
acb_set(v2, a);
|
|
acb_rising2_ui(u, v2, v2, n, prec);
|
|
|
|
if (!acb_equal(v2, v))
|
|
{
|
|
printf("FAIL: aliasing 2\n\n");
|
|
printf("a = "); acb_printd(a, 15); printf("\n\n");
|
|
printf("v = "); acb_printd(v, 15); printf("\n\n");
|
|
printf("v2 = "); acb_printd(v2, 15); printf("\n\n");
|
|
printf("n = %lu\n", n);
|
|
abort();
|
|
}
|
|
|
|
acb_clear(a);
|
|
acb_clear(u);
|
|
acb_clear(v);
|
|
acb_clear(u2);
|
|
acb_clear(v2);
|
|
_fmpz_vec_clear(f, n + 1);
|
|
_acb_vec_clear(g, n + 1);
|
|
}
|
|
|
|
flint_randclear(state);
|
|
flint_cleanup();
|
|
printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|