_fmpq_poly_interpolation_weights, _fmpq_poly_interpolate_fast_precomp, _fmpq_poly_interpolate_fast, fmpq_poly_interpolate_fast
Synopsis
#include <flint/fmpq_poly.h>void _fmpq_poly_interpolate_fast_precomp(fmpz * poly, fmpz_t den, const fmpq * ys, fmpz * const * tree, const fmpz * weights, slong len)sourcevoid _fmpq_poly_interpolate_fast(fmpz * poly, fmpz_t den, const fmpq * xs, const fmpq * ys, slong len)sourcevoid fmpq_poly_interpolate_fast(fmpq_poly_t poly, const fmpq * xs, const fmpq * ys, slong n)sourceFast polynomial interpolation using a subproduct tree assuming the evaluation points x_i are distinct. The precomp version requires a precomputed subproduct tree generated using _fmpz_poly_tree_build_fmpq_vec and precomputed interpolation weights generated using _fmpq_poly_interpolation_weights.
Cite this page
The FLINT team, “_fmpq_poly_interpolation_weights, _fmpq_poly_interpolate_fast_precomp, _fmpq_poly_interpolate_fast, fmpq_poly_interpolate_fast (fmpq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpq_poly/_fmpq_poly_interpolation_weights.html (generated 2026-10-20).
@misc{flint-doc-fmpq-poly-fmpq-poly-interpolation-weights,
author = {{The FLINT team}},
title = {{\_fmpq\_poly\_interpolation\_weights, \_fmpq\_poly\_interpolate\_fast\_precomp, \_fmpq\_poly\_interpolate\_fast, fmpq\_poly\_interpolate\_fast (fmpq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpq_poly/_fmpq_poly_interpolation_weights.html},
note = {Generated 2026-10-20}
}