Solving systems of linear equations over polynomials

DOI10.1016/0304-3975(85)90131-8zbMath0603.65024OpenAlexW2027413053MaRDI QIDQ1082773

Ravindran Kannan

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90131-8

zbMATH Keywords

polynomial matricespolynomial-time algorithmHermite normal formSmith normal formrectangular matricesunimodular column operations

Mathematics Subject Classification ID

Matrices over function rings in one or more variables (15A54)

Related Items (15)

Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients ⋮ Codeterminantal graphs ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ A local construction of the Smith normal form of a matrix polynomial ⋮ Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination ⋮ On the quasi-stability criteria of monic matrix polynomials ⋮ Unnamed Item ⋮ Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices ⋮ A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix ⋮ A decision algorithm for linear sentences on a PFM ⋮ Smith forms of circulant polynomial matrices ⋮ On Computing the Hermite Form of a Matrix of Differential Polynomials ⋮ Evaluation techniques for zero-dimensional primary decomposition ⋮ Parallel algorithms for matrix normal forms ⋮ Computing rational forms of integer matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast projection methods for minimal design problems in linear system theory
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• On Computing the Exact Determinant of Matrices with Polynomial Entries
• Part I-Smith form and common divisor of polynomial matrices
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
• Subresultants and Reduced Polynomial Remainder Sequences
• On the unique decodability of codes (Corresp.)
• Irreducible Realizations and the Degree of a Rational Matrix
• Systems of distinct representatives and linear algebra
• Transfer Equivalence of Linear Dynamical Systems
• Solving linear equations using residue arithmetic — Algorithm II
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations

This page was built for publication: Solving systems of linear equations over polynomials