Computing Hermite and Smith normal forms of triangular integer matrices (Q1809087)
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 1370154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Hermite and Smith normal forms of triangular integer matrices |
scientific article; zbMATH DE number 1370154 |
Statements
Computing Hermite and Smith normal forms of triangular integer matrices (English)
0 references
25 November 1999
0 references
The transformation of a triangular integer input matrix to canonical Hermite and Smith normal form is considered. Optimal algorithms with computational cost are presented. The algorithms are easily implemented, assuming standard integer arithmetic and admit excellent performance.
0 references
Hermite normal form
0 references
Smith normal form
0 references
integer matrix
0 references
algorithms
0 references
0.811172366142273
0 references
0.8070192337036133
0 references
