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

/*
    Copyright (C) 2014 Ashish Kedia

    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 "test_helpers.h"
#include "nmod.h"
#include "nmod_mat.h"
#include "nmod_poly.h"

TEST_FUNCTION_START(nmod_poly_evaluate_mat_horner, state)
{
    int i, j;

    for (i = 0; i < 1000 * flint_test_multiplier(); i++)
    {
        nmod_poly_t a;
        nmod_mat_t A, B;
        ulong sum, n = n_randtest_not_zero(state);
        slong m, k;

        nmod_poly_init(a, n);
        nmod_poly_randtest(a, state, n_randint(state, 50));

        m = n_randint(state, 20);

        nmod_mat_init(A, m, m, n);
        nmod_mat_init(B, m, m, n);
        nmod_mat_one(A);
        nmod_poly_evaluate_mat_horner(B, a, A);

        sum = 0;
        for (j = 0; j < a->length; j++)
           sum = n_addmod(sum, nmod_poly_get_coeff_ui(a, j), n);

        for(k = 0; k < m; k++)
            nmod_mat_entry(A, k, k) = nmod_mul(nmod_mat_entry(A, k, k), sum, A->mod);

        if (!nmod_mat_equal(A, B))
        {
            flint_printf("FAIL:\n");
            flint_printf("a->length = %wd, n = %wu\n", a->length, a->mod.n);
            flint_printf("sum = %wu\n", sum);
            nmod_poly_print(a), flint_printf("\n");
            nmod_mat_print_pretty(A);
            nmod_mat_print_pretty(B);
            flint_printf("\n\n");
            fflush(stdout);
            flint_abort();
        }

        nmod_poly_clear(a);
        nmod_mat_clear(A);
        nmod_mat_clear(B);
    }

    for (i = 0; i < 1000 * flint_test_multiplier(); i++)
    {
        nmod_poly_t a, b;
        nmod_mat_t A, B, C;
        ulong n = n_randtest_not_zero(state);
        slong m;

        nmod_poly_init(a, n);
        nmod_poly_init(b, n);
        nmod_poly_randtest(a, state, n_randint(state, 50));
        nmod_poly_randtest(b, state, n_randint(state, 50));

        m = n_randint(state, 20);

        nmod_mat_init(A, m, m, n);
        nmod_mat_init(B, m, m, n);
        nmod_mat_init(C, m, m, n);
        nmod_mat_randtest(A, state);

        nmod_poly_evaluate_mat_horner(B, a, A);
        nmod_poly_evaluate_mat_horner(C, b, A);
        nmod_mat_add(C, B, C);

        nmod_poly_add(a, a, b);
        nmod_poly_evaluate_mat_horner(B, a, A);

        if (!nmod_mat_equal(B, C))
        {
            flint_printf("FAIL:\n");
            nmod_mat_print_pretty(A);
            nmod_mat_print_pretty(B);
            nmod_mat_print_pretty(C);
            nmod_poly_print(a), flint_printf("\n\n");
            nmod_poly_print(b), flint_printf("\n\n");
            fflush(stdout);
            flint_abort();
        }

        nmod_poly_clear(a);
        nmod_poly_clear(b);
        nmod_mat_clear(A);
        nmod_mat_clear(B);
        nmod_mat_clear(C);
    }

    TEST_FUNCTION_END(state);
}