Recognizing badly presented \(Z\)-modules (Q1311319): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations / 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: Residual hermite normal form computations / 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: Q4120626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local approach to matrix equivalence / 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: Q5605894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4776058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The last of the Fibonacci groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / 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: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Elimination form of the Inverse and its Application to Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving a group infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of the LLL reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001836 / rank
 
Normal rank

Revision as of 11:16, 22 May 2024

scientific article
Language Label Description Also known as
English
Recognizing badly presented \(Z\)-modules
scientific article

    Statements

    Recognizing badly presented \(Z\)-modules (English)
    0 references
    0 references
    0 references
    0 references
    13 January 1994
    0 references
    When the Smith normal form of an integer matrix is computed a serious problem is the ``exposition'' of entries. There are several techniques and heuristics to make the Smith normal form computable. Such methods (modular computation, pivoting strategies) are discussed in the paper, and empirical results are presented.
    0 references
    \(Z\)-modules
    0 references
    modular computation
    0 references
    Smith normal form
    0 references
    integer matrix
    0 references
    pivoting strategies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers