Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations

DOI10.2307/2004354zbMath0233.65023OpenAlexW4248043398MaRDI QIDQ5641964

Gordon H. Bradley

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2004354

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Direct numerical methods for linear systems and matrix inversion (65F05) Linear Diophantine equations (11D04)

Related Items (17)

Solving systems of linear equations over polynomials ⋮ A compound matrix algorithm for the computation of the Smith form of a polynomial matrix ⋮ Satisfiability with index dependency ⋮ Minkowski Reduction of Integral Matrices ⋮ The determination of canonical forms for lattice quadrature rules ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ A Formal Proof of the Computation of Hermite Normal Form in a General Setting ⋮ Generation of all integer points for given sets of linear inequalities ⋮ Aggregation of equations in integer programming ⋮ A Generalized Sampling Theorem for Locally Compact Abelian Groups ⋮ On Robot Games of Degree Two ⋮ A local approach to matrix equivalence ⋮ An application of the Hermite normal form in integer programming ⋮ ON A KIND OF NONLINEAR DIOPHANTINE EQUATION ⋮ Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems ⋮ A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix ⋮ A formalization of the Smith normal form in higher-order logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Introduction to the Geometry of Numbers
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Exact Solutions of Linear Equations with Rational Coefficients by Congruence Techniques
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• Solving equations exactly
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Algorithm and bound for the greatest common divisor of n integers
• Equivalent Integer Programs and Canonical Problems
• An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach

This page was built for publication: Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations