Unimodular completion of polynomial matrices

DOI10.1145/2608628.2608640MaRDI QIDQ3452422zbMATH OpenOpenAlexFDO

Authors Wei Zhou, G. 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

minimal kernel basisorder basisunimodular completionunimodular matrices

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5901745
• Completion of a partial integral matrix to a unimodular matrix
• Unimodular polynomial matrices over finite fields
• An algorithm for unimodular completion over Laurent polynomial rings
• On the completion of a partial integral matrix to a unimodular matrix
• scientific article; zbMATH DE number 1036215
• On completable unimodular row over a polynomial ring
• scientific article; zbMATH DE number 624860
• scientific article; zbMATH DE number 4102384
• A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix

Cites work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• Definability and decision problems in arithmetic
• scientific article; zbMATH DE number 1952952 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• The Jordan Curve Theorem, Formally and Informally

Cited in

(11)

• On hyper-regularity and unimodularity of Ore polynomial matrices
• Verification protocols with sub-linear communication for polynomial matrix operations
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• scientific article; zbMATH DE number 5901745 (Why is no real title available?)
• The simplified derivation of the completion theorem to a unimodular matrix over R[z_l, z₂]
• scientific article; zbMATH DE number 4102384 (Why is no real title available?)
• On the probability of generating a primitive matrix
• Row or column completion of polynomial matrices of given degree. II
• Equi-affine minimal-degree moving frames for polynomial curves
• An algorithm for unimodular completion over Laurent polynomial rings

Describes a project that uses

Uses Software

• Jordan

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452422)