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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing Jg. 22; H. 10; S. 1399 - 1412
Hauptverfasser: Neumann, Ingmar, Wilhelmi, Wolfgang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.12.1996
Schlagworte:
Algebraic topology
Parallel algorithms
Sparse matrix computations
Parallel algorithms
Algebraic topology
Sparse matrix computations
ISSN:0167-8191, 1872-7336
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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