_fmpq_poly_compose_series, fmpq_poly_compose_series
Synopsis
#include <flint/fmpq_poly.h>void _fmpq_poly_compose_series(fmpz * res, fmpz_t den, const fmpz * poly1, const fmpz_t den1, slong len1, const fmpz * poly2, const fmpz_t den2, slong len2, slong n)sourcevoid fmpq_poly_compose_series(fmpq_poly_t res, const fmpq_poly_t poly1, const fmpq_poly_t poly2, slong n)sourceCompose with an automatic choice of algorithm: if poly2 has integer coefficients, the composition is computed over \mathbb{Z} with _fmpz_poly_compose_series; otherwise Horner's rule is used for \min(\mathit{len1}, n) < 8, the Brent–Kung algorithm for n < 250 and the Kinoshita–Li algorithm above.
Cite this page
The FLINT team, “_fmpq_poly_compose_series, fmpq_poly_compose_series (fmpq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpq_poly/_fmpq_poly_compose_series.html (generated 2026-10-20).
@misc{flint-doc-fmpq-poly-fmpq-poly-compose-series,
author = {{The FLINT team}},
title = {{\_fmpq\_poly\_compose\_series, fmpq\_poly\_compose\_series (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_compose_series.html},
note = {Generated 2026-10-20}
}