_acb_poly_evaluate_vec_fast_precomp, _acb_poly_evaluate_vec_fast, acb_poly_evaluate_vec_fast
Synopsis
#include <flint/acb_poly.h>void _acb_poly_evaluate_vec_fast_precomp(acb_ptr vs, acb_srcptr poly, slong plen, acb_ptr * tree, slong len, slong prec)sourcevoid _acb_poly_evaluate_vec_fast(acb_ptr ys, acb_srcptr poly, slong plen, acb_srcptr xs, slong n, slong prec)sourcevoid acb_poly_evaluate_vec_fast(acb_ptr ys, const acb_poly_t poly, acb_srcptr xs, slong n, slong prec)sourceEvaluate poly at n points by the remainder tree algorithm, given the points or a precomputed subproduct tree. Wrappers of _gr_poly_evaluate_vec_fast_precomp. The remainder tree is numerically unstable: unless the precision grows with the number of points, the radii become large.
Cite this page
The FLINT team, “_acb_poly_evaluate_vec_fast_precomp, _acb_poly_evaluate_vec_fast, acb_poly_evaluate_vec_fast (acb_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_poly/_acb_poly_evaluate_vec_fast_precomp.html (generated 2026-10-20).
@misc{flint-doc-acb-poly-acb-poly-evaluate-vec-fast-precomp,
author = {{The FLINT team}},
title = {{\_acb\_poly\_evaluate\_vec\_fast\_precomp, \_acb\_poly\_evaluate\_vec\_fast, acb\_poly\_evaluate\_vec\_fast (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_evaluate_vec_fast_precomp.html},
note = {Generated 2026-10-20}
}