54 lines
1.7 KiB
C
54 lines
1.7 KiB
C
/*=============================================================================
|
|
|
|
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) 2011 Fredrik Johansson
|
|
|
|
******************************************************************************/
|
|
|
|
#include "fmpq_mat.h"
|
|
|
|
int
|
|
fmpq_mat_solve_dixon(fmpq_mat_t X, const fmpq_mat_t A, const fmpq_mat_t B)
|
|
{
|
|
fmpz_mat_t Anum;
|
|
fmpz_mat_t Bnum;
|
|
fmpz_mat_t Xnum;
|
|
fmpz_t mod;
|
|
int success;
|
|
|
|
fmpz_mat_init(Anum, A->r, A->c);
|
|
fmpz_mat_init(Bnum, B->r, B->c);
|
|
fmpz_mat_init(Xnum, B->r, B->c);
|
|
fmpz_init(mod);
|
|
|
|
fmpq_mat_get_fmpz_mat_rowwise_2(Anum, Bnum, NULL, A, B);
|
|
success = fmpz_mat_solve_dixon(Xnum, mod, Anum, Bnum);
|
|
if (success)
|
|
success = fmpq_mat_set_fmpz_mat_mod_fmpz(X, Xnum, mod);
|
|
|
|
fmpz_mat_clear(Anum);
|
|
fmpz_mat_clear(Bnum);
|
|
fmpz_mat_clear(Xnum);
|
|
fmpz_clear(mod);
|
|
|
|
return success;
|
|
}
|