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
|
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2010 Fredrik Johansson
******************************************************************************/
#include "fmpz_mat.h"
#include "fmpz.h"
void
fmpz_mat_randdet(fmpz_mat_t mat, flint_rand_t state, const fmpz_t det)
{
slong i, j, k, n;
int parity;
fmpz * diag;
fmpz_factor_t factor;
n = mat->r;
if (n != mat->c)
{
flint_printf("Exception (fmpz_mat_randdet). Non-square matrix.\n");
abort();
}
if (n < 1)
return;
/* Start with the zero matrix */
fmpz_mat_zero(mat);
if (*det == WORD(0))
return;
fmpz_factor_init(factor);
fmpz_factor(factor, det);
diag = _fmpz_vec_init(n);
for (i = 0; i < n; i++)
fmpz_one(&diag[i]);
/* Form diagonal entries that multiply to the determinant */
for (i = 0; i < factor->num; i++)
{
for (j = 0; j < factor->exp[i]; j++)
{
k = n_randint(state, n);
fmpz_mul(&diag[k], &diag[k], &factor->p[i]);
}
}
/* Reverse signs an even number of times */
for (i = 0; i < 2*n; i++)
{
k = n_randint(state, n);
fmpz_neg(&diag[k], &diag[k]);
}
if (factor->sign == -1)
fmpz_neg(&diag[0], &diag[0]);
parity = fmpz_mat_randpermdiag(mat, state, diag, n);
/* Need another reversal if the permutation was odd */
if (parity)
{
for (i = 0; i < mat->r; i++)
{
for (j = 0; j < mat->c; j++)
{
if (!fmpz_is_zero(mat->rows[i] + j))
{
fmpz_neg(mat->rows[i] + j, mat->rows[i] + j);
goto end;
}
}
}
}
end:
_fmpz_vec_clear(diag, n);
fmpz_factor_clear(factor);
}
|
