void
arb_log_fmpz(arb_t z, const fmpz_t x, slong prec)
{
arf_t t;
arf_init(t);
arf_set_fmpz(t, x);
arb_log_arf(z, t, prec);
arf_clear(t);
}
int
arf_mul_fmpz_naive(arf_t z, const arf_t x, const fmpz_t y, slong prec, arf_rnd_t rnd)
{
arf_t t;
int r;
arf_init(t);
arf_set_fmpz(t, y);
r = arf_mul(z, x, t, prec, rnd);
arf_clear(t);
return r;
}
int
arb_contains_fmpz(const arb_t x, const fmpz_t y)
{
int ans;
arf_t t;
arf_init(t);
arf_set_fmpz(t, y);
ans = arb_contains_arf(x, t);
arf_clear(t);
return ans;
}
void
arb_addmul_fmpz(arb_t z, const arb_t x, const fmpz_t y, slong prec)
{
arf_t t;
if (!COEFF_IS_MPZ(*y))
{
arf_init_set_si(t, *y); /* no need to free */
arb_addmul_arf(z, x, t, prec);
}
else
{
arf_init(t);
arf_set_fmpz(t, y);
arb_addmul_arf(z, x, t, prec);
arf_clear(t);
}
}
int
arf_sub_fmpz(arf_ptr z, arf_srcptr x, const fmpz_t y, slong prec, arf_rnd_t rnd)
{
mp_size_t xn, yn;
mp_srcptr xptr, yptr;
mp_limb_t ytmp;
int xsgnbit, ysgnbit;
fmpz yexp;
slong shift;
if (fmpz_is_zero(y))
{
return arf_set_round(z, x, prec, rnd);
}
else if (arf_is_special(x))
{
if (arf_is_zero(x))
{
arf_set_fmpz(z, y);
return arf_neg_round(z, z, prec, rnd);
}
else
{
arf_set(z, x);
return 0;
}
}
FMPZ_GET_MPN_READONLY(ysgnbit, yn, yptr, ytmp, *y)
yexp = yn * FLINT_BITS;
shift = _fmpz_sub_small(ARF_EXPREF(x), &yexp);
ysgnbit ^= 1;
xsgnbit = ARF_SGNBIT(x);
ARF_GET_MPN_READONLY(xptr, xn, x);
if (shift >= 0)
return _arf_add_mpn(z, xptr, xn, xsgnbit, ARF_EXPREF(x),
yptr, yn, ysgnbit, shift, prec, rnd);
else
return _arf_add_mpn(z, yptr, yn, ysgnbit, &yexp,
xptr, xn, xsgnbit, -shift, prec, rnd);
}
void
arf_set_fmpr(arf_t y, const fmpr_t x)
{
if (fmpr_is_special(x))
{
if (fmpr_is_zero(x))
arf_zero(y);
else if (fmpr_is_pos_inf(x))
arf_pos_inf(y);
else if (fmpr_is_neg_inf(x))
arf_neg_inf(y);
else
arf_nan(y);
}
else
{
arf_set_fmpz(y, fmpr_manref(x));
fmpz_add_inline(ARF_EXPREF(y), ARF_EXPREF(y), fmpr_expref(x));
}
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("cmpabs....");
fflush(stdout);
flint_randinit(state);
/* compare with fmpz */
{
arf_t x, y;
fmpz_t X, Y;
arf_init(x);
arf_init(y);
fmpz_init(X);
fmpz_init(Y);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
int cmp1, cmp2;
fmpz_randtest(X, state, 1 + n_randint(state, 1000));
switch (n_randint(state, 8))
{
case 0:
fmpz_neg(Y, X);
break;
case 1:
fmpz_set(Y, X);
break;
default:
fmpz_randtest(Y, state, 1 + n_randint(state, 1000));
}
arf_set_fmpz(x, X);
arf_set_fmpz(y, Y);
cmp1 = arf_cmpabs(x, y);
cmp2 = fmpz_cmpabs(X, Y);
cmp2 = (cmp2 > 0) - (cmp2 < 0);
if (cmp1 != cmp2)
{
flint_printf("FAIL\n\n");
flint_printf("x = "); arf_debug(x); flint_printf("\n\n");
flint_printf("y = "); arf_debug(y); flint_printf("\n\n");
flint_printf("X = "); fmpz_print(X); flint_printf("\n\n");
flint_printf("Y = "); fmpz_print(Y); flint_printf("\n\n");
flint_printf("cmp1 = %d, cmp2 = %d\n\n", cmp1, cmp2);
abort();
}
}
arf_clear(x);
arf_clear(y);
fmpz_clear(X);
fmpz_clear(Y);
}
/* compare with mpfr */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
slong bits;
arf_t x, y;
mpfr_t X, Y;
int cmp1, cmp2;
bits = 2 + n_randint(state, 200);
arf_init(x);
arf_init(y);
mpfr_init2(X, bits);
mpfr_init2(Y, bits);
arf_randtest_special(x, state, bits, 10);
arf_randtest_special(y, state, bits, 10);
arf_get_mpfr(X, x, MPFR_RNDN);
arf_get_mpfr(Y, y, MPFR_RNDN);
mpfr_abs(X, X, MPFR_RNDN);
mpfr_abs(Y, Y, MPFR_RNDN);
cmp1 = arf_cmpabs(x, y);
cmp2 = mpfr_cmp(X, Y);
if (cmp1 != cmp2)
{
flint_printf("FAIL\n\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("cmp1 = %d, cmp2 = %d\n\n", cmp1, cmp2);
abort();
}
arf_clear(x);
arf_clear(y);
mpfr_clear(X);
mpfr_clear(Y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
void
arb_set_fmpz(arb_t x, const fmpz_t y)
{
arf_set_fmpz(arb_midref(x), y);
mag_zero(arb_radref(x));
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("get_abs_lbound_arf....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t x;
arf_t b, b2, b3;
fmpq_t q;
arb_init(x);
arf_init(b);
arf_init(b2);
arf_init(b3);
fmpq_init(q);
arb_randtest(x, state, 1 + n_randint(state, 200), 10);
arb_get_abs_lbound_arf(b, x, 2 + n_randint(state, 200));
arb_get_rand_fmpq(q, state, x, 1 + n_randint(state, 200));
arf_mul_fmpz(b2, b, fmpq_denref(q), ARF_PREC_EXACT, ARF_RND_DOWN);
arf_set_fmpz(b3, fmpq_numref(q));
arf_abs(b3, b3);
if (arf_cmp(b2, b3) > 0)
{
flint_printf("FAIL (abs_lbound):\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("b2 = "); arf_print(b2); flint_printf("\n\n");
flint_printf("b3 = "); arf_print(b3); flint_printf("\n\n");
flint_abort();
}
arb_get_abs_ubound_arf(b, x, 2 + n_randint(state, 200));
arb_get_rand_fmpq(q, state, x, 1 + n_randint(state, 200));
arf_mul_fmpz(b2, b, fmpq_denref(q), ARF_PREC_EXACT, ARF_RND_DOWN);
arf_set_fmpz(b3, fmpq_numref(q));
arf_abs(b3, b3);
if (arf_cmp(b2, b3) < 0)
{
flint_printf("FAIL (abs_ubound):\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("b2 = "); arf_print(b2); flint_printf("\n\n");
flint_printf("b3 = "); arf_print(b3); flint_printf("\n\n");
flint_abort();
}
arb_randtest_special(x, state, 1 + n_randint(state, 200), 1 + n_randint(state, 10));
arb_get_abs_lbound_arf(b, x, 2 + n_randint(state, 200));
arb_get_abs_ubound_arf(b2, x, 2 + n_randint(state, 200));
if (arf_cmp(b, b2) > 0)
{
flint_printf("FAIL:\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("b2 = "); arf_print(b2); flint_printf("\n\n");
flint_abort();
}
arb_clear(x);
fmpq_clear(q);
arf_clear(b);
arf_clear(b2);
arf_clear(b3);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
void
arb_exp_arf_bb(arb_t z, const arf_t x, slong prec, int minus_one)
{
slong k, iter, bits, r, mag, q, wp, N;
slong argred_bits, start_bits;
mp_bitcnt_t Qexp[1];
int inexact;
fmpz_t t, u, T, Q;
arb_t w;
if (arf_is_zero(x))
{
if (minus_one)
arb_zero(z);
else
arb_one(z);
return;
}
if (arf_is_special(x))
{
abort();
}
mag = arf_abs_bound_lt_2exp_si(x);
/* We assume that this function only gets called with something
reasonable as input (huge/tiny input will be handled by
the main exp wrapper). */
if (mag > 200 || mag < -2 * prec - 100)
{
flint_printf("arb_exp_arf_bb: unexpectedly large/small input\n");
abort();
}
if (prec < 100000000)
{
argred_bits = 16;
start_bits = 32;
}
else
{
argred_bits = 32;
start_bits = 64;
}
/* Argument reduction: exp(x) -> exp(x/2^q). This improves efficiency
of the first iteration in the bit-burst algorithm. */
q = FLINT_MAX(0, mag + argred_bits);
/* Determine working precision. */
wp = prec + 10 + 2 * q + 2 * FLINT_BIT_COUNT(prec);
if (minus_one && mag < 0)
wp += (-mag);
fmpz_init(t);
fmpz_init(u);
fmpz_init(Q);
fmpz_init(T);
arb_init(w);
/* Convert x/2^q to a fixed-point number. */
inexact = arf_get_fmpz_fixed_si(t, x, -wp + q);
/* Aliasing of z and x is safe now that only use t. */
/* Start with z = 1. */
arb_one(z);
/* Bit-burst loop. */
for (iter = 0, bits = start_bits; !fmpz_is_zero(t);
iter++, bits *= 2)
{
/* Extract bits. */
r = FLINT_MIN(bits, wp);
fmpz_tdiv_q_2exp(u, t, wp - r);
/* Binary splitting (+1 fixed-point ulp truncation error). */
mag = fmpz_bits(u) - r;
N = bs_num_terms(mag, wp);
_arb_exp_sum_bs_powtab(T, Q, Qexp, u, r, N);
/* T = T / Q (+1 fixed-point ulp error). */
if (*Qexp >= wp)
{
fmpz_tdiv_q_2exp(T, T, *Qexp - wp);
fmpz_tdiv_q(T, T, Q);
}
else
{
fmpz_mul_2exp(T, T, wp - *Qexp);
fmpz_tdiv_q(T, T, Q);
}
/* T = 1 + T */
fmpz_one(Q);
fmpz_mul_2exp(Q, Q, wp);
fmpz_add(T, T, Q);
/* Now T = exp(u) with at most 2 fixed-point ulp error. */
/* Set z = z * T. */
arf_set_fmpz(arb_midref(w), T);
arf_mul_2exp_si(arb_midref(w), arb_midref(w), -wp);
mag_set_ui_2exp_si(arb_radref(w), 2, -wp);
arb_mul(z, z, w, wp);
/* Remove used bits. */
fmpz_mul_2exp(u, u, wp - r);
fmpz_sub(t, t, u);
}
/* We have exp(x + eps) - exp(x) < 2*eps (by assumption that the argument
reduction is large enough). */
if (inexact)
arb_add_error_2exp_si(z, -wp + 1);
fmpz_clear(t);
fmpz_clear(u);
fmpz_clear(Q);
fmpz_clear(T);
arb_clear(w);
/* exp(x) = exp(x/2^q)^(2^q) */
for (k = 0; k < q; k++)
arb_mul(z, z, z, wp);
if (minus_one)
arb_sub_ui(z, z, 1, wp);
arb_set_round(z, z, prec);
}
