FLINT3.7.0-dev

_fq_zech_poly_precompute_matrix, fq_zech_poly_precompute_matrix

Synopsis#include <flint/fq_zech_poly.h>
void _fq_zech_poly_precompute_matrix(fq_zech_mat_t A, const fq_zech_struct * poly1, const fq_zech_struct * poly2, slong len2, const fq_zech_struct * poly2inv, slong len2inv, const fq_zech_ctx_t ctx)
void fq_zech_poly_precompute_matrix(fq_zech_mat_t A, const fq_zech_poly_t poly1, const fq_zech_poly_t poly2, const fq_zech_poly_t poly2inv, const fq_zech_ctx_t ctx)

Set the rows of the matrix AA to the coefficients of the powers gi mod hg^i \bmod h, 0≤i<m0 \le i < m, for gg = poly1 and hh = poly2, as needed by fq_zech_poly_compose_mod_brent_kung_precomp_preinv. AA must have exactly m=⌊deg⁡h⌋+1m = \lfloor \sqrt{\deg h} \rfloor + 1 rows and deg⁡h\deg h columns (otherwise fq_zech_poly_precompute_matrix throws FLINT_ERROR), and poly2inv must be the inverse of the reversal of hh. In the underscore version gg must be reduced and zero-padded to length len2 - 1.

Generated from the same template as _fq_poly_precompute_matrix, whose documentation has the details.

Cite this page

The FLINT team, “_fq_zech_poly_precompute_matrix, fq_zech_poly_precompute_matrix (fq_zech_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_poly/_fq_zech_poly_precompute_matrix.html (generated 2026-11-02).