_fmpz_mat_solve_dixon_den_given_lu
Synopsis
#include <flint/fmpz_mat.h>int _fmpz_mat_solve_dixon_den_given_lu(fmpz_mat_t X, fmpz_t den, const fmpz_mat_t A, const fmpz_mat_t B, const nmod_mat_t LU, const slong * P, ulong p)sourceSolves AX = \mathit{den} \cdot B like fmpz_mat_solve_dixon_den, given a prime p modulo which A is nonsingular and the LU decomposition (LU, P) of A modulo p as produced by nmod_mat_lu. Performs no prime search and no singularity certification. Returns 1 on success.
Cite this page
The FLINT team, “_fmpz_mat_solve_dixon_den_given_lu (fmpz_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mat/_fmpz_mat_solve_dixon_den_given_lu.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-solve-dixon-den-given-lu,
author = {{The FLINT team}},
title = {{\_fmpz\_mat\_solve\_dixon\_den\_given\_lu (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_solve_dixon_den_given_lu.html},
note = {Generated 2026-10-20}
}