On efficient sparse integer matrix Smith normal form computations

DOI10.1006/JSCO.2001.0451zbMATH Open1050.65044OpenAlexW2018433009MaRDI QIDQ597114FDOQ597114

Authors: Jean-Guillaume Dumas, B. David Saunders, Gilles Villard 

Publication date: 6 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/12bfc1cd4b807509f5a3cd99049d7205f6723eaa

Recommendations

• Integer Smith form via the valence: experience with large sparse matrices from homology
• Fast computation of the Smith form of a sparse integer matrix
• scientific article; zbMATH DE number 1254241
• scientific article; zbMATH DE number 1113837
• Smith normal form of dense integer matrices fast algorithms into practice

zbMATH Keywords

algorithmparallel computationlarge sparse matricesinteger Smith normal form

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Canonical forms, reductions, classification (15A21)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring integers with elliptic curves
• Exact solution of linear equations using p-adic expansions
• Title not available (Why is that?)
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• Solving sparse linear equations over finite fields
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• Chessboard Complexes and Matching Complexes
• Limits for the characteristic roots of a matrix. II
• Modern computer algebra
• Title not available (Why is that?)
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
• Parallel algorithms for matrix normal forms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regions in the Complex Plane Containing the Eigenvalues of a Matrix
• Title not available (Why is that?)
• Shift Register Synthesis (Modulo m)
• Title not available (Why is that?)
• Bounds for characteristic roots of matrices
• Limits for the characteristic roots of a matrix
• Complexes of not \(i\)-connected graphs
• Integer Smith form via the valence: experience with large sparse matrices from homology
• On Computing the Smith Normal Form of an Integer Matrix
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexes of Directed Graphs

Cited In (23)

• The homology of partial monoid actions and Petri nets
• Efficient Construction of 2-Chains with a Prescribed Boundary
• Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Homology of cellular structures allowing multi-incidence
• An algorithm for the arithmetic classification of multilattices
• Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
• Efficiently and effectively recognizing toricity of steady state varieties
• Chain homotopies for object topological representations
• A sensitive algorithm for detecting the inequivalence of Hadamard matrices
• Relating \(p\)-adic eigenvalues and the local Smith normal form
• The ultradiscrete Toda lattice and the Smith normal form of bidiagonal matrices
• Matrices with two nonzero entries per row
• Sequential composition of linear systems' clans
• Trade‐off between information and computability: a technique for automated topological computations
• Integer Smith form via the valence: experience with large sparse matrices from homology
• Smith normal form of dense integer matrices fast algorithms into practice
• Sheafhom: software for sparse integer matrices
• Coreduction homology algorithm
• Title not available (Why is that?)
• Coreduction homology algorithm for inclusions and persistent homology
• Recursive double-size fixed precision arithmetic
• Computation of cubical homology, cohomology, and (co)homological operations via chain contraction

Uses Software

• Homology

This page was built for publication: On efficient sparse integer matrix Smith normal form computations

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