Unimodular completion of polynomial matrices

DOI10.1145/2608628.2608640zbMath1325.68304OpenAlexW2065441330MaRDI QIDQ3452422

Wei Zhou, George Labahn

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2608640

zbMATH Keywords

order basisunimodular matricesminimal kernel basisunimodular completion

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Matrices over function rings in one or more variables (15A54) Matrix completion problems (15A83)

Related Items (4)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ On hyper-regularity and unimodularity of Ore polynomial matrices

Uses Software

• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Unimodular completion of polynomial matrices