_arb_poly_evaluate_vec_fast_precomp, _arb_poly_evaluate_vec_fast, arb_poly_evaluate_vec_fast
Synopsis
#include <flint/arb_poly.h>void _arb_poly_evaluate_vec_fast_precomp(arb_ptr vs, arb_srcptr poly, slong plen, arb_ptr * tree, slong len, slong prec)sourcevoid _arb_poly_evaluate_vec_fast(arb_ptr ys, arb_srcptr poly, slong plen, arb_srcptr xs, slong n, slong prec)sourcevoid arb_poly_evaluate_vec_fast(arb_ptr ys, const arb_poly_t poly, arb_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, “_arb_poly_evaluate_vec_fast_precomp, _arb_poly_evaluate_vec_fast, arb_poly_evaluate_vec_fast (arb_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb_poly/_arb_poly_evaluate_vec_fast_precomp.html (generated 2026-10-20).
@misc{flint-doc-arb-poly-arb-poly-evaluate-vec-fast-precomp,
author = {{The FLINT team}},
title = {{\_arb\_poly\_evaluate\_vec\_fast\_precomp, \_arb\_poly\_evaluate\_vec\_fast, arb\_poly\_evaluate\_vec\_fast (arb\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arb_poly/_arb_poly_evaluate_vec_fast_precomp.html},
note = {Generated 2026-10-20}
}