Approximate zero polynomials of polynomial matrices and linear systems

作者：Karcanias Nicos; Halikias George^*

来源：Linear Algebra and Its Applications, 2013, 439(4): 1091-1103.

DOI：10.1016/j.laa.2012.12.027

• Approximate GCD
• Exterior algebra
• Grassmann varieties
• Linear systems
• Determinantal assignment

This paper introduces the notions of approximate and optimal approximate zero polynomial of a polynomial matrix by deploying recent results on the approximate GCD of a set of polynomials [1] and the exterior algebra [4] representation of polynomial matrices. The results provide a new definition for the %26quot;approximate%26quot;, or %26quot;almost%26quot; zeros of polynomial matrices and provide the means for computing the distance from non-coprimeness of a polynomial matrix. The computational framework is expressed as a distance problem in a projective space. The general framework defined for polynomial matrices provides a new characterization of approximate zeros and decoupling zeros [2,4] of linear systems and a process leading to computation of their optimal versions. The use of restriction pencils provides the means for defining the distance of state feedback (output injection) orbits from uncontrollable (unobservable) families of systems, as well as the invariant versions of the %26quot;approximate decoupling polynomials%26quot;. The overall framework that is introduced provides the means for introducing measures for the distance of a system from different families of uncontrollable, or unobservable systems, which may be feedback dependent, or feedback invariant as well as the notion of %26quot;approximate decoupling polynomials%26quot;.

• 出版日期2013-8-15