scientific article; zbMATH DE number 1254241

zbMATH Open0915.65032MaRDI QIDQ4227282FDOQ4227282

Authors: Mark Giesbrecht 

Publication date: 15 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• Fast computation of the Smith form of a sparse integer matrix
• scientific article; zbMATH DE number 1254302
• scientific article; zbMATH DE number 1113837

zbMATH Keywords

Monte Carlo methodcomputational efficiencyfast computationinteger matrixSmith normal formprobabilistic algorithmsinteger arithmeticLas Vegas algorithm

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Matrices of integers (15B36) Canonical forms, reductions, classification (15A21)

Cited In (22)

• A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
• Application of the Smith Normal Form to the Structure of Lattice Rules
• On efficient sparse integer matrix Smith normal form computations
• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
• On the existence of solutions in systems of linear Diophantine equations
• Title not available (Why is that?)
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Title not available (Why is that?)
• On the computation of elementary divisors of integer matrices
• Mr. Smith goes to Las Vegas: randomized parallel computation of the Smith normal form of polynomial matrices
• Fast computation of the Smith form of a sparse integer matrix
• Modular algorithm for reducing matrices to the Smith normal form
• Title not available (Why is that?)
• Integer Smith form via the valence: experience with large sparse matrices from homology
• Computing rational forms of integer matrices
• Computing the invariant structure of integer matrices: fast algorithms into practice
• Smith normal form of dense integer matrices fast algorithms into practice
• Computing Hermite and Smith normal forms of triangular integer matrices
• 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
• Title not available (Why is that?)
• Chip-firing games and critical groups
• Algorithms for the computation of the Smith normal form and their implementation on parallel machines

This page was built for publication:

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