_fq_nmod_poly_compose_mod_brent_kung_precomp_preinv, fq_nmod_poly_compose_mod_brent_kung_precomp_preinv
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_compose_mod_brent_kung_precomp_preinv(fq_nmod_struct * res, const fq_nmod_struct * poly1, slong len1, const fq_nmod_mat_t A, const fq_nmod_struct * poly3, slong len3, const fq_nmod_struct * poly3inv, slong len3inv, const fq_nmod_ctx_t ctx)void fq_nmod_poly_compose_mod_brent_kung_precomp_preinv(fq_nmod_poly_t res, const fq_nmod_poly_t poly1, const fq_nmod_mat_t A, const fq_nmod_poly_t poly3, const fq_nmod_poly_t poly3inv, const fq_nmod_ctx_t ctx)Set res to for = poly1 with , using the matrix of powers of computed by fq_nmod_poly_precompute_matrix. This amortises the precomputation over many compositions with the same , as in the iterated Frobenius computations of factorisation.
Generated from the same template as _fq_poly_compose_mod_brent_kung_precomp_preinv, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_compose_mod_brent_kung_precomp_preinv, fq_nmod_poly_compose_mod_brent_kung_precomp_preinv (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_compose_mod_brent_kung_precomp_preinv.html (generated 2026-11-02).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-compose-mod-brent-kung-precomp-preinv,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_compose\_mod\_brent\_kung\_precomp\_preinv, fq\_nmod\_poly\_compose\_mod\_brent\_kung\_precomp\_preinv (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_compose_mod_brent_kung_precomp_preinv.html},
note = {Generated 2026-11-02}
}