_fmpz_mat_solve_reconstruct_attempt
Synopsis
#include <flint/fmpz_mat.h>int _fmpz_mat_solve_reconstruct_attempt(fmpz_mat_t Z, fmpz_t den, const fmpz_mat_t x, const fmpz_t m, const fmpz_t N, const fmpz_t D, const fmpz_t sden, const fmpz_t Amax, const fmpz_t Bmax, const fmpz_mat_t A, const fmpz_mat_t B, slong step_bits, double step_cost, slong den_margin_bits)sourceTries to obtain a certified solution Z/\mathit{den} of AZ = \mathit{den} \cdot B from the solution x modulo m, using the candidate denominator sden from a probe with a margin of den_margin_bits bits, Amax = n \lVert A \rVert_\infty and Bmax = \lVert B \rVert_\infty. Returns 1 if the result is certified, either by n \lVert A \rVert \lVert Z \rVert + \mathit{den} \lVert B \rVert < m or by an explicit multiplication, and 0 otherwise. See Output-sensitive termination.
Cite this page
The FLINT team, “_fmpz_mat_solve_reconstruct_attempt (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_reconstruct_attempt.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mat-fmpz-mat-solve-reconstruct-attempt,
author = {{The FLINT team}},
title = {{\_fmpz\_mat\_solve\_reconstruct\_attempt (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_reconstruct_attempt.html},
note = {Generated 2026-10-20}
}