/*=============================================================================

    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

******************************************************************************/


*******************************************************************************

    Memory management

*******************************************************************************

void nmod_poly_mat_init(nmod_poly_mat_t mat, slong rows, slong cols, mp_limb_t n)

    Initialises a matrix with the given number of rows and columns for use.
    The modulus is set to $n$.

void nmod_poly_mat_init_set(nmod_poly_mat_t mat, const nmod_poly_mat_t src)

    Initialises a matrix \code{mat} of the same dimensions and modulus
    as \code{src}, and sets it to a copy of \code{src}.

void nmod_poly_mat_clear(nmod_poly_mat_t mat)

    Frees all memory associated with the matrix. The matrix must be
    reinitialised if it is to be used again.

*******************************************************************************

    Basic properties

*******************************************************************************

slong nmod_poly_mat_nrows(const nmod_poly_mat_t mat)

    Returns the number of rows in \code{mat}.

slong nmod_poly_mat_ncols(const nmod_poly_mat_t mat)

    Returns the number of columns in \code{mat}.

mp_limb_t nmod_poly_mat_modulus(const nmod_poly_mat_t mat)

    Returns the modulus of \code{mat}.

*******************************************************************************

    Basic assignment and manipulation

*******************************************************************************

MACRO nmod_poly_mat_entry(mat,i,j)

    Gives a reference to the entry at row \code{i} and column \code{j}.
    The reference can be passed as an input or output variable to any
    \code{nmod_poly} function for direct manipulation of the matrix element.
    No bounds checking is performed.

void nmod_poly_mat_set(nmod_poly_mat_t mat1, const nmod_poly_mat_t mat2)

    Sets \code{mat1} to a copy of \code{mat2}.

void nmod_poly_mat_swap(nmod_poly_mat_t mat1, nmod_poly_mat_t mat2)

    Swaps \code{mat1} and \code{mat2} efficiently.


*******************************************************************************

    Input and output

*******************************************************************************

void nmod_poly_mat_print(const nmod_poly_mat_t mat, const char * x)

    Prints the matrix \code{mat} to standard output, using the
    variable \code{x}.

*******************************************************************************

    Random matrix generation

*******************************************************************************

void nmod_poly_mat_randtest(nmod_poly_mat_t mat, flint_rand_t state, slong len)

    This is equivalent to applying \code{nmod_poly_randtest} to all entries
    in the matrix.

void nmod_poly_mat_randtest_sparse(nmod_poly_mat_t A, flint_rand_t state,
        slong len, float density)

    Creates a random matrix with the amount of nonzero entries given
    approximately by the \code{density} variable, which should be a fraction
    between 0 (most sparse) and 1 (most dense).

    The nonzero entries will have random lengths between 1 and \code{len}.

*******************************************************************************

    Special matrices

*******************************************************************************

void nmod_poly_mat_zero(nmod_poly_mat_t mat)

    Sets \code{mat} to the zero matrix.

void nmod_poly_mat_one(nmod_poly_mat_t mat)

    Sets \code{mat} to the unit or identity matrix of given shape,
    having the element 1 on the main diagonal and zeros elsewhere.
    If \code{mat} is nonsquare, it is set to the truncation of a unit matrix.

*******************************************************************************

    Basic comparison and properties

*******************************************************************************

int nmod_poly_mat_equal(const nmod_poly_mat_t mat1, const nmod_poly_mat_t mat2)

    Returns nonzero if \code{mat1} and \code{mat2} have the same shape and
    all their entries agree, and returns zero otherwise.

int nmod_poly_mat_is_zero(const nmod_poly_mat_t mat)

    Returns nonzero if all entries in \code{mat} are zero, and returns
    zero otherwise.

int nmod_poly_mat_is_one(const nmod_poly_mat_t mat)

    Returns nonzero if all entry of \code{mat} on the main diagonal
    are the constant polynomial 1 and all remaining entries are zero,
    and returns zero otherwise. The matrix need not be square.

int nmod_poly_mat_is_empty(const nmod_poly_mat_t mat)

    Returns a non-zero value if the number of rows or the number of
    columns in \code{mat} is zero, and otherwise returns
    zero.

