2016-04-26 17:20:05 +02:00
|
|
|
/*
|
2014-05-16 14:04:28 +02:00
|
|
|
Copyright (C) 2013 Fredrik Johansson
|
|
|
|
|
2016-04-26 17:20:05 +02:00
|
|
|
This file is part of Arb.
|
|
|
|
|
|
|
|
Arb is free software: you can redistribute it and/or modify it under
|
|
|
|
the terms of the GNU Lesser General Public License (LGPL) as published
|
|
|
|
by the Free Software Foundation; either version 2.1 of the License, or
|
|
|
|
(at your option) any later version. See <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
2014-05-16 14:04:28 +02:00
|
|
|
|
|
|
|
#include "acb_poly.h"
|
|
|
|
|
|
|
|
void
|
|
|
|
_acb_poly_sqrt_series(acb_ptr g,
|
2015-11-05 17:51:23 +00:00
|
|
|
acb_srcptr h, slong hlen, slong len, slong prec)
|
2014-05-16 14:04:28 +02:00
|
|
|
{
|
|
|
|
hlen = FLINT_MIN(hlen, len);
|
|
|
|
|
2015-01-15 15:28:21 +01:00
|
|
|
while (hlen > 0 && acb_is_zero(h + hlen - 1))
|
|
|
|
hlen--;
|
|
|
|
|
|
|
|
if (hlen <= 1)
|
2014-05-16 14:04:28 +02:00
|
|
|
{
|
|
|
|
acb_sqrt(g, h, prec);
|
|
|
|
_acb_vec_zero(g + 1, len - 1);
|
|
|
|
}
|
|
|
|
else if (len == 2)
|
|
|
|
{
|
|
|
|
acb_sqrt(g, h, prec);
|
|
|
|
acb_div(g + 1, h + 1, h, prec);
|
|
|
|
acb_mul(g + 1, g + 1, g, prec);
|
|
|
|
acb_mul_2exp_si(g + 1, g + 1, -1);
|
|
|
|
}
|
2015-01-15 15:28:21 +01:00
|
|
|
else if (_acb_vec_is_zero(h + 1, hlen - 2))
|
|
|
|
{
|
|
|
|
acb_t t;
|
|
|
|
acb_init(t);
|
|
|
|
arf_set_si_2exp_si(arb_midref(acb_realref(t)), 1, -1);
|
|
|
|
_acb_poly_binomial_pow_acb_series(g, h, hlen, t, len, prec);
|
|
|
|
acb_clear(t);
|
|
|
|
}
|
2014-05-16 14:04:28 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
acb_ptr t;
|
|
|
|
t = _acb_vec_init(len);
|
|
|
|
_acb_poly_rsqrt_series(t, h, hlen, len, prec);
|
|
|
|
_acb_poly_mullow(g, t, len, h, hlen, len, prec);
|
|
|
|
_acb_vec_clear(t, len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2015-11-05 17:51:23 +00:00
|
|
|
acb_poly_sqrt_series(acb_poly_t g, const acb_poly_t h, slong n, slong prec)
|
2014-05-16 14:04:28 +02:00
|
|
|
{
|
|
|
|
if (n == 0)
|
|
|
|
{
|
|
|
|
acb_poly_zero(g);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (g == h)
|
|
|
|
{
|
|
|
|
acb_poly_t t;
|
|
|
|
acb_poly_init(t);
|
|
|
|
acb_poly_sqrt_series(t, h, n, prec);
|
|
|
|
acb_poly_swap(g, t);
|
|
|
|
acb_poly_clear(t);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
acb_poly_fit_length(g, n);
|
|
|
|
if (h->length == 0)
|
|
|
|
_acb_vec_indeterminate(g->coeffs, n);
|
|
|
|
else
|
|
|
|
_acb_poly_sqrt_series(g->coeffs, h->coeffs, h->length, n, prec);
|
|
|
|
_acb_poly_set_length(g, n);
|
|
|
|
_acb_poly_normalise(g);
|
|
|
|
}
|
|
|
|
|