acb_hypgeom_pfq_sum_bs_invz, acb_hypgeom_pfq_sum_invz
Synopsis
#include <flint/acb_hypgeom.h>void acb_hypgeom_pfq_sum_bs_invz(acb_t s, acb_t t, acb_srcptr a, slong p, acb_srcptr b, slong q, const acb_t w, slong n, slong prec)sourcevoid acb_hypgeom_pfq_sum_invz(acb_t s, acb_t t, acb_srcptr a, slong p, acb_srcptr b, slong q, const acb_t z, const acb_t w, slong n, slong prec)sourceLike acb_hypgeom_pfq_sum_bs and acb_hypgeom_pfq_sum, but given w = 1/z (and also z for the second function), which is advantageous when w has few bits, as in asymptotic expansions at an integer or short argument: binary splitting then divides by w instead of multiplying by the long z.
Cite this page
The FLINT team, “acb_hypgeom_pfq_sum_bs_invz, acb_hypgeom_pfq_sum_invz (acb_hypgeom.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_hypgeom/acb_hypgeom_pfq_sum_bs_invz.html (generated 2026-10-20).
@misc{flint-doc-acb-hypgeom-acb-hypgeom-pfq-sum-bs-invz,
author = {{The FLINT team}},
title = {{acb\_hypgeom\_pfq\_sum\_bs\_invz, acb\_hypgeom\_pfq\_sum\_invz (acb\_hypgeom.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_hypgeom/acb_hypgeom_pfq_sum_bs_invz.html},
note = {Generated 2026-10-20}
}