No label defined (Q4376923)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1118055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1118055 |
Statements
16 February 1998
0 references
Smith normal form
0 references
integer matrix
0 references
algorithm
0 references
0.8712203502655029
0 references
Computing the Smith normal form of an integer matrix has attracted quite a few people recently. The original algorithm of Smith from 1861 -- reproduced in all algebra texts so far -- turned out to be not useful in practice because of the coefficient growth occuring in the intermediate calculations. In the meantime, better algorithms have been designed and published. However, the last word has not been said yet. In this paper, I propose yet another algorithm which does not seem to be worse than the best one known. It is more structural than all the ones known to me and works in principle for a large class of Bézout domains including all principal ideal domains. So one may hope that it is also advantageous in the case of a matrix with polynomial entries. For the entire collection see [Zbl 0882.00027].
0 references