_fmpz_poly_monomial_to_newton, _fmpz_poly_newton_to_monomial
Synopsis
#include <flint/fmpz_poly.h>Convert (poly, n) in place between the monomial basis and the Newton basis 1, (x - r_0), (x - r_0)(x - r_1), \ldots, (x - r_0) \cdots (x - r_{n-2}) for the integers r_i in roots: monomial_to_newton finds the c_i with f = \sum_i c_i \prod_{j < i} (x - r_j) by repeated synthetic division, and newton_to_monomial evaluates such a sum by Horner's rule.
Cite this page
The FLINT team, “_fmpz_poly_monomial_to_newton, _fmpz_poly_newton_to_monomial (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_monomial_to_newton.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-monomial-to-newton,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_monomial\_to\_newton, \_fmpz\_poly\_newton\_to\_monomial (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_monomial_to_newton.html},
note = {Generated 2026-10-20}
}