FLINT3.7.0-dev
/

arb_exp_arf_bb

Synopsis#include <flint/arb.h>
void arb_exp_arf_bb(arb_t z, const arf_t x, slong prec, int minus_one)source

Computes exe^x (or ex−1e^x - 1, accurately) by the bit-burst algorithm: xx is split into chunks of doubling length and the series for each chunk is evaluated by binary splitting.

Raises an exception for extremely small or large xx, which must be handled by the caller. The argument is first halved until ∣x∣<2−d|x| < 2^{-d} with d≈16d \approx 16 to speed up convergence, so ∣x∣≈2m|x| \approx 2^m costs m+dm + d squarings at the end.

Cite this page

The FLINT team, “arb_exp_arf_bb (arb.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb/arb_exp_arf_bb.html (generated 2026-11-02).