arb_calc_refine_root_newton
#include <flint/arb_calc.h>int arb_calc_refine_root_newton(arb_t r, arb_calc_func_t func, void * param, const arb_t start, const arb_t conv_region, const arf_t conv_factor, slong eval_extra_prec, slong prec)sourceRefines the enclosure start of a simple root to a relative accuracy of about prec bits by Newton steps at working precisions that roughly double from the accuracy of start up to prec (plus a padding of about \log_2 C bits). eval_extra_prec is the number of guard bits needed to evaluate f accurately near the root (for a polynomial with large coefficients of alternating signs evaluated by Horner's rule, about the bit size of the coefficients). Returns ARB_CALC_SUCCESS if every step succeeded; this does not guarantee prec accurate bits, only an improved enclosure. On failure returns ARB_CALC_IMPRECISE_INPUT or ARB_CALC_NO_CONVERGENCE, and r is a valid but possibly less accurate enclosure (possibly start).
The FLINT team, “arb_calc_refine_root_newton (arb_calc.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb_calc/arb_calc_refine_root_newton.html (generated 2026-10-20).
@misc{flint-doc-arb-calc-arb-calc-refine-root-newton,
author = {{The FLINT team}},
title = {{arb\_calc\_refine\_root\_newton (arb\_calc.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arb_calc/arb_calc_refine_root_newton.html},
note = {Generated 2026-10-20}
}