_fmpz_mod_poly_precompute_matrix, fmpz_mod_poly_precompute_matrix
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_precompute_matrix(fmpz_mat_t A, const fmpz * poly1, const fmpz * poly2, slong len2, const fmpz * poly2inv, slong len2inv, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_precompute_matrix(fmpz_mat_t A, const fmpz_mod_poly_t poly1, const fmpz_mod_poly_t poly2, const fmpz_mod_poly_t poly2inv, const fmpz_mod_ctx_t ctx)sourceSet the rows of A to the coefficients of g^i \bmod h for 0 \le i < m, where g = poly1 is reduced modulo h = poly2, poly2inv is the inverse of the reversal of h, and A must have been initialised as an m \times \deg h matrix with m = \lfloor \sqrt{\deg h} \rfloor + 1. This is the precomputation for repeated compositions with the same g and h.
Cite this page
The FLINT team, “_fmpz_mod_poly_precompute_matrix, fmpz_mod_poly_precompute_matrix (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_precompute_matrix.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-precompute-matrix,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_precompute\_matrix, fmpz\_mod\_poly\_precompute\_matrix (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_precompute_matrix.html},
note = {Generated 2026-10-20}
}