Output-sensitive modular algorithms for polynomial matrix normal forms

DOI10.1016/J.JSC.2007.03.001MaRDI QIDQ2470057zbMATH OpenOpenAlexFDO

Authors Howard Cheng, G. Labahn

Publication date 13 February 2008

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2007.03.001

zbMATH Keywords

greatest common divisorsleast common multiplesmatrix rational functionsmodular algorithmnumerical examplespolynomial matricesPopov formrow-reduced formweak Popov form

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Matrices over function rings in one or more variables (15A54)

Recommendations

• Normal forms for general polynomial matrices
• scientific article; zbMATH DE number 1256647
• Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
• Computing Popov and Hermite forms of rectangular polynomial matrices
• Normalization of row reduced matrices

Cites work

• Effective computation of rational approximants and interpolants
• Fast projection methods for minimal design problems in linear system theory
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Fraction-free row reduction of matrices of Ore polynomials.
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 1253996 (Why is no real title available?)
• scientific article; zbMATH DE number 2151192 (Why is no real title available?)
• scientific article; zbMATH DE number 2151212 (Why is no real title available?)
• Normal forms for general polynomial matrices
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On lattice reduction for polynomial matrices
• On solutions of linear functional systems
• Recursiveness in matrix rational interpolation problems
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

Cited in

(4)

• Modular techniques for noncommutative Gröbner bases
• Normal forms for general polynomial matrices
• Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
• The strong Popov form of nonlinear input-output equations

This page was built for publication: Output-sensitive modular algorithms for polynomial matrix normal forms

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