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

/*
    Copyright 2020 Daniel Schultz

    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/>.
*/

#include "ulong_extras.h"
#include "nmod_mpoly.h"
#include "profiler.h"

int iter_list[21] = {0, 300000, 50000, 5000, 1000, 300, 100, 40, 10, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1};

int main(void)
{
    nmod_mpoly_t f, g, h, k;
    timeit_t timer;
    slong iters, j, n;
    nmod_mpoly_ctx_t ctx;
    ulong p = n_nextprime(UWORD(1) << (SMALL_FMPZ_BITCOUNT_MAX), 1);
    const char * vars[] = {"x", "y", "z", "t", "u"};

    nmod_mpoly_ctx_init(ctx, 5, ORD_LEX, p);

    nmod_mpoly_init(f, ctx);
    nmod_mpoly_init(g, ctx);
    nmod_mpoly_init(h, ctx);
    nmod_mpoly_init(k, ctx);

    nmod_mpoly_set_str_pretty(f, "(1+x+y+2*z^2+3*t^3+5*u^5)", vars, ctx);

    printf("Timing sqrt(p^2) where p = (1+x+y+2z^2+3t^3+5u^5)^n\n\n");
    printf("LEX ordering\n\n");

    for (n = 1; n <= 20; n++)
    {
        nmod_mpoly_pow_ui(g, f, 2*n, ctx);

        iters = iter_list[n];

        timeit_start(timer);

        for (j = 0; j < iters; j++)
            nmod_mpoly_sqrt(h, g, ctx);

        timeit_stop(timer);

        flint_printf("n = %wd: %.10lf s\n", n, (((double)timer->wall)/iters)/1000);
    }

    nmod_mpoly_clear(k, ctx);
    nmod_mpoly_clear(h, ctx);
    nmod_mpoly_clear(g, ctx);
    nmod_mpoly_clear(f, ctx);

    nmod_mpoly_ctx_clear(ctx);
    nmod_mpoly_ctx_init(ctx, 5, ORD_DEGREVLEX, p);

    nmod_mpoly_init(f, ctx);
    nmod_mpoly_init(g, ctx);
    nmod_mpoly_init(h, ctx);
    nmod_mpoly_init(k, ctx);

    nmod_mpoly_set_str_pretty(f, "(1+x+y+2*z^2+3*t^3+5*u^5)", vars, ctx);

    printf("Timing sqrt(p^2) where p = (1+x+y+2z^2+3t^3+5u^5)^n\n\n");
    printf("DEGREVLEX ordering:\n\n");

    for (n = 1; n <= 20; n++)
    {
        nmod_mpoly_pow_ui(g, f, 2*n, ctx);

        iters = iter_list[n];

        timeit_start(timer);

        for (j = 0; j < iters; j++)
            nmod_mpoly_sqrt(h, g, ctx);

        timeit_stop(timer);

        flint_printf("n = %wd: %.10lf s\n", n, (((double)timer->wall)/iters)/1000);
    }

    nmod_mpoly_clear(k, ctx);
    nmod_mpoly_clear(h, ctx);
    nmod_mpoly_clear(g, ctx);
    nmod_mpoly_clear(f, ctx);
    nmod_mpoly_ctx_clear(ctx);

    return 0;
}