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

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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Parallel computing Ročník 22; číslo 10; s. 1399 - 1412
Hlavní autori:	Neumann, Ingmar, Wilhelmi, Wolfgang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.12.1996
Predmet:	Algebraic topology Parallel algorithms Sparse matrix computations Parallel algorithms Algebraic topology Sparse matrix computations
ISSN:	0167-8191, 1872-7336
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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 be reached.
Bibliografia:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0167-8191 1872-7336
DOI:	10.1016/S0167-8191(96)00040-3