2017/07/03 by Varga, Andreas
#26C15 #93B40 #93B55 #93C05 #93D15 #FOS: Electrical engineering #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · doi:10.48550/arxiv.1707.00489
We discuss computational procedures based on descriptor state-space realizations to compute proper range space bases of rational matrices. The main computation is the orthogonal reduction of the system matrix pencil to a special Kronecker-like form, which allows to extract a full column rank factor, whose columns form a proper rational basis of the range space. The computation of several types of bases can be easily accommodated, such as minimum-degree bases, stable inner minimum-degree bases, etc. Several straightforward applications of the range space basis computation are discussed, such as, the computation of full rank factorizations, normalized coprime factorizations, pseudo-inverses, and inner-outer factorizations.