Fast computation of Smith forms of sparse matrices over local rings

DOI10.1145/2442829.2442853MaRDI QIDQ5244529zbMATH OpenOpenAlexFDO

Authors Mustafa Elsheikh, Andy Novocin, B. David Saunders, Mark Giesbrecht

Publication date 27 March 2015

Published in Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1201.5365

zbMATH Keywords

sparse matrixcomplexityinteger matrixpolynomial matrixSmith formblack boxlocal principal ideal ring

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Matrices of integers (15B36)

Abstract: We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the emph{black-box} 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 $xn$ matrix $A$ over the ring $Fzfe$, where $f^e$ is a power of an irreducible polynomial $finFz$ of degree $d$, our algorithm requires $$ operations in $F$, where our black-box is assumed to require $$ operations in $F$ to compute a matrix-vector product by a vector over $Fzfe$ (and $eta$ is assumed greater than $Pden$). The algorithm only requires additional storage for $$ elements of $F$. In particular, if $eta=softO(Pden)$, then our algorithm requires only $softO(n^2{d}^2{e}^3)$ operations in $F$, which is an improvement on known dense methods for small $d$ and $e$. For the ring $$, where $p$ is a prime, we give an algorithm which is time- and memory-efficient when the number of nontrivial invariant factors is small. We describe a method for dimension reduction while preserving the invariant factors. The time complexity is essentially linear in $munrelogp,$ where $mu$ is the number of operations in $$ to evaluate the black-box (assumed greater than $n$) and $r$ is the total number of non-zero invariant factors. To avoid the practical cost of conditioning, we give a Monte Carlo certificate, which at low cost, provides either a high probability of success or a proof of failure. The quest for a time- and memory-efficient solution without restrictions on the number of nontrivial invariant factors remains open. We offer a conjecture which may contribute toward that end.

Recommendations

• Fast computation of the Smith form of a sparse integer matrix
• scientific article; zbMATH DE number 1118055
• scientific article; zbMATH DE number 1113837
• scientific article; zbMATH DE number 1254302
• A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix

Cited in

(2)

• Relating \(p\)-adic eigenvalues and the local Smith normal form
• Minimal representations and algebraic relations for single nested products

This page was built for publication: Fast computation of Smith forms of sparse matrices over local rings

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