100 lines
2.7 KiB
C
100 lines
2.7 KiB
C
/*=============================================================================
|
|
|
|
This file is part of FLINT.
|
|
|
|
FLINT 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.
|
|
|
|
FLINT 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 FLINT; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
=============================================================================*/
|
|
/******************************************************************************
|
|
|
|
Copyright (C) 2010 Sebastian Pancratz
|
|
Copyright (C) 2011 Fredrik Johansson
|
|
|
|
******************************************************************************/
|
|
|
|
#include <gmp.h>
|
|
#include "flint.h"
|
|
#include "fmpz.h"
|
|
#include "fmpz_poly.h"
|
|
#include "fmpq_poly.h"
|
|
|
|
void
|
|
_fmpq_poly_revert_series(fmpz * Qinv, fmpz_t den,
|
|
const fmpz * Q, const fmpz_t Qden, slong n)
|
|
{
|
|
_fmpq_poly_revert_series_lagrange_fast(Qinv, den, Q, Qden, n);
|
|
}
|
|
|
|
|
|
void
|
|
fmpq_poly_revert_series(fmpq_poly_t res,
|
|
const fmpq_poly_t poly, slong n)
|
|
{
|
|
fmpz *copy;
|
|
int alloc;
|
|
|
|
if (poly->length < 2 || !fmpz_is_zero(poly->coeffs)
|
|
|| fmpz_is_zero(poly->coeffs + 1))
|
|
{
|
|
flint_printf("Exception (fmpq_poly_revert_series). Input must have \n"
|
|
"zero constant term and nonzero coefficient of x^1.\n");
|
|
abort();
|
|
}
|
|
|
|
if (n < 2)
|
|
{
|
|
fmpq_poly_zero(res);
|
|
return;
|
|
}
|
|
|
|
if (poly->length >= n)
|
|
{
|
|
copy = poly->coeffs;
|
|
alloc = 0;
|
|
}
|
|
else
|
|
{
|
|
slong i;
|
|
copy = (fmpz *) flint_malloc(n * sizeof(fmpz));
|
|
for (i = 0; i < poly->length; i++)
|
|
copy[i] = poly->coeffs[i];
|
|
for ( ; i < n; i++)
|
|
copy[i] = 0;
|
|
alloc = 1;
|
|
}
|
|
|
|
if (res != poly)
|
|
{
|
|
fmpq_poly_fit_length(res, n);
|
|
_fmpq_poly_revert_series(res->coeffs,
|
|
res->den, copy, poly->den, n);
|
|
}
|
|
else
|
|
{
|
|
fmpq_poly_t t;
|
|
fmpq_poly_init2(t, n);
|
|
_fmpq_poly_revert_series(t->coeffs,
|
|
t->den, copy, poly->den, n);
|
|
fmpq_poly_swap(res, t);
|
|
fmpq_poly_clear(t);
|
|
}
|
|
|
|
_fmpq_poly_set_length(res, n);
|
|
_fmpq_poly_normalise(res);
|
|
|
|
if (alloc)
|
|
flint_free(copy);
|
|
}
|