State space formulas for a suboptimal rational Leech problem I: Maximum entropy solution
Abstract
For the strictly positive case (the suboptimal case) the maximum entropy solution X to the Leech problem G(z)X(z)=K(z) and \|X\|∞=|z|≤ 1\|X(z)\|≤ 1, with G and K stable rational matrix functions, is proved to be a stable rational matrix function. An explicit state space realization for X is given, and \|X\|∞ turns out to be strictly less than one. The matrices involved in this realization are computed from the matrices appearing in a state space realization of the data functions G and K. A formula for the entropy of X is also given.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.