Rational and polynomial matrix factorizations via recursive pole-zero cancellation

coprime factorization GCD extraction inner-outer factorization rational and polynomial matrix factorizations recursive algorithm recursive pole-zero cancellation

Mathematics Subject Classification ID

Factorization of matrices (15A23) Matrices over function rings in one or more variables (15A54) Algebraic methods (93B25)

Review text

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.

Recommendations

Cites work

Cited in

(22)

Describes a project that uses

Uses Software

This page was built for publication: Rational and polynomial matrix factorizations via recursive pole-zero cancellation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921084)