int main(void)
{
slong i;
FLINT_TEST_INIT(state);
flint_printf("pow....");
fflush(stdout);
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
fmpz_mat_t A, B, C;
slong i, n;
ulong e;
n = n_randint(state, 10);
e = n_randint(state, 20);
fmpz_mat_init(A, n, n);
fmpz_mat_init(B, n, n);
fmpz_mat_init(C, n, n);
fmpz_mat_randtest(A, state, n_randint(state, 200) + 1);
fmpz_mat_randtest(B, state, n_randint(state, 200) + 1);
/* Make sure noise in the output is ok */
fmpz_mat_randtest(B, state, n_randint(state, 200) + 1);
fmpz_mat_pow(B, A, e);
fmpz_mat_one(C);
for (i = 0; i < e; i++)
fmpz_mat_mul(C, C, A);
if (!fmpz_mat_equal(C, B))
{
flint_printf("FAIL: results not equal\n");
abort();
}
fmpz_mat_pow(A, A, e);
if (!fmpz_mat_equal(A, B))
{
flint_printf("FAIL: aliasing failed\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int main(void)
{
fmpz_mat_t A, B, C, D;
slong i;
FLINT_TEST_INIT(state);
flint_printf("mul....");
fflush(stdout);
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
slong m, n, k;
m = n_randint(state, 50);
n = n_randint(state, 50);
k = n_randint(state, 50);
fmpz_mat_init(A, m, n);
fmpz_mat_init(B, n, k);
fmpz_mat_init(C, m, k);
fmpz_mat_init(D, m, k);
fmpz_mat_randtest(A, state, n_randint(state, 200) + 1);
fmpz_mat_randtest(B, state, n_randint(state, 200) + 1);
/* Make sure noise in the output is ok */
fmpz_mat_randtest(C, state, n_randint(state, 200) + 1);
fmpz_mat_mul(C, A, B);
fmpz_mat_mul_classical_inline(D, A, B);
if (!fmpz_mat_equal(C, D))
{
flint_printf("FAIL: results not equal\n");
abort();
}
fmpz_mat_mul(A, A, B);
if (!fmpz_mat_equal(A, C))
{
flint_printf("FAIL: aliasing failed\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
fmpz_mat_clear(D);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
long m, n, rep;
flint_rand_t state;
printf("add/sub/neg....");
fflush(stdout);
flint_randinit(state);
for (rep = 0; rep < 10000; rep++)
{
fmpz_mat_t A;
fmpz_mat_t B;
fmpz_mat_t C;
m = n_randint(state, 20);
n = n_randint(state, 20);
fmpz_mat_init(A, m, n);
fmpz_mat_init(B, m, n);
fmpz_mat_init(C, m, n);
fmpz_mat_randtest(A, state, 100);
fmpz_mat_randtest(B, state, 100);
fmpz_mat_neg(C, A);
fmpz_mat_add(A, A, B);
fmpz_mat_sub(A, A, B);
fmpz_mat_neg(A, A);
if (!fmpz_mat_equal(A, C))
{
printf("FAIL: matrices not equal!\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
int
main(void)
{
slong m, n, rep;
FLINT_TEST_INIT(state);
flint_printf("add/sub/neg....");
fflush(stdout);
for (rep = 0; rep < 1000 * flint_test_multiplier(); rep++)
{
fmpz_mat_t A;
fmpz_mat_t B;
fmpz_mat_t C;
m = n_randint(state, 20);
n = n_randint(state, 20);
fmpz_mat_init(A, m, n);
fmpz_mat_init(B, m, n);
fmpz_mat_init(C, m, n);
fmpz_mat_randtest(A, state, 100);
fmpz_mat_randtest(B, state, 100);
fmpz_mat_neg(C, A);
fmpz_mat_add(A, A, B);
fmpz_mat_sub(A, A, B);
fmpz_mat_neg(A, A);
if (!fmpz_mat_equal(A, C))
{
flint_printf("FAIL: matrices not equal!\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
int i;
FLINT_TEST_INIT(state);
flint_printf("multi_CRT_ui....");
fflush(stdout);
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
slong bits, prime_bits, rows, cols, num_primes, j;
fmpz_t mod;
fmpz_mat_t A, B, C;
nmod_mat_t Amod[1000];
mp_limb_t primes[1000];
bits = n_randint(state, 500) + 1;
rows = n_randint(state, 10);
cols = n_randint(state, 10);
prime_bits = 1 + n_randint(state, FLINT_BITS - 1);
fmpz_mat_init(A, rows, cols);
fmpz_mat_init(B, rows, cols);
fmpz_mat_init(C, rows, cols);
fmpz_mat_randtest(A, state, bits);
fmpz_init(mod);
num_primes = 0;
primes[0] = n_nextprime(UWORD(1) << prime_bits, 0);
fmpz_set_ui(mod, primes[0]);
/* + 1 for sign */
while (fmpz_bits(mod) <= bits + 1)
{
primes[num_primes + 1] = n_nextprime(primes[num_primes], 0);
fmpz_mul_ui(mod, mod, primes[num_primes + 1]);
num_primes++;
}
num_primes++;
for (j = 0; j < num_primes; j++)
nmod_mat_init(Amod[j], rows, cols, primes[j]);
fmpz_mat_multi_mod_ui(Amod, num_primes, A);
fmpz_mat_multi_CRT_ui(B, Amod, num_primes, 1);
if (!fmpz_mat_equal(B, A))
{
flint_printf("FAIL!\n");
flint_printf("primes: ");
for (j = 0; j < num_primes; j++)
flint_printf("%wu ", primes[j]);
flint_printf("\nA: \n");
fmpz_mat_print_pretty(A);
flint_printf("\nB: \n");
fmpz_mat_print_pretty(B);
flint_printf("\n");
abort();
}
for (j = 0; j < num_primes; j++)
nmod_mat_clear(Amod[j]);
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
fmpz_clear(mod);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
fmpz_mat_t A, X, B, AX;
fmpz_t den;
slong i, m, n, r;
int success;
FLINT_TEST_INIT(state);
flint_printf("solve_cramer....");
fflush(stdout);
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
m = n_randint(state, 4);
n = n_randint(state, 10);
fmpz_mat_init(A, m, m);
fmpz_mat_init(B, m, n);
fmpz_mat_init(X, m, n);
fmpz_mat_init(AX, m, n);
fmpz_init(den);
fmpz_mat_randrank(A, state, m, 1+n_randint(state, 2)*n_randint(state, 100));
fmpz_mat_randtest(B, state, 1+n_randint(state, 2)*n_randint(state, 100));
/* Dense */
if (n_randint(state, 2))
fmpz_mat_randops(A, state, 1+n_randint(state, 1 + m*m));
success = fmpz_mat_solve_cramer(X, den, A, B);
fmpz_mat_mul(AX, A, X);
fmpz_mat_scalar_divexact_fmpz(AX, AX, den);
if (!fmpz_mat_equal(AX, B) || !success)
{
flint_printf("FAIL:\n");
flint_printf("AX != B!\n");
flint_printf("A:\n"), fmpz_mat_print_pretty(A), flint_printf("\n");
flint_printf("B:\n"), fmpz_mat_print_pretty(B), flint_printf("\n");
flint_printf("X:\n"), fmpz_mat_print_pretty(X), flint_printf("\n");
flint_printf("den(X) = "), fmpz_print(den), flint_printf("\n");
flint_printf("AX:\n"), fmpz_mat_print_pretty(AX), flint_printf("\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(X);
fmpz_mat_clear(AX);
fmpz_clear(den);
}
/* Test singular systems */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
m = 1 + n_randint(state, 3);
n = 1 + n_randint(state, 10);
r = n_randint(state, m);
fmpz_mat_init(A, m, m);
fmpz_mat_init(B, m, n);
fmpz_mat_init(X, m, n);
fmpz_mat_init(AX, m, n);
fmpz_init(den);
fmpz_mat_randrank(A, state, r, 1+n_randint(state, 2)*n_randint(state, 100));
fmpz_mat_randtest(B, state, 1+n_randint(state, 2)*n_randint(state, 100));
/* Dense */
if (n_randint(state, 2))
fmpz_mat_randops(A, state, 1+n_randint(state, 1 + m*m));
success = fmpz_mat_solve_cramer(X, den, A, B);
if (!fmpz_is_zero(den) || success)
{
flint_printf("FAIL:\n");
flint_printf("singular system gave nonzero determinant\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(X);
fmpz_mat_clear(AX);
fmpz_clear(den);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
fmpz_mat_t A, X, B, AX, AXm, Bm;
fmpz_t mod;
slong i, m, n, r;
int success;
FLINT_TEST_INIT(state);
flint_printf("solve_dixon....");
fflush(stdout);
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
m = n_randint(state, 20);
n = n_randint(state, 20);
fmpz_mat_init(A, m, m);
fmpz_mat_init(B, m, n);
fmpz_mat_init(Bm, m, n);
fmpz_mat_init(X, m, n);
fmpz_mat_init(AX, m, n);
fmpz_mat_init(AXm, m, n);
fmpz_init(mod);
fmpz_mat_randrank(A, state, m, 1+n_randint(state, 2)*n_randint(state, 100));
fmpz_mat_randtest(B, state, 1+n_randint(state, 2)*n_randint(state, 100));
/* Dense */
if (n_randint(state, 2))
fmpz_mat_randops(A, state, 1+n_randint(state, 1 + m*m));
success = fmpz_mat_solve_dixon(X, mod, A, B);
fmpz_mat_set(AXm, X);
fmpz_mat_mul(AX, A, AXm);
fmpz_mat_scalar_mod_fmpz(AXm, AX, mod);
fmpz_mat_scalar_mod_fmpz(Bm, B, mod);
if (!fmpz_mat_equal(AXm, Bm) || !success)
{
flint_printf("FAIL:\n");
flint_printf("AX != B!\n");
flint_printf("A:\n"), fmpz_mat_print_pretty(A), flint_printf("\n");
flint_printf("B:\n"), fmpz_mat_print_pretty(B), flint_printf("\n");
flint_printf("X:\n"), fmpz_mat_print_pretty(X), flint_printf("\n");
flint_printf("mod = "), fmpz_print(mod), flint_printf("\n");
flint_printf("AX:\n"), fmpz_mat_print_pretty(AX), flint_printf("\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(Bm);
fmpz_mat_clear(X);
fmpz_mat_clear(AX);
fmpz_mat_clear(AXm);
fmpz_clear(mod);
}
/* Test singular systems */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
m = 1 + n_randint(state, 10);
n = 1 + n_randint(state, 10);
r = n_randint(state, m);
fmpz_mat_init(A, m, m);
fmpz_mat_init(B, m, n);
fmpz_mat_init(X, m, n);
fmpz_init(mod);
fmpz_mat_randrank(A, state, r, 1+n_randint(state, 2)*n_randint(state, 100));
fmpz_mat_randtest(B, state, 1+n_randint(state, 2)*n_randint(state, 100));
/* Dense */
if (n_randint(state, 2))
fmpz_mat_randops(A, state, 1+n_randint(state, 1 + m*m));
if (fmpz_mat_solve_dixon(X, mod, A, B) != 0)
{
flint_printf("FAIL:\n");
flint_printf("singular system, returned nonzero\n");
abort();
}
fmpz_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(X);
fmpz_clear(mod);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
slong i;
FLINT_TEST_INIT(state);
flint_printf("add....");
fflush(stdout);
/* Check evaluation homomorphism */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
fmpz_poly_mat_t A, B, C;
fmpz_mat_t a, b, c, d;
fmpz_t x;
slong m, n, bits, deg;
m = n_randint(state, 20);
n = n_randint(state, 20);
deg = 1 + n_randint(state, 10);
bits = 1 + n_randint(state, 100);
fmpz_poly_mat_init(A, m, n);
fmpz_poly_mat_init(B, m, n);
fmpz_poly_mat_init(C, m, n);
fmpz_mat_init(a, m, n);
fmpz_mat_init(b, m, n);
fmpz_mat_init(c, m, n);
fmpz_mat_init(d, m, n);
fmpz_init(x);
fmpz_poly_mat_randtest(A, state, deg, bits);
fmpz_poly_mat_randtest(B, state, deg, bits);
fmpz_poly_mat_add(C, A, B);
fmpz_randtest(x, state, 1 + n_randint(state, 100));
fmpz_poly_mat_evaluate_fmpz(a, A, x);
fmpz_poly_mat_evaluate_fmpz(b, B, x);
fmpz_poly_mat_evaluate_fmpz(d, C, x);
fmpz_mat_add(c, a, b);
if (!fmpz_mat_equal(c, d))
{
flint_printf("FAIL:\n");
flint_printf("A:\n");
fmpz_poly_mat_print(A, "x");
flint_printf("B:\n");
fmpz_poly_mat_print(B, "x");
flint_printf("C:\n");
fmpz_poly_mat_print(C, "x");
flint_printf("\n");
abort();
}
fmpz_poly_mat_clear(A);
fmpz_poly_mat_clear(B);
fmpz_poly_mat_clear(C);
fmpz_mat_clear(a);
fmpz_mat_clear(b);
fmpz_mat_clear(c);
fmpz_mat_clear(d);
fmpz_clear(x);
}
/* Check aliasing C and A */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
fmpz_poly_mat_t A, B, C;
slong m, n, bits, deg;
m = n_randint(state, 20);
n = n_randint(state, 20);
deg = 1 + n_randint(state, 10);
bits = 1 + n_randint(state, 100);
fmpz_poly_mat_init(A, m, n);
fmpz_poly_mat_init(B, m, n);
fmpz_poly_mat_init(C, m, n);
fmpz_poly_mat_randtest(A, state, deg, bits);
fmpz_poly_mat_randtest(B, state, deg, bits);
fmpz_poly_mat_add(C, A, B);
fmpz_poly_mat_add(A, A, B);
if (!fmpz_poly_mat_equal(C, A))
{
flint_printf("FAIL:\n");
flint_printf("A:\n");
fmpz_poly_mat_print(A, "x");
flint_printf("B:\n");
fmpz_poly_mat_print(B, "x");
flint_printf("C:\n");
fmpz_poly_mat_print(C, "x");
flint_printf("\n");
abort();
}
fmpz_poly_mat_clear(A);
fmpz_poly_mat_clear(B);
fmpz_poly_mat_clear(C);
}
/* Check aliasing C and B */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
fmpz_poly_mat_t A, B, C;
slong m, n, bits, deg;
m = n_randint(state, 20);
n = n_randint(state, 20);
deg = 1 + n_randint(state, 10);
bits = 1 + n_randint(state, 100);
fmpz_poly_mat_init(A, m, n);
fmpz_poly_mat_init(B, m, n);
fmpz_poly_mat_init(C, m, n);
fmpz_poly_mat_randtest(A, state, deg, bits);
fmpz_poly_mat_randtest(B, state, deg, bits);
fmpz_poly_mat_add(C, A, B);
fmpz_poly_mat_add(B, A, B);
if (!fmpz_poly_mat_equal(C, B))
{
flint_printf("FAIL:\n");
flint_printf("A:\n");
fmpz_poly_mat_print(A, "x");
flint_printf("B:\n");
fmpz_poly_mat_print(B, "x");
flint_printf("C:\n");
fmpz_poly_mat_print(C, "x");
flint_printf("\n");
abort();
}
fmpz_poly_mat_clear(A);
fmpz_poly_mat_clear(B);
fmpz_poly_mat_clear(C);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("all_pairs_longest_walk....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
slong m, degree;
bool_mat_t A;
fmpz_mat_t B, C, D;
m = n_randint(state, 50);
bool_mat_init(A, m, m);
fmpz_mat_init(B, m, m);
fmpz_mat_init(C, m, m);
fmpz_mat_init(D, m, m);
bool_mat_randtest(A, state);
degree = bool_mat_all_pairs_longest_walk(B, A);
/* entrywise reasonability */
if (!_is_superficially_ok_entrywise(B))
{
flint_printf("FAIL (entrywise)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
abort();
}
/* nilpotency degree */
{
slong nildegree = bool_mat_nilpotency_degree(A);
if (nildegree != degree + 1)
{
flint_printf("FAIL (nilpotency degree)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
flint_printf("nildegree=%wd degree=%wd\n", nildegree, degree);
abort();
}
}
/* transitive closure */
{
slong i, j;
bool_mat_t U, V;
bool_mat_init(U, m, m);
bool_mat_transitive_closure(U, A);
bool_mat_init(V, m, m);
for (i = 0; i < m; i++)
{
for (j = 0; j < m; j++)
{
slong x = fmpz_get_si(fmpz_mat_entry(B, i, j));
bool_mat_set_entry(V, i, j, (x != -1 && x != 0));
}
}
if (!bool_mat_equal(U, V))
{
flint_printf("FAIL (transitive closure)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
bool_mat_print(U); flint_printf("\n");
bool_mat_print(V); flint_printf("\n");
abort();
}
bool_mat_clear(U);
bool_mat_clear(V);
}
/* test commutativity of all-pairs-longest-walk with permutation */
{
bool_mat_t Ap;
slong *perm;
bool_mat_init(Ap, m, m);
perm = flint_malloc(m * sizeof(slong));
_perm_randtest(perm, m, state);
/* C is the all-pairs-longest-walk of the permutation of A */
_bool_mat_permute(Ap, A, perm);
bool_mat_all_pairs_longest_walk(C, Ap);
/* D is the permutation of the all-pairs-longest-walk of A */
_fmpz_mat_permute(D, B, perm);
if (!fmpz_mat_equal(C, D))
{
flint_printf("FAIL (permutation)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
fmpz_mat_print_pretty(C); flint_printf("\n");
fmpz_mat_print_pretty(D); flint_printf("\n");
abort();
}
flint_free(perm);
bool_mat_clear(Ap);
}
bool_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
fmpz_mat_clear(D);
}
/* use powering to check small random examples */
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
slong m;
bool_mat_t A;
fmpz_mat_t B, C;
m = n_randint(state, 10);
bool_mat_init(A, m, m);
fmpz_mat_init(B, m, m);
fmpz_mat_init(C, m, m);
bool_mat_randtest(A, state);
bool_mat_all_pairs_longest_walk(B, A);
_brute_force_all_pairs_longest_walk(C, A);
if (!fmpz_mat_equal(B, C))
{
flint_printf("FAIL (powering)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
fmpz_mat_print_pretty(C); flint_printf("\n");
abort();
}
bool_mat_clear(A);
fmpz_mat_clear(B);
fmpz_mat_clear(C);
}
/* special matrices */
{
slong m;
for (m = 1; m < 100; m++)
{
slong i, j, length;
bool_mat_t A;
fmpz_mat_t B;
bool_mat_init(A, m, m);
fmpz_mat_init(B, m, m);
/* directed path */
{
bool_mat_directed_path(A);
length = bool_mat_all_pairs_longest_walk(B, A);
if (length != m-1)
{
flint_printf("FAIL (directed path)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
flint_printf("m=%wd length=%wd\n", m, length);
abort();
}
for (i = 0; i < m; i++)
{
for (j = 0; j < m; j++)
{
if (fmpz_get_si(fmpz_mat_entry(B, i, j)) !=
FLINT_MAX(-1, j - i))
{
flint_printf("FAIL (directed path)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
abort();
}
}
}
}
/* directed cycle */
{
bool_mat_directed_cycle(A);
length = bool_mat_all_pairs_longest_walk(B, A);
if (length != -2)
{
flint_printf("FAIL (directed cycle)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
flint_printf("m=%wd length=%wd\n", m, length);
abort();
}
for (i = 0; i < m; i++)
{
for (j = 0; j < m; j++)
{
if (fmpz_get_si(fmpz_mat_entry(B, i, j)) != -2)
{
flint_printf("FAIL (directed cycle)\n");
bool_mat_print(A); flint_printf("\n");
fmpz_mat_print_pretty(B); flint_printf("\n");
abort();
}
}
}
}
bool_mat_clear(A);
fmpz_mat_clear(B);
}
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
