fmpz_lll_mpf, fmpz_lll_mpf_with_removal
Synopsis
#include <flint/fmpz_lll.h>int fmpz_lll_mpf(fmpz_mat_t B, fmpz_mat_t U, const fmpz_lll_t fl)sourceint fmpz_lll_mpf_with_removal(fmpz_mat_t B, fmpz_mat_t U, const fmpz_t gs_B, const fmpz_lll_t fl)sourceCalls fmpz_lll_mpf2 (respectively the version with removal) with precisions 64, 128, 192, \ldots bits for the first 20 attempts and then doubling the precision, until the result is reduced according to fmpz_lll_is_reduced (respectively fmpz_lll_is_reduced_with_removal). Returns the value of the last call. Since a precision linear in the dimension suffices [NS2009], this terminates.
References#
- [NS2009] P. Q. Nguyen and D. Stehlé, "An LLL algorithm with quadratic complexity", SIAM Journal on Computing 39:3 (2009), 874–903. https://doi.org/10.1137/070705702
Cite this page
The FLINT team, “fmpz_lll_mpf, fmpz_lll_mpf_with_removal (fmpz_lll.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_lll/fmpz_lll_mpf.html (generated 2026-10-20).
@misc{flint-doc-fmpz-lll-fmpz-lll-mpf,
author = {{The FLINT team}},
title = {{fmpz\_lll\_mpf, fmpz\_lll\_mpf\_with\_removal (fmpz\_lll.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_lll/fmpz_lll_mpf.html},
note = {Generated 2026-10-20}
}