_gr_poly_evaluate_vec_iter, gr_poly_evaluate_vec_iter, _gr_poly_evaluate_vec_fast_precomp, _gr_poly_evaluate_vec_fast, gr_poly_evaluate_vec_fast
Synopsis
#include <flint/gr_poly.h>int _gr_poly_evaluate_vec_iter(gr_ptr ys, gr_srcptr poly, slong plen, gr_srcptr xs, slong n, gr_ctx_t ctx)sourceint gr_poly_evaluate_vec_iter(gr_vec_t ys, const gr_poly_t poly, const gr_vec_t xs, gr_ctx_t ctx)sourceint _gr_poly_evaluate_vec_fast_precomp(gr_ptr vs, gr_srcptr poly, slong plen, const gr_ptr * tree, slong len, gr_ctx_t ctx)sourceint _gr_poly_evaluate_vec_fast(gr_ptr ys, gr_srcptr poly, slong plen, gr_srcptr xs, slong n, gr_ctx_t ctx)sourceint gr_poly_evaluate_vec_fast(gr_vec_t ys, const gr_poly_t poly, const gr_vec_t xs, gr_ctx_t ctx)sourceSet y_i = f(x_i) for all points. The iter versions evaluate at each point separately with _gr_poly_evaluate (O(n \cdot \mathit{plen}) operations); the fast versions reduce f down the subproduct tree, which requires the divisions by monic tree polynomials. The precomp version takes a tree built with _gr_poly_tree_build. The non-underscore versions resize ys to the length of xs.
Cite this page
The FLINT team, “_gr_poly_evaluate_vec_iter, gr_poly_evaluate_vec_iter, _gr_poly_evaluate_vec_fast_precomp, _gr_poly_evaluate_vec_fast, gr_poly_evaluate_vec_fast (gr_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_poly/_gr_poly_evaluate_vec_iter.html (generated 2026-10-20).
@misc{flint-doc-gr-poly-gr-poly-evaluate-vec-iter,
author = {{The FLINT team}},
title = {{\_gr\_poly\_evaluate\_vec\_iter, gr\_poly\_evaluate\_vec\_iter, \_gr\_poly\_evaluate\_vec\_fast\_precomp, \_gr\_poly\_evaluate\_vec\_fast, gr\_poly\_evaluate\_vec\_fast (gr\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_poly/_gr_poly_evaluate_vec_iter.html},
note = {Generated 2026-10-20}
}