/*============================================================================= 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 #include #include #include "flint.h" #include "fmpz.h" #include "fmpz_vec.h" #include "fmpz_mat.h" #include "ulong_extras.h" int main(void) { fmpz_mat_t A, B, C, I; fmpz_t den; slong i, j, m, r; FLINT_TEST_INIT(state); flint_printf("inv...."); fflush(stdout); for (i = 0; i < 1000 * flint_test_multiplier(); i++) { m = n_randint(state, 10); fmpz_mat_init(A, m, m); fmpz_mat_init(B, m, m); fmpz_mat_init(C, m, m); fmpz_mat_init(I, m, m); fmpz_init(den); for (j = 0; j < m; j++) fmpz_set_ui(&I->rows[j][j], UWORD(1)); /* Verify that A * A^-1 = I for random matrices */ fmpz_mat_randrank(A, state, m, 1+n_randint(state, 2)*n_randint(state, 100)); /* Dense or sparse? */ if (n_randint(state, 2)) fmpz_mat_randops(A, state, 1+n_randint(state, 1 + m*m)); fmpz_mat_inv(B, den, A); fmpz_mat_mul(C, A, B); _fmpz_vec_scalar_divexact_fmpz(C->entries, C->entries, m*m, den); if (!fmpz_mat_equal(C, I)) { flint_printf("FAIL:\n"); flint_printf("A * A^-1 != I!\n"); flint_printf("A:\n"), fmpz_mat_print_pretty(A), flint_printf("\n"); flint_printf("A^-1:\n"), fmpz_mat_print_pretty(B), flint_printf("\n"); flint_printf("den(A^-1) = "), fmpz_print(den), flint_printf("\n"); flint_printf("A * A^-1:\n"), fmpz_mat_print_pretty(C), flint_printf("\n"); abort(); } /* Test aliasing */ fmpz_mat_set(C, A); fmpz_mat_inv(A, den, A); fmpz_mat_mul(B, A, C); _fmpz_vec_scalar_divexact_fmpz(B->entries, B->entries, m*m, den); if (!fmpz_mat_equal(B, I)) { flint_printf("FAIL:\n"); flint_printf("aliasing failed!\n"); fmpz_mat_print(C); flint_printf("\n"); abort(); } fmpz_mat_clear(A); fmpz_mat_clear(B); fmpz_mat_clear(C); fmpz_mat_clear(I); fmpz_clear(den); } /* Test singular matrices */ /* Test singular systems */ for (i = 0; i < 1000 * flint_test_multiplier(); i++) { m = 1 + n_randint(state, 10); r = n_randint(state, m); fmpz_mat_init(A, m, m); fmpz_mat_init(B, m, m); fmpz_init(den); fmpz_mat_randrank(A, state, r, 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)); fmpz_mat_inv(B, den, A); if (!fmpz_is_zero(den)) { flint_printf("FAIL:\n"); flint_printf("singular system gave nonzero denominator\n"); abort(); } /* Aliasing */ fmpz_mat_inv(A, den, A); if (!fmpz_is_zero(den)) { flint_printf("FAIL:\n"); flint_printf("singular system gave nonzero denominator\n"); abort(); } fmpz_mat_clear(A); fmpz_mat_clear(B); fmpz_clear(den); } FLINT_TEST_CLEANUP(state); flint_printf("PASS\n"); return 0; }