A state-space algorithm for the solution of the 2-block super-optimal distance problem

The authors present a state-space algorithm for the solution of the 2-block super-optimal distance problem (SODP). Conditions are given for which the solution is unique. An a priori upper bound is also given on the MacMillan degree of the solution. The algorithm only requires standard linear algebraic computations, and is easily implemented.<
>