Generalized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Andreas Varga · elib (German Aerospace Center) · 1994
. Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices: 1) factorizations with least order denominators; 2) factorizations with inner denominators; and 3) factorizations with proper stable factors. The new algorithms are based on a recursive generalized Schur algorithm for pole assignment. They are generally applicable regardless the original descriptor state space representation is minimal or not, or is stabilizable/detectable or not. The proposed algorithms are useful in solving various computational problems for both standard and descriptor system representations. Keywords. Coprime factorization; descriptor systems; pole assignment; numerical algorithms. 1. INTRODUCTION Let G(s) or G(z) be a given p \\Theta m rational transferfunction matrix (TFM) of a linear time-invariant continuoustime or discrete-time descriptor system, respectively, and let G = (E; A; B; C; D) denote an equivalent nth order regu...