FLINT3.7.0-dev
/

_fq_nmod_mpoly_monomial_evals_cache, _fq_nmod_mpoly_monomial_evals2_cache, n_fq_bpoly_eval_step_sep, n_fq_polyun_zip_start, n_fq_polyu2n_add_zip_must_match, n_fq_polyun_zip_solve

Synopsis#include <flint/fq_nmod_mpoly.h>
void _fq_nmod_mpoly_monomial_evals_cache(n_fq_poly_t E, const ulong * Aexps, flint_bitcnt_t Abits, slong Alen, const fq_nmod_struct * betas, slong start, slong stop, const fq_nmod_mpoly_ctx_t ctx)source
void _fq_nmod_mpoly_monomial_evals2_cache(n_fq_polyun_t E, const ulong * Aexps, flint_bitcnt_t Abits, slong Alen, const fq_nmod_struct * betas, slong m, const fq_nmod_mpoly_ctx_t ctx)source
void n_fq_bpoly_eval_step_sep(n_fq_bpoly_t E, n_fq_polyun_t cur, const n_fq_polyun_t inc, const fq_nmod_mpoly_t A, const fq_nmod_ctx_t ctx)source
void n_fq_polyun_zip_start(n_fq_polyun_t Z, n_fq_polyun_t H, slong req_images, const fq_nmod_ctx_t ctx)source
int n_fq_polyu2n_add_zip_must_match(n_fq_polyun_t Z, const n_fq_bpoly_t A, slong cur_length, const fq_nmod_ctx_t ctx)source
int n_fq_polyun_zip_solve(fq_nmod_mpoly_t A, n_fq_polyun_t Z, n_fq_polyun_t H, n_fq_polyun_t M, const fq_nmod_mpoly_ctx_t ctx)source

Sparse interpolation helpers, as for nmod_mpoly: monomial evaluations at powers of the evaluation points, the next bivariate image from the current and incremental monomial values, and collection and solution of the Vandermonde systems.

Cite this page

The FLINT team, “_fq_nmod_mpoly_monomial_evals_cache, _fq_nmod_mpoly_monomial_evals2_cache, n_fq_bpoly_eval_step_sep, n_fq_polyun_zip_start, n_fq_polyu2n_add_zip_must_match, n_fq_polyun_zip_solve (fq_nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mpoly/_fq_nmod_mpoly_monomial_evals_cache.html (generated 2026-10-20).