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

DOI10.1145/2465506.2465955MaRDI QIDQ2963251zbMATH OpenOpenAlexFDO

Authors Colton Pauderis, Arne Storjohann

Publication date 10 February 2017

Published in Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2465506.2465955

zbMATH Keywords

determinantHermite normal forminteger matrix

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Hermitian, skew-Hermitian, and related matrices (15B57) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1254241
• Integer matrix diagonalization
• scientific article; zbMATH DE number 1254302
• scientific article; zbMATH DE number 1254301
• Fast computation of the Smith form of a sparse integer matrix

Cited in

(9)

• On the computation of elementary divisors of integer matrices
• Modular algorithm for reducing matrices to the Smith normal form
• High-order lifting and integrality certification
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• Common factors in fraction-free matrix decompositions
• The shifted number system for fast linear algebra on integer matrices
• An introspective algorithm for the integer determinant
• scientific article; zbMATH DE number 2187725 (Why is no real title available?)
• Computing the determinant of a dense matrix over \(\mathbb{Z}\)

This page was built for publication: Computing the invariant structure of integer matrices: fast algorithms into practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963251)