✦ LIBER ✦

The Smith normal form

✍ Scribed by Morris Newman

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 709 KB
Volume: 254
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(96)00163-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues and the Smith normal form

✍ Joseph J. Rushanan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Quasi-symmetric designs and the Smith No

Quasi-symmetric designs and the Smith Normal Form

✍ A. Blokhuis; A. R. Calderbank 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 707 KB

We obtain necessary conditions for the existence of a 2 -(v, k, X) design, for which the block intersection sizes sl, s 2 ..... s n satisfy s I ---s 2 ~ ... -Sn -m s (modpe), where p is a prime and the exponent e is odd. These conditions are obtained from restriction on the Smith Normal Form of the

Reduction of Smith Normal Form Transform

Reduction of Smith Normal Form Transformation Matrices

✍ G. Jäger 📂 Article 📅 2004 🏛 Springer Vienna 🌐 English ⚖ 284 KB

Differential Posets and Smith Normal For

Differential Posets and Smith Normal Forms

✍ Alexander Miller; Victor Reiner 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 592 KB

Semiscalar equivalence and the smith nor

Semiscalar equivalence and the smith normal form of polynomial matrices

✍ V. M. Petrichkovich 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 215 KB

On Efficient Sparse Integer Matrix Smith

On Efficient Sparse Integer Matrix Smith Normal Form Computations

✍ Jean-Guillaume Dumas; B. David Saunders; Gilles Villard 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 576 KB

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 powers of word-size primes. Consequently, the algorithm does not suffer from coefficient growth. We ha