Computing the invariant structure of integer matrices: fast algorithms into practice

@inproceedings{Pauderis2013ComputingTI,
  title={Computing the invariant structure of integer matrices: fast algorithms into practice},
  author={Colton Pauderis and Arne Storjohann},
  booktitle={ISSAC '13},
  year={2013}
}
We present a new heuristic algorithm for computing the determinant of a nonsingular n x n integer matrix. Extensive empirical results from a highly optimized implementation show the running time grows approximately as n3 log n, even for input matrices with a highly nontrivial Smith invariant structure. We extend the algorithm to compute the Hermite form of the input matrix. Both the determinant and Hermite form algorithm certify correctness of the computed results. 

Figures and Tables from this paper

Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
TLDR
Novel algorithms for finding small relations and ideal factorizations in the ideal class group of an order in an imaginary quadratic field, where both the norms of the prime ideals and the size of the coefficients involved are bounded are presented.
Deterministic Unimodularity Certification and Applications for Integer Matrices
TLDR
A deterministic method — “double-plus-one” lifting — is presented to compute the highorder residue R as well as a succinct representation of B to give a heuristic, but certified, algorithm for computing the determinant and Hermite normal form of a square, nonsingular integer matrix.
Common Factors in Fraction-Free Matrix Decompositions
TLDR
It is shown that fraction-free Gauß–Bareiss reduction leads to triangular matrices having a non-trivial number of common row factors in theLUandQRmatrix decompositions using exact computations.
Matrix factoring by fraction-free reduction
TLDR
It is shown that existing fraction-free QR (Gram-Schmidt) algorithms create a common factor in the last column of Q, which relates the existence of row factors in LU decomposition to factors appearing in the Smith normal form of the matrix.
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
TLDR
This work aims to present a new technique to enhance the security of the Goldreich, Goldwasser and Halevi (GGH) scheme by modifying the public key which hides the structure of the corresponding private key.

References

SHOWING 1-10 OF 22 REFERENCES
Computing Hermite and Smith normal forms of triangular integer matrices
TLDR
The algorithms provided are easily implemented, assume standard integer arithmetic, and admit excellent performance in practice, and lead to a faster algorithm for computing the Smith normal form of an arbitrary (i.e. non-triangular) input matrix.
On computing determinants of matrices without divisions
An algorithm ~ given that computes the determinant of an n x n matrix with entries fr~rn an arbitrary commutative ring in 0(n3~ ring additions, subtractions, and multiplications; the ‘soft-O” O
Computing the smith forms of integer matrices and solving related problems
TLDR
This thesis designs an algorithm for the efficient computation of Smith forms of integer matrices and presents lots of improvements for solving related problems such as determining the rank of a matrix, computing the minimal and characteristic polynomials of a Matrix, and finding the exact rational solution of a non-singular linear system with integer coefficients.
Asymptotically fast computation of Hermite normal forms of integer matrices
This paper presents a new algorithm for computing the Hermite normal form H of an A Z n m of rank m to gether with a unimodular pre multiplier matrix U such that UA H Our algorithm requires O m nM m
Exact Solution of Linear Equations Using P-Adie Expansions*
TLDR
For matrices A and b with entries of bounded size and dimensions n x n and n x 1, this method can be implemented in time O(n3(logn) 2) which is better than methods previously used.
On computing the determinant and Smith form of an integer matrix
TLDR
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix by computing the Smith form of the integer matrix an extremely useful canonical form in itself.
...
...