_acb_poly_powsum_series_tree_is_faster
Synopsis
#include <flint/acb_poly.h>int _acb_poly_powsum_series_tree_is_faster(const acb_t s, const acb_t a, const acb_t q, slong n, slong len, slong prec, int naive_threaded)sourceReturns nonzero if _acb_poly_powsum_series_tree is predicted to be faster than _acb_poly_powsum_series_naive (or the threaded naive version if naive_threaded is set) for these parameters, using empirical cost models and the guard bit estimate. This selects the algorithm in the Euler–Maclaurin summation of the Hurwitz zeta function and in the direct summation of the polylogarithm for small |z|.
Cite this page
The FLINT team, “_acb_poly_powsum_series_tree_is_faster (acb_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_poly/_acb_poly_powsum_series_tree_is_faster.html (generated 2026-10-20).
@misc{flint-doc-acb-poly-acb-poly-powsum-series-tree-is-faster,
author = {{The FLINT team}},
title = {{\_acb\_poly\_powsum\_series\_tree\_is\_faster (acb\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_poly/_acb_poly_powsum_series_tree_is_faster.html},
note = {Generated 2026-10-20}
}