Linear divisors and reducibility of polynomial matrices (Q762581)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3889721
Language Label Description Also known as
default for all languages
No label defined
    English
    Linear divisors and reducibility of polynomial matrices
    scientific article; zbMATH DE number 3889721

      Statements

      Linear divisors and reducibility of polynomial matrices (English)
      0 references
      1984
      0 references
      A polynomial matrix (also called lambda matrix when x is identified with \(\lambda)\) is an expression of the form \(A(x)=A_ 0x^ m+A_ 1x^{m- 1}+...+A_ m\), where \(A_ i's\) are \(n\times n\) complex matrices and x is a scalar indeterminate. A(x) is monic at \(A_ 0=I\). Assume det A(x) is not a zero polynomial. If elementary divisors of A(x) are pairwise coprime, the author gives a necessary and sufficient condition for the existence of a left linear monic divisor of A(x). If A(x) is monic and det A(x) has distinct zeros, the paper suggests upper and lower bounds for the number of left linear monic divisors of A(x), and relates the latter to the reducibility of A(x).
      0 references
      polynomial matrix
      0 references
      linear divisor
      0 references
      reducibility
      0 references
      lambda matrix
      0 references
      elementary divisors
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references