Affordable Access

Publisher Website

Rational and polynomial matrix factorizations via recursive pole-zero cancellation

Linear Algebra and its Applications
Publication Date
DOI: 10.1016/0024-3795(90)90144-2
  • Computer Science


Abstract We develop a recursive algorithm for obtaining factorizations of the type R(λ)=R 1(λ)R 2(λ) where all three matrices are rational and R 1(λ) is nonsingular. Moreover the factors R 1(λ) and R 2(λ) are such that either the poles of [ R 1(λ)] -1 and R 2(λ) are in a prescribed region Γ 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(λ) and derives in a recursive fashion the corresponding realizations of the factors.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

Zero cancellation for general rational matrix func...

on Linear Algebra and its Applica... Jan 01, 2009

A polynomial matrix method for computing stable ra...

on Systems & Control Letters Jan 01, 1990

Minimal factorizations of rational matrix function...

on Linear Algebra and its Applica... Jan 01, 1985

Minimal indices cancellation and rank revealing fa...

on Linear Algebra and its Applica... Jan 01, 2009
More articles like this..