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

/*
    Copyright (C) 2010 Fredrik Johansson
    Copyright (C) 2021 William Hart

    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 <string.h>
#include "perm.h"
#include "fmpz.h"
#include "fmpz_mat.h"

static void _fmpz_mat_window_with_perm_init(fmpz_mat_t Ap, slong * perm,
		                               const fmpz_mat_t A, slong start)
{
    slong i, n = A->r;

    fmpz_mat_init(Ap, n, A->c);

    /* shallow copy */
    for (i = 0; i < n - start; i++)
        memcpy(fmpz_mat_row(Ap, i), fmpz_mat_row(A, perm[start + i]), A->c * sizeof(fmpz));

    Ap->r = n - start;
    Ap->c = A->c;
}

static void _fmpz_mat_window_with_perm_clear(fmpz_mat_t Ap)
{
    flint_free(Ap->entries);
}

int
fmpz_mat_can_solve_fflu(fmpz_mat_t X, fmpz_t den,
                    const fmpz_mat_t A, const fmpz_mat_t B)
{
    fmpz_mat_t LU, Ap, Bp, P1, P2;
    slong n, rank, *perm;
    int result;

    if (A->r == 0)
    {
        fmpz_mat_zero(X);
	fmpz_one(den);
        return 1;
    }

    if (A->c == 0)
    {
        fmpz_mat_zero(X);
        result = fmpz_mat_is_zero(B);
	    fmpz_set_ui(den, result);
	    return result;
    }

    n = fmpz_mat_nrows(A);

    perm = _perm_init(n);

    fmpz_mat_init_set(LU, A);
    rank = fmpz_mat_fflu(LU, den, perm, LU, 0);

    result = !fmpz_is_zero(den) && fmpz_mat_solve_fflu_precomp(X, perm, LU, B);

    if (result)
    {
        if (_perm_parity(perm, n))
        {
           fmpz_neg(den, den);

           fmpz_mat_neg(X, X);
        }

        if (rank < n)
	    {
           _fmpz_mat_window_with_perm_init(Ap, perm, A, rank);
           _fmpz_mat_window_with_perm_init(Bp, perm, B, rank);

	       fmpz_mat_init(P1, fmpz_mat_nrows(Ap), fmpz_mat_ncols(X));
           fmpz_mat_init(P2, fmpz_mat_nrows(Bp), fmpz_mat_ncols(Bp));

	       fmpz_mat_mul(P1, Ap, X);
           fmpz_mat_scalar_mul_fmpz(P2, Bp, den);

	       result = fmpz_mat_equal(P1, P2);

           fmpz_mat_clear(P1);
           fmpz_mat_clear(P2);

	       _fmpz_mat_window_with_perm_clear(Ap);
	       _fmpz_mat_window_with_perm_clear(Bp);
        }
    } else
        fmpz_zero(den);

    _perm_clear(perm);
    fmpz_mat_clear(LU);

    return result;
}