int nmod_poly_mat_is_square(const nmod_poly_mat_t mat)

    Returns a non-zero value if the number of rows is equal to the
    number of columns in \code{mat}, and otherwise returns zero.


*******************************************************************************

    Norms

*******************************************************************************

slong nmod_poly_mat_max_length(const nmod_poly_mat_t A)

    Returns the maximum polynomial length among all the entries in \code{A}.


*******************************************************************************

    Evaluation

*******************************************************************************

void nmod_poly_mat_evaluate_nmod(nmod_mat_t B, const nmod_poly_mat_t A,
        mp_limb_t x)

    Sets the \code{nmod_mat_t} \code{B} to \code{A} evaluated entrywise
    at the point \code{x}.


*******************************************************************************

    Arithmetic

*******************************************************************************

void nmod_poly_mat_scalar_mul_nmod_poly(nmod_poly_mat_t B,
                    const nmod_poly_mat_t A, const nmod_poly_t c)

    Sets \code{B} to \code{A} multiplied entrywise by the polynomial \code{c}.

void nmod_poly_mat_scalar_mul_nmod(nmod_poly_mat_t B,
                    const nmod_poly_mat_t A, mp_limb_t c)

    Sets \code{B} to \code{A} multiplied entrywise by the coefficient
    \code{c}, which is assumed to be reduced modulo the modulus.

void nmod_poly_mat_add(nmod_poly_mat_t C, const nmod_poly_mat_t A,
        const nmod_poly_mat_t B)

    Sets \code{C} to the sum of \code{A} and \code{B}.
    All matrices must have the same shape. Aliasing is allowed.

void nmod_poly_mat_sub(nmod_poly_mat_t C, const nmod_poly_mat_t A,
        const nmod_poly_mat_t B)

    Sets \code{C} to the sum of \code{A} and \code{B}.
    All matrices must have the same shape. Aliasing is allowed.

void nmod_poly_mat_neg(nmod_poly_mat_t B, const nmod_poly_mat_t A)

    Sets \code{B} to the negation of \code{A}.
    The matrices must have the same shape. Aliasing is allowed.

void nmod_poly_mat_mul(nmod_poly_mat_t C, const nmod_poly_mat_t A,
    const nmod_poly_mat_t B)

    Sets \code{C} to the matrix product of \code{A} and \code{B}.
    The matrices must have compatible dimensions for matrix multiplication.
    Aliasing is allowed. This function automatically chooses between
    classical, KS and evaluation-interpolation multiplication.

void nmod_poly_mat_mul_classical(nmod_poly_mat_t C, const nmod_poly_mat_t A,
    const nmod_poly_mat_t B)

    Sets \code{C} to the matrix product of \code{A} and \code{B}, 
    computed using the classical algorithm. The matrices must have 
    compatible dimensions for matrix multiplication. Aliasing is allowed.

void nmod_poly_mat_mul_KS(nmod_poly_mat_t C, const nmod_poly_mat_t A,
    const nmod_poly_mat_t B)

    Sets \code{C} to the matrix product of \code{A} and \code{B}, 
    computed using Kronecker segmentation. The matrices must have 
    compatible dimensions for matrix multiplication. Aliasing is allowed.

void nmod_poly_mat_mul_interpolate(nmod_poly_mat_t C, const nmod_poly_mat_t A,
    const nmod_poly_mat_t B)

    Sets \code{C} to the matrix product of \code{A} and \code{B},
    computed through evaluation and interpolation. The matrices must have
    compatible dimensions for matrix multiplication. For interpolation
    to be well-defined, we require that the modulus is a prime at least as
    large as $m + n - 1$ where $m$ and $n$ are the maximum lengths of
    polynomials in the input matrices. Aliasing is allowed.

void nmod_poly_mat_sqr(nmod_poly_mat_t B, const nmod_poly_mat_t A)

    Sets \code{B} to the square of \code{A}, which must be a square matrix.
    Aliasing is allowed. This function automatically chooses between
    classical and KS squaring.

void nmod_poly_mat_sqr_classical(nmod_poly_mat_t B, const nmod_poly_mat_t A)

    Sets \code{B} to the square of \code{A}, which must be a square matrix.
    Aliasing is allowed. This function uses direct formulas for very small
    matrices, and otherwise classical matrix multiplication.

