_fq_nmod_poly_inv_series_newton, _fq_nmod_poly_inv_series
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_inv_series_newton(fq_nmod_struct * Qinv, const fq_nmod_struct * Q, slong n, const fq_nmod_t cinv, const fq_nmod_ctx_t ctx)void _fq_nmod_poly_inv_series(fq_nmod_struct * Qinv, const fq_nmod_struct * Q, slong n, const fq_nmod_t cinv, const fq_nmod_ctx_t ctx)Set (Qinv, n) to the inverse of the power series (Q, n) modulo x^n, given the inverse cinv of the constant term. Requires n > 0 and no aliasing. The basecase algorithm is used for small n and Newton iteration (_gr_poly_inv_series_newton) otherwise; the two functions are the same.
Generated from the same template as _fq_poly_inv_series_newton, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_inv_series_newton, _fq_nmod_poly_inv_series (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_inv_series_newton.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-inv-series-newton,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_inv\_series\_newton, \_fq\_nmod\_poly\_inv\_series (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_inv_series_newton.html},
note = {Generated 2026-10-20}
}