scientific article; zbMATH DE number 1254241

MaRDI QIDQ4227282zbMATH OpenFDO

Authors Mark Giesbrecht

Publication date 15 June 1999

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)

Recommendations

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

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
• scientific article; zbMATH DE number 1263431 (Why is no real title available?)
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• On the computation of elementary divisors of integer matrices
• scientific article; zbMATH DE number 2081147 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 3843922 (Why is no real title available?)
• 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
• Computing Hermite and Smith normal forms of triangular integer matrices
• Smith normal form of dense integer matrices fast algorithms into practice
• 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
• scientific article; zbMATH DE number 4079628 (Why is no real title available?)
• 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)