nfloat_mat_nonsingular_solve_tril, nfloat_mat_nonsingular_solve_triu, nfloat_mat_lu, nfloat_mat_lq
Synopsis
#include <flint/nfloat.h>int nfloat_mat_nonsingular_solve_tril(gr_mat_t X, const gr_mat_t L, const gr_mat_t B, int unit, gr_ctx_t ctx)sourceint nfloat_mat_nonsingular_solve_triu(gr_mat_t X, const gr_mat_t L, const gr_mat_t B, int unit, gr_ctx_t ctx)sourceint nfloat_mat_lu(slong * rank, slong * P, gr_mat_t LU, const gr_mat_t A, int rank_check, gr_ctx_t ctx)sourceTriangular solving, LU factorisation and LQ factorisation, choosing between the classical (Gram–Schmidt for LQ) and the recursive versions of the generic algorithms (gr_mat_nonsingular_solve_tril_classical, gr_mat_lu_recursive, gr_mat_lq_recursive, ...) by precision-dependent cutoffs, so that large problems run on fast matrix multiplication.
Cite this page
The FLINT team, “nfloat_mat_nonsingular_solve_tril, nfloat_mat_nonsingular_solve_triu, nfloat_mat_lu, nfloat_mat_lq (nfloat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nfloat/nfloat_mat_nonsingular_solve_tril.html (generated 2026-10-20).
@misc{flint-doc-nfloat-nfloat-mat-nonsingular-solve-tril,
author = {{The FLINT team}},
title = {{nfloat\_mat\_nonsingular\_solve\_tril, nfloat\_mat\_nonsingular\_solve\_triu, nfloat\_mat\_lu, nfloat\_mat\_lq (nfloat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nfloat/nfloat_mat_nonsingular_solve_tril.html},
note = {Generated 2026-10-20}
}