✦ LIBER ✦

Efficient parallelizations of Hermite and Smith normal form algorithms

✍ Scribed by Gerold Jäger; Clemens Wagner

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 552 KB
Volume: 35
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2009.01.003

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

Complexity of the Havas, Majewski, Matth

Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form Algorithm

✍ Wilberd Van Der Kallen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Diophantine Quadratic Equation and Smith

Diophantine Quadratic Equation and Smith Normal Form Using Scaled Extended Integer Abaffy–Broyden–Spedicato Algorithms

✍ E. Golpar-Raboky; N. Mahdavi-Amiri 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 703 KB

Smith normal form of augmented degree ma

Smith normal form of augmented degree matrix and its applications

✍ Wei Cao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 134 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

Reduced form of normal algorithms and a

Reduced form of normal algorithms and a linear acceleration theorem

✍ G. S. Tseitin 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 368 KB