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

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 22; no. 10; pp. 1399 - 1412
Main Authors: Neumann, Ingmar, Wilhelmi, Wolfgang
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.1996
Subjects:
Algebraic topology
Parallel algorithms
Sparse matrix computations
Parallel algorithms
Algebraic topology
Sparse matrix computations
ISSN:0167-8191, 1872-7336
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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