FLINT3.7.0-dev
/

_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)source
void qqbar_evaluate_fmpq_poly(qqbar_t res, const fmpq_poly_t poly, const qqbar_t x)source
void _qqbar_evaluate_fmpz_poly(qqbar_t res, const fmpz * poly, slong len, const qqbar_t x)source
void qqbar_evaluate_fmpz_poly(qqbar_t res, const fmpz_poly_t poly, const qqbar_t x)source

Sets res to f(x)f(x) for the polynomial ff 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)f(x) is the minimal polynomial of the matrix of multiplication by f(x)f(x) in Q(x)\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-11-02).