An introspective algorithm for the integer determinant

MaRDI QIDQ3568140zbMATH OpenFDO

Authors Jean-Guillaume Dumas, Anna Urbańska

Publication date 17 June 2010

zbMATH Keywords

algorithmcomplexitydeterminantinteger matrixnumerical examples

Mathematics Subject Classification ID

Matrices of integers (15B36) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Computing the invariant structure of integer matrices: fast algorithms into practice
• scientific article; zbMATH DE number 2187725
• On the complexity of computing determinants
• scientific article; zbMATH DE number 1256676
• scientific article; zbMATH DE number 1263378

Cited in

(5)

• A deterministic algorithm for integer factorization
• Faster geometric algorithms via dynamic determinant computation
• scientific article; zbMATH DE number 2187725 (Why is no real title available?)
• Computing the determinant of a dense matrix over \(\mathbb{Z}\)
• Fast computation of Hermite normal forms of random integer matrices

Describes a project that uses

Uses Software

• IML - Integer Matrix Library
• LinBox

This page was built for publication: An introspective algorithm for the integer determinant

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