A matrix Euclidean algorithm and matrix continued fraction expansions (Q5902772)

\textit{R. E. Kalman} [Acta Polytechn. Scand., Math. Comput. Sci. Ser. 31, 9-32 (1979; Zbl 0424.93020)] as well as \textit{W. B. Gragg} and \textit{A. Lindquist} [Linear Algebra Appl. 50, 277-319 (1983; Zbl 0519.93024)] have taken the Euclidean algorithm as vehicle for producing a nested sequence of partial realizations as well as for obtaining a continued fraction representation of a strictly proper transfer function. In this paper the line of reasoning is reversed. Rather than start with the Euclidean algorithm we start with a very simple idea derived from the Morse-Wonham geometric control theory, namely the knowledge that \(V^{*}_{Ker C}\) is related to maximal McMillan degree reduction by state feedback. Indeed a minimal system is feedback irreducible iff \(V^{^*}_{Ker C}=\{0\}\). Thus feedback irreducible systems provide the atoms needed for the construction of a continued fraction representation, or alternatively for a version of the Euclidean algorithm. Putting things together we obtain a recursive algorithm for the computation of \(V^{*}_{Ker C}\). The dual concept of reduction by output injection is introduced and actually most results are obtained in this setting which is technically simpler. A recursive characterization of \(V_*({\mathcal B})\) is also derived. These characterizations are related through dual direct sum decompositions.