arb/acb/chebyshev_u2_ui.c
2015-11-05 17:43:36 +00:00

76 lines
2 KiB
C

/*=============================================================================
This file is part of ARB.
ARB is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
ARB is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with ARB; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2014 Fredrik Johansson
******************************************************************************/
#include "acb.h"
void
acb_chebyshev_u2_ui(acb_t a, acb_t b, ulong n, const acb_t x, slong prec)
{
int i;
acb_t t, u;
if (n == 0)
{
acb_one(a);
acb_zero(b);
return;
}
acb_set_round(a, x, prec);
acb_mul_2exp_si(a, a, 1);
acb_one(b);
if (n == 1)
return;
acb_init(t);
acb_init(u);
for (i = FLINT_BIT_COUNT(n) - 2; i >= 0; i--)
{
acb_add(t, a, b, prec);
acb_sub(u, a, b, prec);
if ((n >> i) & 1)
{
acb_submul(b, x, a, prec);
acb_mul(a, a, b, prec);
acb_neg(a, a);
acb_mul_2exp_si(a, a, 1);
acb_mul(b, t, u, prec);
}
else
{
acb_submul(a, x, b, prec);
acb_mul(b, a, b, prec);
acb_mul_2exp_si(b, b, 1);
acb_mul(a, t, u, prec);
}
}
acb_clear(t);
acb_clear(u);
}