_gr_poly_hgcd_mat_mul, _gr_poly_hgcd_mat_mul_generic
Synopsis
#include <flint/gr_poly.h>int _gr_poly_hgcd_mat_mul(gr_ptr * C, slong * lenC, gr_ptr * A, slong * lenA, gr_ptr * B, slong * lenB, gr_ptr T0, gr_ptr T1, gr_ctx_t ctx)sourceint _gr_poly_hgcd_mat_mul_generic(gr_ptr * C, slong * lenC, gr_ptr * A, slong * lenA, gr_ptr * B, slong * lenB, gr_ptr T0, gr_ptr T1, gr_ctx_t ctx)sourceSet the 2 \times 2 matrix of polynomials C to AB, as needed by the half-gcd algorithm. A, B and C point to 4 polynomials each, in row-major order, with their lengths in lenA, lenB and lenC; the output lengths are normalised. Aliasing is not allowed. T0 and T1 must have room for any product of an entry of A by an entry of B. _gr_poly_hgcd_mat_mul calls the ring method; the default is described with _gr_poly_hgcd.
Cite this page
The FLINT team, “_gr_poly_hgcd_mat_mul, _gr_poly_hgcd_mat_mul_generic (gr_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_poly/_gr_poly_hgcd_mat_mul.html (generated 2026-10-20).
@misc{flint-doc-gr-poly-gr-poly-hgcd-mat-mul,
author = {{The FLINT team}},
title = {{\_gr\_poly\_hgcd\_mat\_mul, \_gr\_poly\_hgcd\_mat\_mul\_generic (gr\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_poly/_gr_poly_hgcd_mat_mul.html},
note = {Generated 2026-10-20}
}