flint-sys 0.9.0

Bindings to the FLINT C library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122

/*
    Copyright (C) 2010, 2011 Sebastian Pancratz
    Copyright (C) 2013 Mike Hansen

    This file is part of FLINT.

    FLINT 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 3 of the License, or
    (at your option) any later version.  See <https://www.gnu.org/licenses/>.
*/

#ifdef T

#include "templates.h"

#define FQ_POLY_INV_NEWTON_CUTOFF  64

void
_TEMPLATE(T, poly_inv_series_newton) (TEMPLATE(T, struct) * Qinv,
                                      const TEMPLATE(T, struct) * Q, slong n,
                                      const TEMPLATE(T, t) cinv,
                                      const TEMPLATE(T, ctx_t) ctx)
{
    if (n == 1)                 /* {Q,1} x* cinv == 1 mod (x) */
    {
        TEMPLATE(T, set) (Qinv, cinv, ctx);
    }
    else
    {
        const slong alloc = FLINT_MAX(n, 3 * FQ_POLY_INV_NEWTON_CUTOFF);
        slong *a, i, m;
        TEMPLATE(T, struct) * W;

        W = _TEMPLATE(T, vec_init) (alloc, ctx);

        for (i = 1; (WORD(1) << i) < n; i++) ;

        a = (slong *) flint_malloc(i * sizeof(slong));
        a[i = 0] = n;
        while (n >= FQ_POLY_INV_NEWTON_CUTOFF)
            a[++i] = (n = (n + 1) / 2);

        /* Base case */
        {
            TEMPLATE(T, struct) * Qrev = W + 2 * FQ_POLY_INV_NEWTON_CUTOFF;

            _TEMPLATE(T, poly_reverse) (Qrev, Q, n, n, ctx);
            _TEMPLATE(T, vec_zero) (W, 2 * n - 2, ctx);
            TEMPLATE(T, one) (W + (2 * n - 2), ctx);
            _TEMPLATE(T, poly_div) (Qinv, W, 2 * n - 1, Qrev, n,
                                             cinv, ctx);
            _TEMPLATE(T, poly_reverse) (Qinv, Qinv, n, n, ctx);
        }

        for (i--; i >= 0; i--)
        {
            m = n;
            n = a[i];

            _TEMPLATE(T, poly_mullow) (W, Q, n, Qinv, m, n, ctx);
            _TEMPLATE(T, poly_mullow) (Qinv + m, Qinv, m, W + m, n - m, n - m,
                                       ctx);
            _TEMPLATE(T, poly_neg) (Qinv + m, Qinv + m, n - m, ctx);
        }

        _TEMPLATE(T, vec_clear) (W, alloc, ctx);
        flint_free(a);
    }
}

void
TEMPLATE(T, poly_inv_series_newton) (TEMPLATE(T, poly_t) Qinv,
                                     const TEMPLATE(T, poly_t) Q, slong n,
                                     const TEMPLATE(T, ctx_t) ctx)
{
    TEMPLATE(T, t) cinv;
    TEMPLATE(T, struct) * Qcopy;
    int Qalloc;

    if (Q->length >= n)
    {
        Qcopy = Q->coeffs;
        Qalloc = 0;
    }
    else
    {
        Qcopy = _TEMPLATE(T, vec_init) (n, ctx);
        _TEMPLATE(T, vec_set) (Qcopy, Q->coeffs, Q->length, ctx);
        Qalloc = 1;
    }

    TEMPLATE(T, init) (cinv, ctx);
    TEMPLATE(T, inv) (cinv, Q->coeffs, ctx);

    if (Qinv != Q)
    {
        TEMPLATE(T, poly_fit_length) (Qinv, n, ctx);
        _TEMPLATE(T, poly_inv_series_newton) (Qinv->coeffs, Qcopy, n, cinv,
                                              ctx);
    }
    else
    {
        TEMPLATE(T, struct) * t = _TEMPLATE(T, vec_init) (n, ctx);

        _TEMPLATE(T, poly_inv_series_newton) (t, Qcopy, n, cinv, ctx);

        _TEMPLATE(T, vec_clear) (Qinv->coeffs, Qinv->alloc, ctx);
        Qinv->coeffs = t;
        Qinv->alloc = n;
        Qinv->length = n;
    }
    _TEMPLATE(T, poly_set_length) (Qinv, n, ctx);
    _TEMPLATE(T, poly_normalise) (Qinv, ctx);

    if (Qalloc)
        _TEMPLATE(T, vec_clear) (Qcopy, n, ctx);
    TEMPLATE(T, clear) (cinv, ctx);
}


#endif