Computing Hermite and Smith normal forms of triangular integer matrices (Q1809087): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermite Normal Form Computation Using Modulo Determinant Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Fast Triangularization of Matrices over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smith normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Solution of Systems of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor Refinement / rank
 
Normal rank

Revision as of 10:46, 29 May 2024

scientific article
Language Label Description Also known as
English
Computing Hermite and Smith normal forms of triangular integer matrices
scientific article

    Statements

    Computing Hermite and Smith normal forms of triangular integer matrices (English)
    0 references
    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
    0 references
    Hermite normal form
    0 references
    Smith normal form
    0 references
    integer matrix
    0 references
    algorithms
    0 references