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

/*
    Copyright (C) 2024 Fredrik Johansson

    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 "gr.h"
#include "gr_mat.h"
#include "nfloat.h"

int
nfloat_mat_mul_block1(gr_mat_t C, const gr_mat_t A, const gr_mat_t B, gr_ctx_t ctx)
{
    return nfloat_mat_mul_block(C, A, B, 1, ctx);
}

int
nfloat_mat_mul_fixed1(gr_mat_t C, const gr_mat_t A, const gr_mat_t B, gr_ctx_t ctx)
{
    return nfloat_mat_mul_fixed(C, A, B, 1000, ctx);
}


TEST_FUNCTION_START(mat_mul, state)
{
    gr_ctx_t ctx;
    slong prec;
    slong iter;
    gr_ptr tol;

    for (iter = 0; iter < 100 * flint_test_multiplier(); iter++)
    {
        prec = 64;

        nfloat_ctx_init(ctx, prec, 0);

        tol = gr_heap_init(ctx);
        GR_MUST_SUCCEED(gr_one(tol, ctx));
        GR_MUST_SUCCEED(gr_mul_2exp_si(tol, tol, -prec + 2, ctx));

        gr_mat_test_approx_mul_max_norm(
            (gr_method_mat_binary_op) nfloat_mat_mul_fixed1,
            tol, state, 10, 10, ctx);

        gr_heap_clear(tol, ctx);
        gr_ctx_clear(ctx);
    }

    for (iter = 0; iter < 10 * flint_test_multiplier(); iter++)
    {
        if (n_randint(state, 5))
            prec = FLINT_BITS * (1 + n_randint(state, 4));
        else
            prec = FLINT_BITS * (1 + n_randint(state, NFLOAT_MAX_LIMBS));

        nfloat_ctx_init(ctx, prec, 0);

        tol = gr_heap_init(ctx);
        GR_MUST_SUCCEED(gr_one(tol, ctx));
        GR_MUST_SUCCEED(gr_mul_2exp_si(tol, tol, -prec + 2, ctx));

        gr_mat_test_approx_mul_max_norm(
            (gr_method_mat_binary_op) nfloat_mat_mul_block1,
            tol, state, (prec <= 256) ? 10 : 1,
                        (prec <= 256) ? 40 : 20, ctx);

        gr_mat_test_approx_mul_max_norm(
            (gr_method_mat_binary_op) nfloat_mat_mul_fixed1,
            tol, state, (prec <= 256) ? 10 : 1,
                        (prec <= 256) ? 40 : 20, ctx);

        if (n_randint(state, 4) == 0)
            gr_mat_test_approx_mul_max_norm(
                (gr_method_mat_binary_op) nfloat_mat_mul,
                tol, state, 1, 120, ctx);

        gr_heap_clear(tol, ctx);
        gr_ctx_clear(ctx);
    }

    for (iter = 0; iter < 100 * flint_test_multiplier(); iter++)
    {
        if (n_randint(state, 5))
            prec = FLINT_BITS * (1 + n_randint(state, 4));
        else
            prec = FLINT_BITS * (1 + n_randint(state, NFLOAT_MAX_LIMBS));

        nfloat_ctx_init(ctx, prec, 0);

        tol = gr_heap_init(ctx);
        GR_MUST_SUCCEED(gr_one(tol, ctx));
        GR_MUST_SUCCEED(gr_mul_2exp_si(tol, tol, -prec + 6, ctx));

        gr_mat_test_approx_mul_pos_entrywise_accurate(
            (gr_method_mat_binary_op) nfloat_mat_mul_block1,
            tol, state, (prec <= 256) ? 10 : 1,
                        (prec <= 256) ? 40 : 20, ctx);

        gr_mat_test_approx_mul_pos_entrywise_accurate(
            (gr_method_mat_binary_op) nfloat_mat_mul_fixed1,
            tol, state, (prec <= 256) ? 10 : 1,
                        (prec <= 256) ? 40 : 20, ctx);

        if (n_randint(state, 4) == 0)
            gr_mat_test_approx_mul_pos_entrywise_accurate(
                (gr_method_mat_binary_op) nfloat_mat_mul,
                tol, state, 1, 120, ctx);

        gr_heap_clear(tol, ctx);
        gr_ctx_clear(ctx);
    }

    TEST_FUNCTION_END(state);
}