A PARALLEL ALGORITHM FOR ACHIEVING THE SMITH NORMAL-FORM OF AN INTEGER MATRIX

Authors
NEUMANN I WILHELMI W
Citation
I. Neumann et W. Wilhelmi, A PARALLEL ALGORITHM FOR ACHIEVING THE SMITH NORMAL-FORM OF AN INTEGER MATRIX, Parallel computing, 22(10), 1996, pp. 1399-1412
Citations number
4
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Parallel computing → ACNP
ISSN journal
01678191
Volume
22
Issue
10
Year of publication
1996
Pages
1399 - 1412
Database
ISI
SICI code
0167-8191(1996)22:10<1399:APAFAT>2.0.ZU;2-7
Abstract
The Smith Normal Form of a matrix is a diagonal representation which c ontains the invariant factors of the matrix in its diagonal. In this p aper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In case of sparse matrices a high degree of parallelism can be reached.