Rational and polynomial matrix factorizations via recursive pole-zero cancellation (Q921084): Difference between revisions

A recursive algorithm is developed for obtaining factorizations of the type \(R(\lambda)=R_ 1(\lambda)R_ 2(\lambda)\) where all three matrices are rational and \(R_ 1(\lambda)\) is nonsingular. Moreover the factors \(R_ 1(\lambda)\) and \(R_ 2(\lambda)\) are such that either the poles of \([R_ 1(\lambda)]^{-1}\) and \(R_ 2(\lambda)\) are in a prescribed region \(\Gamma\) of the complex plane, or their zeros. Such factorizations cover the specific cases of coprime factorization, inner-outer factorization, GCD extraction, and many more. The algorithm works on the state-space (or generalized state-space) realization of R(\(\lambda\)) and derives in a recursive fashion the corresponding realizations of the factors.