void
arb_rising_fmpq_ui(arb_t y, const fmpq_t x, ulong n, long prec)
{
if (n == 0)
{
arb_one(y);
}
else if (n == 1)
{
arb_set_fmpq(y, x, prec);
}
else
{
long wp;
wp = ARF_PREC_ADD(prec, FLINT_BIT_COUNT(n));
bsplit(y, fmpq_numref(x), fmpq_denref(x), 0, n, wp);
if (fmpz_is_one(fmpq_denref(x)))
{
arb_set_round(y, y, prec);
}
else
{
arb_t t;
arb_init(t);
arb_set_fmpz(t, fmpq_denref(x));
arb_pow_ui(t, t, n, wp);
arb_div(y, y, t, prec);
arb_clear(t);
}
}
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("root_ui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c;
ulong k;
slong prec;
prec = 2 + n_randint(state, 2000);
k = n_randtest_not_zero(state);
arb_init(a);
arb_init(b);
arb_init(c);
arb_randtest(a, state, 1 + n_randint(state, 2000), 1 + n_randint(state, 100));
arb_randtest(b, state, 1 + n_randint(state, 2000), 1 + n_randint(state, 100));
arb_root_ui(b, a, k, prec);
arb_pow_ui(c, b, k, prec);
if (!arb_contains(c, a))
{
flint_printf("FAIL: containment\n\n");
flint_printf("k = %wu\n", k);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
arb_root_ui(a, a, k, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
/*
Bound for scaled Bessel function: 2/(2 pi x)^(1/2)
Bound for tail of integral: 2 N (k / (pi N))^(k / 2) / (k - 2).
*/
void
scaled_bessel_tail_bound(arb_t b, ulong k, const arb_t N, slong prec)
{
arb_const_pi(b, prec);
arb_mul(b, b, N, prec);
arb_ui_div(b, k, b, prec);
arb_sqrt(b, b, prec);
arb_pow_ui(b, b, k, prec);
arb_mul(b, b, N, prec);
arb_mul_ui(b, b, 2, prec);
arb_div_ui(b, b, k - 2, prec);
}
void
arb_mat_pow_ui(arb_mat_t B, const arb_mat_t A, ulong exp, slong prec)
{
slong d = arb_mat_nrows(A);
if (exp <= 2 || d <= 1)
{
if (exp == 0 || d == 0)
{
arb_mat_one(B);
}
else if (d == 1)
{
arb_pow_ui(arb_mat_entry(B, 0, 0),
arb_mat_entry(A, 0, 0), exp, prec);
}
else if (exp == 1)
{
arb_mat_set(B, A);
}
else if (exp == 2)
{
arb_mat_sqr(B, A, prec);
}
}
else
{
arb_mat_t T, U;
slong i;
arb_mat_init(T, d, d);
arb_mat_set(T, A);
arb_mat_init(U, d, d);
for (i = ((slong) FLINT_BIT_COUNT(exp)) - 2; i >= 0; i--)
{
arb_mat_sqr(U, T, prec);
if (exp & (WORD(1) << i))
arb_mat_mul(T, U, A, prec);
else
arb_mat_swap(T, U);
}
arb_mat_swap(B, T);
arb_mat_clear(T);
arb_mat_clear(U);
}
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("power_sum_vec....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arb_t a, b, s, t;
arb_ptr res;
slong aa, bb, k, n, len;
slong prec;
len = n_randint(state, 30);
prec = 2 + n_randint(state, 500);
aa = n_randint(state, 50) - 50;
bb = aa + n_randint(state, 50);
arb_init(a);
arb_init(b);
arb_init(s);
arb_init(t);
res = _arb_vec_init(len);
arb_set_si(a, aa);
arb_set_si(b, bb);
arb_power_sum_vec(res, a, b, len, prec);
for (n = 0; n < len; n++)
{
arb_zero(s);
for (k = aa; k < bb; k++)
{
arb_set_si(t, k);
arb_pow_ui(t, t, n, prec);
arb_add(s, s, t, prec);
}
if (!arb_overlaps(res + n, s))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = %wd, b = %wd, n = %wd\n\n", aa, bb, n);
flint_printf("res = "); arb_printd(res + n, 30); flint_printf("\n\n");
flint_printf("s = "); arb_printd(s, 30); flint_printf("\n\n");
abort();
}
}
arb_clear(a);
arb_clear(b);
arb_clear(s);
arb_clear(t);
_arb_vec_clear(res, len);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
void
_arb_poly_pow_ui_trunc_binexp(arb_ptr res,
arb_srcptr f, slong flen, ulong exp, slong len, slong prec)
{
arb_ptr v, R, S, T;
slong rlen;
ulong bit;
if (exp <= 1)
{
if (exp == 0)
arb_one(res);
else if (exp == 1)
_arb_vec_set_round(res, f, len, prec);
return;
}
/* (f * x^r)^m = x^(rm) * f^m */
while (flen > 1 && arb_is_zero(f))
{
if (((ulong) len) > exp)
{
_arb_vec_zero(res, exp);
len -= exp;
res += exp;
}
else
{
_arb_vec_zero(res, len);
return;
}
f++;
flen--;
}
if (exp == 2)
{
_arb_poly_mullow(res, f, flen, f, flen, len, prec);
return;
}
if (flen == 1)
{
arb_pow_ui(res, f, exp, prec);
return;
}
v = _arb_vec_init(len);
bit = UWORD(1) << (FLINT_BIT_COUNT(exp) - 2);
if (n_zerobits(exp) % 2)
{
R = res;
S = v;
}
else
{
R = v;
S = res;
}
MUL(R, rlen, f, flen, f, flen, len, prec);
if (bit & exp)
{
MUL(S, rlen, R, rlen, f, flen, len, prec);
T = R;
R = S;
S = T;
}
while (bit >>= 1)
{
if (bit & exp)
{
MUL(S, rlen, R, rlen, R, rlen, len, prec);
MUL(R, rlen, S, rlen, f, flen, len, prec);
}
else
{
MUL(S, rlen, R, rlen, R, rlen, len, prec);
T = R;
R = S;
S = T;
}
}
_arb_vec_clear(v, len);
}
int main()
{
long iter;
flint_rand_t state;
printf("eta....");
fflush(stdout);
flint_randinit(state);
/* Test functional equation */
for (iter = 0; iter < 10000; iter++)
{
acb_t tau1, tau2, z1, z2, z3, t;
fmpq_t arg;
long e0, prec0, prec1, prec2;
psl2z_t g;
psl2z_init(g);
fmpq_init(arg);
acb_init(tau1);
acb_init(tau2);
acb_init(z1);
acb_init(z2);
acb_init(z3);
acb_init(t);
e0 = 1 + n_randint(state, 200);
prec0 = 2 + n_randint(state, 2000);
prec1 = 2 + n_randint(state, 2000);
prec2 = 2 + n_randint(state, 2000);
acb_randtest(tau1, state, prec0, e0);
acb_randtest(tau2, state, prec0, e0);
acb_randtest(z1, state, prec0, e0);
acb_randtest(z2, state, prec0, e0);
psl2z_randtest(g, state, 1 + n_randint(state, 200));
acb_modular_transform(tau2, g, tau1, prec0);
acb_modular_eta(z1, tau1, prec1);
acb_modular_eta(z2, tau2, prec2);
/* apply transformation */
fmpq_set_si(arg, acb_modular_epsilon_arg(g), 12);
arb_sin_cos_pi_fmpq(acb_imagref(t), acb_realref(t), arg, prec1);
acb_mul(z3, z1, t, prec1);
acb_mul_fmpz(t, tau1, &g->c, prec1);
acb_add_fmpz(t, t, &g->d, prec1);
acb_sqrt(t, t, prec1);
acb_mul(z3, z3, t, prec1);
if (!acb_overlaps(z3, z2))
{
printf("FAIL (overlap)\n");
printf("tau1 = "); acb_printd(tau1, 15); printf("\n\n");
printf("tau2 = "); acb_printd(tau2, 15); printf("\n\n");
printf("g = "); psl2z_print(g); printf("\n\n");
printf("z1 = "); acb_printd(z1, 15); printf("\n\n");
printf("z2 = "); acb_printd(z2, 15); printf("\n\n");
printf("z3 = "); acb_printd(z3, 15); printf("\n\n");
abort();
}
acb_modular_eta(tau1, tau1, prec2);
if (!acb_overlaps(z1, tau1))
{
printf("FAIL (aliasing)\n");
printf("tau1 = "); acb_print(tau1); printf("\n\n");
printf("tau2 = "); acb_print(tau2); printf("\n\n");
printf("z1 = "); acb_print(z1); printf("\n\n");
printf("z2 = "); acb_print(z2); printf("\n\n");
abort();
}
acb_clear(tau1);
acb_clear(tau2);
acb_clear(z1);
acb_clear(z2);
acb_clear(z3);
acb_clear(t);
psl2z_clear(g);
fmpq_clear(arg);
}
/* Test special values */
for (iter = 0; iter < 100; iter++)
{
acb_t tau, z;
arb_t t, u;
long prec;
acb_init(tau);
acb_init(z);
arb_init(t);
arb_init(u);
prec = 2 + n_randint(state, 2000);
acb_randtest(z, state, prec, 10);
acb_onei(tau);
acb_modular_eta(z, tau, prec);
arb_one(t);
arb_mul_2exp_si(t, t, -2);
arb_gamma(t, t, prec);
arb_const_pi(u, prec);
arb_root(u, u, 4, prec);
arb_pow_ui(u, u, 3, prec);
arb_div(t, t, u, prec);
arb_mul_2exp_si(t, t, -1);
if (!arb_overlaps(acb_realref(z), t) ||
!arb_contains_zero(acb_imagref(z)))
{
printf("FAIL (value 1)\n");
printf("tau = "); acb_print(tau); printf("\n\n");
printf("z = "); acb_print(z); printf("\n\n");
abort();
}
acb_clear(tau);
acb_clear(z);
arb_clear(t);
arb_clear(u);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
void Lib_Arb_Pow_Ui ( ArbPtr f, ArbPtr g, int32_t e, int32_t prec)
{
arb_pow_ui( (arb_ptr) f, (arb_ptr) g, e, prec);
}
void
bernoulli_rev_init(bernoulli_rev_t iter, ulong nmax)
{
long j;
fmpz_t t;
arb_t x;
arf_t u;
int round1, round2;
long wp;
nmax -= (nmax % 2);
iter->n = nmax;
iter->alloc = 0;
if (nmax < BERNOULLI_REV_MIN)
return;
iter->prec = wp = bernoulli_global_prec(nmax);
iter->max_power = bernoulli_zeta_terms(nmax, iter->prec);
iter->alloc = iter->max_power + 1;
iter->powers = _fmpz_vec_init(iter->alloc);
fmpz_init(iter->pow_error);
arb_init(iter->prefactor);
arb_init(iter->two_pi_squared);
arb_init(x);
fmpz_init(t);
arf_init(u);
/* precompute powers */
for (j = 3; j <= iter->max_power; j += 2)
{
arb_ui_pow_ui(x, j, nmax, bernoulli_power_prec(j, nmax, wp));
arb_inv(x, x, bernoulli_power_prec(j, nmax, wp));
round1 = arf_get_fmpz_fixed_si(t, arb_midref(x), -wp);
fmpz_set(iter->powers + j, t);
/* error: the radius, plus two roundings */
arf_set_mag(u, arb_radref(x));
round2 = arf_get_fmpz_fixed_si(t, u, -wp);
fmpz_add_ui(t, t, (round1 != 0) + (round2 != 0));
if (fmpz_cmp(iter->pow_error, t) < 0)
fmpz_set(iter->pow_error, t);
}
/* precompute (2pi)^2 and 2*(n!)/(2pi)^n */
arb_fac_ui(iter->prefactor, nmax, wp);
arb_mul_2exp_si(iter->prefactor, iter->prefactor, 1);
arb_const_pi(x, wp);
arb_mul_2exp_si(x, x, 1);
arb_mul(iter->two_pi_squared, x, x, wp);
arb_pow_ui(x, iter->two_pi_squared, nmax / 2, wp);
arb_div(iter->prefactor, iter->prefactor, x, wp);
fmpz_clear(t);
arb_clear(x);
arf_clear(u);
}
void
_acb_poly_zeta_em_bound(arb_ptr bound, const acb_t s, const acb_t a, ulong N, ulong M, slong len, slong wp)
{
arb_t K, C, AN, S2M;
arb_ptr F, R;
slong k;
arb_srcptr alpha = acb_realref(a);
arb_srcptr beta = acb_imagref(a);
arb_srcptr sigma = acb_realref(s);
arb_srcptr tau = acb_imagref(s);
arb_init(AN);
arb_init(S2M);
/* require alpha + N > 1, sigma + 2M > 1 */
arb_add_ui(AN, alpha, N - 1, wp);
arb_add_ui(S2M, sigma, 2*M - 1, wp);
if (!arb_is_positive(AN) || !arb_is_positive(S2M) || N < 1 || M < 1)
{
arb_clear(AN);
arb_clear(S2M);
for (k = 0; k < len; k++)
arb_pos_inf(bound + k);
return;
}
/* alpha + N, sigma + 2M */
arb_add_ui(AN, AN, 1, wp);
arb_add_ui(S2M, S2M, 1, wp);
R = _arb_vec_init(len);
F = _arb_vec_init(len);
arb_init(K);
arb_init(C);
/* bound for power integral */
bound_C(C, AN, beta, wp);
bound_K(K, AN, beta, tau, wp);
bound_I(R, AN, S2M, C, len, wp);
for (k = 0; k < len; k++)
{
arb_mul(R + k, R + k, K, wp);
arb_div_ui(K, K, k + 1, wp);
}
/* bound for rising factorial */
bound_rfac(F, s, 2*M, len, wp);
/* product (TODO: only need upper bound; write a function for this) */
_arb_poly_mullow(bound, F, len, R, len, len, wp);
/* bound for bernoulli polynomials, 4 / (2pi)^(2M) */
arb_const_pi(C, wp);
arb_mul_2exp_si(C, C, 1);
arb_pow_ui(C, C, 2 * M, wp);
arb_ui_div(C, 4, C, wp);
_arb_vec_scalar_mul(bound, bound, len, C, wp);
arb_clear(K);
arb_clear(C);
arb_clear(AN);
arb_clear(S2M);
_arb_vec_clear(R, len);
_arb_vec_clear(F, len);
}