void nmod_poly_mat_sqr_KS(nmod_poly_mat_t B, const nmod_poly_mat_t A)

    Sets \code{B} to the square of \code{A}, which must be a square matrix.
    Aliasing is allowed. This function uses Kronecker segmentation.

void nmod_poly_mat_sqr_interpolate(nmod_poly_mat_t B, const nmod_poly_mat_t A)

    Sets \code{B} to the square of \code{A}, which must be a square matrix,
    computed through evaluation and interpolation. For interpolation
    to be well-defined, we require that the modulus is a prime at least as
    large as $2n - 1$ where $n$ is the maximum length of
    polynomials in the input matrix. Aliasing is allowed.

void nmod_poly_mat_pow(nmod_poly_mat_t B, const nmod_poly_mat_t A, ulong exp)

    Sets \code{B} to \code{A} raised to the power \code{exp}, where \code{A}
    is a square matrix. Uses exponentiation by squaring. Aliasing is allowed.

*******************************************************************************

    Row reduction

*******************************************************************************

slong nmod_poly_mat_find_pivot_any(const nmod_poly_mat_t mat,
                                    slong start_row, slong end_row, slong c)

    Attempts to find a pivot entry for row reduction.
    Returns a row index $r$ between \code{start_row} (inclusive) and
    \code{stop_row} (exclusive) such that column $c$ in \code{mat} has
    a nonzero entry on row $r$, or returns -1 if no such entry exists.

    This implementation simply chooses the first nonzero entry from
    it encounters. This is likely to be a nearly optimal choice if all
    entries in the matrix have roughly the same size, but can lead to
    unnecessary coefficient growth if the entries vary in size.

slong nmod_poly_mat_find_pivot_partial(const nmod_poly_mat_t mat,
                                    slong start_row, slong end_row, slong c)

    Attempts to find a pivot entry for row reduction.
    Returns a row index $r$ between \code{start_row} (inclusive) and
    \code{stop_row} (exclusive) such that column $c$ in \code{mat} has
    a nonzero entry on row $r$, or returns -1 if no such entry exists.

    This implementation searches all the rows in the column and
    chooses the nonzero entry of smallest degree. This heuristic
    typically reduces coefficient growth when the matrix entries
    vary in size.

slong nmod_poly_mat_fflu(nmod_poly_mat_t B, nmod_poly_t den, slong * perm,
                            const nmod_poly_mat_t A, int rank_check)

    Uses fraction-free Gaussian elimination to set (\code{B}, \code{den}) to a
    fraction-free LU decomposition of \code{A} and returns the
    rank of \code{A}. Aliasing of \code{A} and \code{B} is allowed.

    Pivot elements are chosen with \code{nmod_poly_mat_find_pivot_partial}.
    If \code{perm} is non-\code{NULL}, the permutation of
    rows in the matrix will also be applied to \code{perm}.

    If \code{rank_check} is set, the function aborts and returns 0 if the
    matrix is detected not to have full rank without completing the
    elimination.

    The denominator \code{den} is set to $\pm \operatorname{det}(A)$, where
    the sign is decided by the parity of the permutation. Note that the
    determinant is not generally the minimal denominator.

slong nmod_poly_mat_rref(nmod_poly_mat_t B, nmod_poly_t den,
                            const nmod_poly_mat_t A)

    Sets (\code{B}, \code{den}) to the reduced row echelon form of \code{A}
    and returns the rank of \code{A}.
    Aliasing of \code{A} and \code{B} is allowed.

    The denominator \code{den} is set to $\pm \operatorname{det}(A)$.
    Note that the determinant is not generally the minimal denominator.

*******************************************************************************

    Trace

*******************************************************************************

void nmod_poly_mat_trace(nmod_poly_t trace, const nmod_poly_mat_t mat)

    Computes the trace of the matrix, i.e. the sum of the entries on
    the main diagonal. The matrix is required to be square.

*******************************************************************************

    Determinant and rank

*******************************************************************************

