Computation of Zeros of Linear Multivariable Systems

Several algorithms have been proposed in the literature for the computation of the zeros of a linear system described by a state-space model {A, B, C, D}. In this paper we discuss the numerical properties of a new algorithm and compare it with some earlier techniques of computing zeros. The method is a modified version of Silverman's structure algorithm and is shown to be backward stable in a rigorous sense. The approach is shown to handle both nonsquare and/or degenerate systems. Several numerical examples are also provided