A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
From MaRDI portal
Publication:2100051
DOI10.1016/j.jsc.2022.09.002zbMath1505.65190arXiv2111.09949OpenAlexW3217196305MaRDI QIDQ2100051
Stavros Birmpilis, Arne Storjohann, George Labahn
Publication date: 21 November 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.09949
Matrices of integers (15B36) Canonical forms, reductions, classification (15A21) Numerical linear algebra (65F99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)]
- Smith normal form in combinatorics
- On the complexity of inverting integer and polynomial matrices
- On the complexity of computing determinants
- PRIMES is in P
- The shifted number system for fast linear algebra on integer matrices
- Modern Computer Algebra
- Gröbner bases of ideals invariant under a commutative group
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Application of the Smith Normal Form to the Structure of Lattice Rules
- Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication
- A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix
- Deterministic unimodularity certification
- Algorithm and bound for the greatest common divisor of n integers
- Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
- Computation of invariants of finite abelian groups
- Fast computation of the Smith form of a sparse integer matrix
This page was built for publication: A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
