fmpz_mat_strong_echelon_form_mod
Synopsis
#include <flint/fmpz_mat.h>void fmpz_mat_strong_echelon_form_mod(fmpz_mat_t A, const fmpz_t mod)sourceTransforms A so that A modulo mod is the strong echelon form of the input modulo mod [FieHof2014]. A must have at least as many rows as columns. The entries of the result are reduced into [0, \mathit{mod}).
References#
- [FieHof2014] Fieker C. and Hofmann T.: "Computing in quotients of rings of integers" LMS Journal of Computation and Mathematics, 17(A), 349-365
Cite this page
The FLINT team, “fmpz_mat_strong_echelon_form_mod (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/fmpz_mat_strong_echelon_form_mod.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-strong-echelon-form-mod,
author = {{The FLINT team}},
title = {{fmpz\_mat\_strong\_echelon\_form\_mod (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_strong_echelon_form_mod.html},
note = {Generated 2026-10-20}
}