Van Dooren's Index Sum Theorem and Rational Matrices with Prescribed Structural Data Articles uri icon

publication date

  • June 2019

start page

  • 720

end page

  • 738

issue

  • 2

volume

  • 40

International Standard Serial Number (ISSN)

  • 0895-4798

Electronic International Standard Serial Number (EISSN)

  • 1095-7162

abstract

  • The structural data of any rational matrix R(\lambda ), i.e., the structural indices of its poles and zeros together with the minimal indices of its left and right nullspaces, is known to satisfy a simple condition involving certain sums of these indices. This fundamental constraint was first proved by Van Dooren in 1978; here we refer to this result as the rational index sum theorem. An analogous result for polynomial matrices has been independently discovered (and rediscovered) several times in the past three decades. In this paper we clarify the connection between these two seemingly different index sum theorems, describe a little bit of the history of their development, and discuss their curious apparent unawareness of each other. Finally, we use the connection between these results to solve a fundamental inverse problem for rational matrices---for which lists \scrL of prescribed structural data does there exist some rational matrix R(\lambda ) that realizes exactly the list \scrL ? We show that Van Dooren's condition is the only constraint on rational realizability; that is, a list \scrL is the structural data of some rational matrix R(\lambda ) if and only if \scrL satisfies the rational index sum condition.

keywords

  • eigenvalues; index sum theorem; structural indices; rational matrices; poles; zeros; invariant orders; minimal indices; polynomial matrices