✦ LIBER ✦

Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix

✍ Scribed by Kannan, Ravindran; Bachem, Achim

Book ID: 118174047
Publisher: Society for Industrial and Applied Mathematics
Year: 1979
Tongue: English
Weight: 917 KB
Volume: 8
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0208040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for achieving the S

A parallel algorithm for achieving the Smith Normal Form of an integer matrix

✍ Ingmar Neumann; Wolfgang Wilhelmi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 815 KB

The Smith Normal Form of a matrix is a diagonal representation which contains the invariant factors of the matrix in its diagonal. In this paper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In case of sparse matrices a high degree of parallelism can he

A compound matrix algorithm for the comp

A compound matrix algorithm for the computation of the Smith form of a polynomial matrix

✍ M. Mitrouli; G. Kalogeropoulos 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 698 KB

Generalized Subresultants for Computing

Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices

✍ Gilles Villard 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 662 KB

An algorithm for computing the eigenstru

An algorithm for computing the eigenstructure of a regular matrix polynomial

✍ Wen-Wei Lin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 665 KB

An efficient algorithm for range computa

An efficient algorithm for range computation of polynomials using the Bernstein form

✍ Shashwati Ray; P. S. V. Nataraj 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 274 KB

On the minors of an incidence matrix and

On the minors of an incidence matrix and its Smith normal form

✍ Jerrold W. Grossman; Devadatta M. Kulkarni; Irwin E. Schochetman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 809 KB