# Fast computation of Smith forms of sparse matrices over local rings

```@inproceedings{Elsheikh2012FastCO,
title={Fast computation of Smith forms of sparse matrices over local rings},
author={Mustafa Elsheikh and Mark Giesbrecht and Andrew Novocin and B. David Saunders},
booktitle={ISSAC},
year={2012}
}```
• Published in ISSAC 25 January 2012
• Computer Science
We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the <i>black-box</i> model which is suitable for sparse and structured matrices. The algorithms depend on a number of tools, such as matrix rank computation over finite fields, for which the best-known time- and memory-efficient algorithms are probabilistic. For an <i>n</i> x <i>n</i> matrix <i>A</i> over the ring F[<i>z</i>]/(<i>f</i><sup><i>e</i></sup>), where <i>f</i><sup…
8 Citations
Smith Normal Form over Local Rings and Related Problems
The ultimate goal is to extend the applications of numerical algorithms for computing eigenvalues to computing the invariant factors of symbolic matrices as well as to design an algorithm for computing uniform samples from the nullspace.
Chain complex reduction via fast digraph traversal.
A new algorithm for reducing a chain complex using algebraic Morse theory and it outperforms built-in algorithms in other CASs, and a family of Morse matchings on any chain complex of free modules of finite rank is discovered.
Matrices with Two Nonzero Entries per Row
For an n by n matrix having just two nonzero entries per row, it is shown that rank, determinant, LU decomposition, and linear system solution can all be done in O(n) arithmetic operations (algebraic complexity).
Ranks of Quotients, Remainders and \$p\$-Adic Digits of Matrices
• Mathematics
ArXiv
• 2014
Upper bounds are proven for the \$\mathbb{Z}/p p A/A/p Z-rank of A for all \$i \ge 0\$ when \$p = 2\$, and a conjecture is presented for odd primes.
Minimal Representations and Algebraic Relations for Single Nested Products
This article elaborate a general framework to represent a finite set of products in a formal difference ring where the number of transcendental product generators is minimal and is able to describe explicitly all relations among the given input products.
Quantum information in the real world: Diagnosing and correcting errors in practical quantum devices
This thesis investigates the presence of noise in quantum computers and limitations on the connectivity and control in large scale quantum computing architectures, and expands upon the standard randomized benchmarking protocol and forms a new class of protocols which are called character randomized benchmarkers.
On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
• J. Dumas
• Mathematics
IEEE Transactions on Computers
• 2014
A hybrid combination of the explicit formula for the inverse of Newton-Raphson iteration over p-adic numbers and the best asymptotic variants is proposed, which yields then a constant factor improvement, also for large exponents.