fq_nmod_mat_solve_tril, fq_nmod_mat_solve_triu
Synopsis
#include <flint/fq_nmod_mat.h>void fq_nmod_mat_solve_tril(fq_nmod_mat_t X, const fq_nmod_mat_t L, const fq_nmod_mat_t B, int unit, const fq_nmod_ctx_t ctx)void fq_nmod_mat_solve_triu(fq_nmod_mat_t X, const fq_nmod_mat_t U, const fq_nmod_mat_t B, int unit, const fq_nmod_ctx_t ctx)Set X = L^{-1} B, respectively X = U^{-1} B, for a square lower, respectively upper, triangular matrix with nonzero diagonal entries. If unit is nonzero, the diagonal is assumed to consist of ones and is not read. Only the triangular part of the matrix is read. Aliasing of X and B is allowed. Classical substitution is used if B has fewer than 64 rows or columns, and block recursion otherwise.
Generated from the same template as fq_mat_solve_tril, whose documentation has the details.
Cite this page
The FLINT team, “fq_nmod_mat_solve_tril, fq_nmod_mat_solve_triu (fq_nmod_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mat/fq_nmod_mat_solve_tril.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mat-fq-nmod-mat-solve-tril,
author = {{The FLINT team}},
title = {{fq\_nmod\_mat\_solve\_tril, fq\_nmod\_mat\_solve\_triu (fq\_nmod\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_mat/fq_nmod_mat_solve_tril.html},
note = {Generated 2026-10-20}
}