_qqbar_evaluate_fmpq_poly, qqbar_evaluate_fmpq_poly, _qqbar_evaluate_fmpz_poly, qqbar_evaluate_fmpz_poly
Synopsis
#include <flint/qqbar.h>void _qqbar_evaluate_fmpq_poly(qqbar_t res, const fmpz * poly, const fmpz_t den, slong len, const qqbar_t x)sourcevoid qqbar_evaluate_fmpq_poly(qqbar_t res, const fmpq_poly_t poly, const qqbar_t x)sourcevoid qqbar_evaluate_fmpz_poly(qqbar_t res, const fmpz_poly_t poly, const qqbar_t x)sourceSets res to f(x) for the polynomial f given by poly (with denominator den for the underscore fmpq version). The polynomial is first reduced modulo the minimal polynomial of x if its degree is too large; constant and linear polynomials and rational x are handled directly. In general, the minimal polynomial of f(x) is the minimal polynomial of the matrix of multiplication by f(x) in \mathbb{Q}(x), see Arithmetic with algebraic numbers.
Cite this page
The FLINT team, “_qqbar_evaluate_fmpq_poly, qqbar_evaluate_fmpq_poly, _qqbar_evaluate_fmpz_poly, qqbar_evaluate_fmpz_poly (qqbar.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qqbar/_qqbar_evaluate_fmpq_poly.html (generated 2026-10-20).
@misc{flint-doc-qqbar-qqbar-evaluate-fmpq-poly,
author = {{The FLINT team}},
title = {{\_qqbar\_evaluate\_fmpq\_poly, qqbar\_evaluate\_fmpq\_poly, \_qqbar\_evaluate\_fmpz\_poly, qqbar\_evaluate\_fmpz\_poly (qqbar.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qqbar/_qqbar_evaluate_fmpq_poly.html},
note = {Generated 2026-10-20}
}