𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Ingmar Neumann; Wolfgang Wilhelmi

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
815 KB
Volume
22
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

An Algorithm for the Construction of a N
An Algorithm for the Construction of a Normal Basis
✍ Kurt Girstmair πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 117 KB

We present an algorithm for the construction of a normal basis of a Galois extension of degree n in characteristic 0. The algorithm requires O(n 4 ) multiplications in the ground field. It is based on representation theory but does not require the knowledge of representation theoretical data (like c

An algorithm for the numerical inversion
An algorithm for the numerical inversion of a tridiagonal matrix
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.