arb/acb/chebyshev_t_ui.c
2015-11-01 06:05:48 +01:00

72 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_t_ui(acb_t y, ulong n, const acb_t x, long prec)
{
int i, r;
if (n <= 1)
{
if (n == 0)
acb_one(y);
else
acb_set_round(y, x, prec);
return;
}
count_trailing_zeros(r, n);
if ((n >> r) == 1)
{
acb_mul(y, x, x, prec);
acb_mul_2exp_si(y, y, 1);
acb_sub_ui(y, y, 1, prec);
r -= 1;
}
else
{
/* we only need one value, so break out final iteration */
acb_t t, u;
acb_init(t);
acb_init(u);
acb_chebyshev_t2_ui(t, u, (n >> (r + 1)) + 1, x, prec);
acb_mul(t, t, u, prec);
acb_mul_2exp_si(t, t, 1);
acb_sub(y, t, x, prec);
acb_clear(t);
acb_clear(u);
}
for (i = 0; i < r; i++)
{
acb_mul(y, y, y, prec);
acb_mul_2exp_si(y, y, 1);
acb_sub_ui(y, y, 1, prec);
}
}