A new method for computing a column reduced polynomial matrix

DOI10.1016/0167-6911(88)90010-2MaRDI QIDQ1104046zbMATH OpenOpenAlexFDO

Authors 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

algorithmscolumn reduced formminimal polynomial basisnumerical examplespolynomial matrixroundoff errors

Mathematics Subject Classification ID

Matrices over function rings in one or more variables (15A54)

Review text

The new method proposed by the authors is based on reformulating the problem of constructing a column reduced form of a given polynomial matrix as a problem of constructing a minimal polynomial basis for the right null space of a polynomial matrix closely related to the original one. Two algorithms and several numerical examples illustrating these algorithms are given. The authors conclude that the numerical qualities of their method are completely determined by those of an earlier algorithm for constructing a minimal polynomial basis for the kernel of a polynomial matrix. Also, they claim that the upper bounds for the roundoff errors are too generous and the computed results agree with the exact ones within the order of machine precision.

Recommendations

• Column reduction of polynomial matrices
• A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
• Numerical computation of minimal polynomial bases: a generalized resultant approach
• scientific article; zbMATH DE number 708841
• Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich

Cites work

• Fast projection methods for minimal design problems in linear system theory
• scientific article; zbMATH DE number 4016040 (Why is no real title available?)
• Linear multivariable systems
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Numerical computation of a coprime factorization of a transfer function matrix
• The generalized eigenstructure problem in linear system theory

Cited in

(12)

• Column reduction of polynomial matrices
• Computing normal external descriptions and feedback design
• Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
• Essentially optimal computation of the inverse of generic polynomial matrices
• Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
• The generalized Schur algorithm and some applications
• The RCH method for computing minimal polynomials of polynomial matrices
• Normal forms for general polynomial matrices
• Numerical computation of minimal polynomial bases: a generalized resultant approach
• Computing minimal interpolation bases
• Algorithm 767: a Fortran 77 package for column reduction of polynomial matrices
• New method of minimal polynomial construction

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

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