_arb_gamma_upper_fmpq_step_bsplit
Synopsis
#include <flint/arb_hypgeom.h>void _arb_gamma_upper_fmpq_step_bsplit(arb_t Gz1, const fmpq_t a, const arb_t z0, const arb_t z1, const arb_t Gz0, const arb_t expmz0, const mag_t abs_tol, slong prec)sourceGiven Gz0 and expmz0 containing and , sets Gz1 to , computed from the Taylor series at by binary splitting with an absolute truncation error at most abs_tol (included in the output). Assumes . This is one step of the bit-burst algorithm.
Cite this page
The FLINT team, “_arb_gamma_upper_fmpq_step_bsplit (arb_hypgeom.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb_hypgeom/_arb_gamma_upper_fmpq_step_bsplit.html (generated 2026-11-02).
@misc{flint-doc-arb-hypgeom-arb-gamma-upper-fmpq-step-bsplit,
author = {{The FLINT team}},
title = {{\_arb\_gamma\_upper\_fmpq\_step\_bsplit (arb\_hypgeom.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arb_hypgeom/_arb_gamma_upper_fmpq_step_bsplit.html},
note = {Generated 2026-11-02}
}