Solving systems of linear equations over polynomials
From MaRDI portal
Publication:1082773
DOI10.1016/0304-3975(85)90131-8zbMath0603.65024MaRDI QIDQ1082773
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
polynomial matrices; polynomial-time algorithm; Hermite normal form; Smith normal form; rectangular matrices; unimodular column operations
15A54: Matrices over function rings in one or more variables
Related Items
A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix, A decision algorithm for linear sentences on a PFM, Parallel algorithms for matrix normal forms, Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients, Computing rational forms of integer matrices, Fast Parallel Computation of Hermite and Smith Forms of Polynomial 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
