_fmpz_mat_mul_multi_mod, _fmpz_mat_mul_blas, _fmpz_mat_mul_fft
Synopsis
#include <flint/fmpz_mat.h>void _fmpz_mat_mul_multi_mod(fmpz_mat_t C, const fmpz_mat_t A, const fmpz_mat_t B, int sign, flint_bitcnt_t Cbits)sourceint _fmpz_mat_mul_blas(fmpz_mat_t C, const fmpz_mat_t A, flint_bitcnt_t Abits, const fmpz_mat_t B, flint_bitcnt_t Bbits, int sign, flint_bitcnt_t Cbits)sourcevoid _fmpz_mat_mul_fft(fmpz_mat_t C, const fmpz_mat_t A, slong abits, const fmpz_mat_t B, slong bbits, int sign)sourceVersions of fmpz_mat_mul_multi_mod, fmpz_mat_mul_blas and fmpz_mat_mul_fft that take precomputed size information: |A_{ij}| < 2^{\mathit{Abits}}, |B_{ij}| < 2^{\mathit{Bbits}}, |C_{ij}| < 2^{\mathit{Cbits}}, and sign = 1 if an entry of A or B may be negative, 0 otherwise. The bounds must be correct.
Cite this page
The FLINT team, “_fmpz_mat_mul_multi_mod, _fmpz_mat_mul_blas, _fmpz_mat_mul_fft (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/_fmpz_mat_mul_multi_mod.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-mul-multi-mod,
author = {{The FLINT team}},
title = {{\_fmpz\_mat\_mul\_multi\_mod, \_fmpz\_mat\_mul\_blas, \_fmpz\_mat\_mul\_fft (fmpz\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mat/_fmpz_mat_mul_multi_mod.html},
note = {Generated 2026-10-20}
}