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.
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.
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.

References

SHOWING 1-10 OF 38 REFERENCES
Fast computation of the Smith form of a sparse integer matrix
A new probabilistic algorithm to compute the Smith normal form of a sparse integer matrix and an asymptotically fast algorithm for dense matrices that return the correct answer with a controllable, exponentially small probability of error.
Algorithms for matrix canonical forms
Computing canonical forms of matrices over rings is a classical math¬ ematical problem with many applications to computational linear alge¬ bra. These forms include the Frobenius form over a field,
Faster inversion and other black box matrix computations using efficient block projections
• Mathematics, Computer Science
ISSAC '07
• 2007
The correctness of the algorithm to find rational solutions for sparse systems of linear equations is established by proving the existence of efficient block projections for arbitrary non-singular matrices over sufficiently large fields by incorporating them into existing black-box matrix algorithms to derive improved bounds for the cost of several matrix problems.
Large matrix, small rank
• Computer Science, Mathematics
ISSAC '09
• 2009
It is conjecture that the sequence of ranks of the D(3,k) satisfies a linear recurrence of degree three, and a software infrastructure is built to improve efficiency of matrix operations over a small finite field.
On computing the determinant and Smith form of an integer matrix
• Computer Science
Proceedings 41st Annual Symposium on Foundations of Computer Science
• 2000
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix by computing the Smith form of the integer matrix an extremely useful canonical form in itself.
Solving sparse linear equations over finite fields
A "coordinate recurrence" method for solving sparse systems of linear equations over finite fields is described and a probabilistic algorithm is shown to exist for finding the determinant of a square matrix.
On Efficient Sparse Integer Matrix Smith Normal Form Computations
• Computer Science, Mathematics
J. Symb. Comput.
• 2001
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo
On finding multiplicities of characteristic polynomial factors of black-box matrices
• Computer Science, Mathematics
ISSAC '09
• 2009
Altered in an adaptive strategy, these algorithms reach significant speedups in practice for some integer matrices arising in an application from graph theory.
Reliable Krylov-based algorithms for matrix null space and rank
This report presents a block Lanczos algorithm that is somewhat simpler than block algorithms that are presently in use and provably reliable for computations over large fields and a randomized (Monte Carlo) black box algorithm for matrix rank that is asymptotically faster, in the small field case, than any other that is presently known.