From 472b1768c483cd7cea7f0fbaa7c4e463a7a7d08b Mon Sep 17 00:00:00 2001 From: Fredrik Johansson Date: Fri, 23 Jun 2017 15:17:51 +0200 Subject: [PATCH] small doc fixes --- doc/source/arb_fmpz_poly.rst | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/doc/source/arb_fmpz_poly.rst b/doc/source/arb_fmpz_poly.rst index 0fb1355f..f31ff6ee 100644 --- a/doc/source/arb_fmpz_poly.rst +++ b/doc/source/arb_fmpz_poly.rst @@ -77,6 +77,7 @@ Polynomial roots do a squarefree factorization (which also gives the correct multiplicities of the roots):: + fmpz_poly_factor_t fac; fmpz_poly_factor_init(fac); fmpz_poly_factor_squarefree(fac, poly); @@ -93,7 +94,7 @@ Polynomial roots All roots are refined to a relative accuracy of at least *prec* bits. The output values will generally have higher actual precision, - depending on the precision used internally the algorithm. + depending on the precision used internally by the algorithm. This implementation should be adequate for general use, but it is not currently competitive with state-of-the-art isolation