_fmpz_mod_poly_evaluate_fmpz_vec_fast, fmpz_mod_poly_evaluate_fmpz_vec_fast, _fmpz_mod_poly_evaluate_fmpz_vec_fast_precomp
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_evaluate_fmpz_vec_fast(fmpz * ys, const fmpz * poly, slong plen, const fmpz * xs, slong n, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_evaluate_fmpz_vec_fast(fmpz * ys, const fmpz_mod_poly_t poly, const fmpz * xs, slong n, const fmpz_mod_ctx_t ctx)sourcevoid _fmpz_mod_poly_evaluate_fmpz_vec_fast_precomp(fmpz * vs, const fmpz * poly, slong plen, fmpz_poly_struct * const * tree, slong len, const fmpz_mod_ctx_t ctx)sourceEvaluate the polynomial at the reduced points by fast multipoint evaluation: the remainders modulo the products in a subproduct tree of the points are computed from the root to the leaves, in O(M(n) \log n) operations (Multipoint evaluation and interpolation). The _precomp version takes the tree built by _fmpz_mod_poly_tree_build for len points.
Cite this page
The FLINT team, “_fmpz_mod_poly_evaluate_fmpz_vec_fast, fmpz_mod_poly_evaluate_fmpz_vec_fast, _fmpz_mod_poly_evaluate_fmpz_vec_fast_precomp (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_evaluate_fmpz_vec_fast.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-evaluate-fmpz-vec-fast,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_evaluate\_fmpz\_vec\_fast, fmpz\_mod\_poly\_evaluate\_fmpz\_vec\_fast, \_fmpz\_mod\_poly\_evaluate\_fmpz\_vec\_fast\_precomp (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_evaluate_fmpz_vec_fast.html},
note = {Generated 2026-10-20}
}