MIMO Robust Control Homework
Q1. Find a right co-prime matrix fraction description (MFD) for the system

How many inputs and outputs does this system have? For the co-prime right MFD, find X(s) and Y(s) such that the Bezout identity holds,
X(s)N(s) + Y(s)D(s) = I. (1)
Q2. Find a right co-prime matrix fraction description (MFD) for the system

How many inputs and outputs does this system have? For the co-prime right MFD, find X(s) and Y(s) such that the Bezout identity in Eq. (1) holds.
Q3. Let
G(s) = N(s)D(s)-1 (2)
where

Compute right and left co-prime MFDs and a greatest common right divisor (gcrd). Show that the gcrd is unimodular.
Q4. Consider G(s) as in Eq. (2) with

Compute right and left co-prime MFDs and a greatest common right divisor. Show that the gcrd is unimodular.
Q5. Consider G(s) as in Eq. (2) with

Compute right and left co-prime MFDs and a greatest common right divisor. Show that the gcrd is unimodular.