FLINT3.7.0-dev

nmod_mat_solve_tril_right, nmod_mat_solve_triu_right

Synopsis#include <flint/nmod_mat.h>
void nmod_mat_solve_tril_right(nmod_mat_t X, const nmod_mat_t L, const nmod_mat_t B, int unit)source
void nmod_mat_solve_triu_right(nmod_mat_t X, const nmod_mat_t U, const nmod_mat_t B, int unit)source

Sets X=BL−1X = B L^{-1} for lower triangular LL, respectively X=BU−1X = B U^{-1} for upper triangular UU. Uses substitution if BB has fewer than 64 rows or fewer than 64 columns, and the recursive algorithm otherwise.

Cite this page

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