void nmod_poly_mat_det(nmod_poly_t det, const nmod_poly_mat_t A)

    Sets \code{det} to the determinant of the square matrix \code{A}. Uses
    a direct formula, fraction-free LU decomposition, or interpolation,
    depending on the size of the matrix.

void nmod_poly_mat_det_fflu(nmod_poly_t det, const nmod_poly_mat_t A)

    Sets \code{det} to the determinant of the square matrix \code{A}.
    The determinant is computed by performing a fraction-free LU
    decomposition on a copy of \code{A}.

void nmod_poly_mat_det_interpolate(nmod_poly_t det, const nmod_poly_mat_t A)

    Sets \code{det} to the determinant of the square matrix \code{A}.
    The determinant is computed by determing a bound $n$ for its length,
    evaluating the matrix at $n$ distinct points, computing the determinant
    of each coefficient matrix, and forming the interpolating polynomial.

    If the coefficient ring does not contain $n$ distinct points (that is,
    if working over $\mathbb{Z}/p\mathbb{Z}$ where $p < n$),
    this function automatically falls back to \code{nmod_poly_mat_det_fflu}.

slong nmod_poly_mat_rank(const nmod_poly_mat_t A)

    Returns the rank of \code{A}. Performs fraction-free LU decomposition
    on a copy of \code{A}.


*******************************************************************************

    Inverse

*******************************************************************************

int nmod_poly_mat_inv(nmod_poly_mat_t Ainv, nmod_poly_t den,
                            const nmod_poly_mat_t A)

    Sets (\code{Ainv}, \code{den}) to the inverse matrix of \code{A}.
    Returns 1 if \code{A} is nonsingular and 0 if \code{A} is singular.
    Aliasing of \code{Ainv} and \code{A} is allowed.

    More precisely, \code{det} will be set to the determinant of \code{A}
    and \code{Ainv} will be set to the adjugate matrix of \code{A}.
    Note that the determinant is not necessarily the minimal denominator.

    Uses fraction-free LU decomposition, followed by solving for
    the identity matrix.


*******************************************************************************

    Nullspace

*******************************************************************************

slong nmod_poly_mat_nullspace(nmod_poly_mat_t res, const nmod_poly_mat_t mat)

    Computes the right rational nullspace of the matrix \code{mat} and
    returns the nullity.

    More precisely, assume that \code{mat} has rank $r$ and nullity $n$.
    Then this function sets the first $n$ columns of \code{res}
    to linearly independent vectors spanning the nullspace of \code{mat}.
    As a result, we always have rank(\code{res}) $= n$, and
    \code{mat} $\times$ \code{res} is the zero matrix.

    The computed basis vectors will not generally be in a reduced form.
    In general, the polynomials in each column vector in the result
    will have a nontrivial common GCD.

*******************************************************************************

    Solving

*******************************************************************************

int nmod_poly_mat_solve(nmod_poly_mat_t X, nmod_poly_t den,
                    const nmod_poly_mat_t A, const nmod_poly_mat_t B)

    Solves the equation $AX = B$ for nonsingular $A$. More precisely, computes
    (\code{X}, \code{den}) such that $AX = B \times \operatorname{den}$.
    Returns 1 if $A$ is nonsingular and 0 if $A$ is singular.
    The computed denominator will not generally be minimal.

    Uses fraction-free LU decomposition followed by fraction-free
    forward and back substitution.

int nmod_poly_mat_solve_fflu(nmod_poly_mat_t X, nmod_poly_t den,
                            const nmod_poly_mat_t A, const nmod_poly_mat_t B);

    Solves the equation $AX = B$ for nonsingular $A$. More precisely, computes
    (\code{X}, \code{den}) such that $AX = B \times \operatorname{den}$.
    Returns 1 if $A$ is nonsingular and 0 if $A$ is singular.
    The computed denominator will not generally be minimal.

    Uses fraction-free LU decomposition followed by fraction-free
    forward and back substitution.

void nmod_poly_mat_solve_fflu_precomp(nmod_poly_mat_t X,
                    const slong * perm,
                    const nmod_poly_mat_t FFLU, const nmod_poly_mat_t B);

    Performs fraction-free forward and back substitution given a precomputed
    fraction-free LU decomposition and corresponding permutation.
