Computing column bases of polynomial matrices

DOI10.1145/2465506.2465947MaRDI QIDQ2963260zbMATH OpenOpenAlexFDO

Authors Wei Zhou, G. Labahn

Publication date 10 February 2017

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

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

zbMATH Keywords

order basiscolumn basisminimal approximant basiskernel basisnullspace basissigma basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over function rings in one or more variables (15A54)

Recommendations

• Computing the rank and a small nullspace basis of a polynomial matrix
• Computing minimal nullspace bases
• scientific article; zbMATH DE number 2151192
• Column reduction of polynomial matrices
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

Cited in

(10)

• Verification protocols with sub-linear communication for polynomial matrix operations
• Computing canonical bases of modules of univariate relations
• Computing the rank and a small nullspace basis of a polynomial matrix
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
• Column reduction of polynomial matrices
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
• Efficient computation of order bases
• Algorithms for linearly recurrent sequences of truncated polynomials

This page was built for publication: Computing column bases of polynomial matrices

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