Part I-Smith form and common divisor of polynomial matrices

DOI10.1080/00207727408920109zbMath0287.93005OpenAlexW2087534451WikidataQ126250981 ScholiaQ126250981MaRDI QIDQ4775731

No author found.

Publication date: 1974

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727408920109

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Algebraic methods (93B25) Software, source code, etc. for problems pertaining to linear algebra (15-04) Canonical forms, reductions, classification (15A21)

Related Items (7)

Solving systems of linear equations over polynomials ⋮ A compound matrix algorithm for the computation of the Smith form of a polynomial matrix ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ A method of constructing minimal approximate realizations of linear input-output behavior ⋮ A note on solving linear Diophantine systems by usingL³-reduction algorithm ⋮ Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems ⋮ A comparative study of algorithms for computing the Smith normal form of an integer matrix†

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the asymptotic integer algorithm
• The determination of state-space representations for linear multivariable systems
• Irreducible Realizations and the Degree of a Rational Matrix
• Transfer Equivalence of Linear Dynamical Systems
• Comparison of algorithms for calculation of g.c.d. of polynomials
• A New Version of the Euclidean Algorith

This page was built for publication: Part I-Smith form and common divisor of polynomial matrices