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

Abstract

We present a new heuristic algorithm for computing the determinant of a nonsingular <i>n</i> x <i>n</i> integer matrix. Extensive empirical results from a highly optimized implementation show the running time grows approximately as <i>n</i><sup>3</sup> log <i>n</i>, 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.

DOI: 10.1145/2465506.2465955

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@inproceedings{Pauderis2013ComputingTI, title={Computing the invariant structure of integer matrices: fast algorithms into practice}, author={Colton Pauderis and Arne Storjohann}, booktitle={ISSAC}, year={2013} }