A new method for computing a column reduced polynomial matrix

DOI10.1016/0167-6911(88)90010-2zbMath0646.65040OpenAlexW2138203365MaRDI QIDQ1104046

B. George

Publication date: 1988

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a-new-method-for-computing-a-column-reduced-polynomial-matrix(6acacfb5-93c1-4a54-8870-fa8f2abbe581).html

zbMATH Keywords

algorithmsnumerical examplesroundoff errorspolynomial matrixminimal polynomial basiscolumn reduced form

Mathematics Subject Classification ID

Related Items (9)

Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties ⋮ Computing minimal interpolation bases ⋮ Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich ⋮ Normal forms for general polynomial matrices ⋮ Numerical computation of minimal polynomial bases: a generalized resultant approach ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Column reduction of polynomial matrices ⋮ Computing normal external descriptions and feedback design ⋮ The generalized Schur algorithm and some applications

Cites Work

• Numerical computation of a coprime factorization of a transfer function matrix
• Fast projection methods for minimal design problems in linear system theory
• Linear multivariable systems
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• The generalized eigenstructure problem in linear system theory
• Unnamed Item

This page was built for publication: A new method for computing a column reduced polynomial matrix