Smith normal form of dense integer matrices fast algorithms into practice

DOI10.1145/1005285.1005325zbMATH Open1134.65345OpenAlexW2057186674MaRDI QIDQ4657336FDOQ4657336

Authors: B. David Saunders, Zhendong Wan 

Publication date: 14 March 2005

Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 1254241
• scientific article; zbMATH DE number 1254302
• On efficient sparse integer matrix Smith normal form computations
• A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
• A comparative study of algorithms for computing the Smith normal form of an integer matrix†
• Fast computation of the Smith form of a sparse integer matrix
• A parallel algorithm for achieving the Smith Normal Form of an integer matrix
• Publication:4489154
• scientific article; zbMATH DE number 1113837
• scientific article; zbMATH DE number 1263431

Mathematics Subject Classification ID

Matrices of integers (15B36)

Cited In (7)

• On efficient sparse integer matrix Smith normal form computations
• Title not available (Why is that?)
• Discrete Morse theoretic algorithms for computing homology of complexes and maps
• Morse theory for filtrations and efficient computation of persistent homology
• Fast computation of the Smith form of a sparse integer matrix
• Advanced determinant calculus: a complement
• Minimal representations and algebraic relations for single nested products

Uses Software

• LinBox
• EDIM

This page was built for publication: Smith normal form of dense 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 Q4657336)