BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//NA-M-80-03
       ENTRY:: January 28, 1996
ORGANIZATION:: Stanford University, Department of Computer Science, Numerical
               Analysis Project
       TITLE:: Computation of zeros of linear multivariable systems
        TYPE:: Manuscript
      AUTHOR:: Emami-Naeini, Abbas
      AUTHOR:: Van Dooren, Paul M.
        DATE:: July 1980
       PAGES:: 46
    ABSTRACT:: Several algorithms have been proposed in the literature for
               the computation of the zeros of a linear system described by
               a state-space model {$\lambda$I - A,B,C,D}. In this report we
               discuss the numerical properties of a new algorithm and
               compare it with some earlier techniques of computing zeros.
               The new approach to shown to handle both nonsquare and/or
               degenerate systems without difficulties whereas earlier
               methods would either fail or would require special treatment
               fo r these cases. The method is also shown to be backward
               stable in a rigorous sense. Several numerical examples are
               given in order to compare speed and accuracy of the algorithm
               with its nearest competitors.
       NOTES:: [Adminitrivia V1/Prg/19960128]
         END:: STAN//NA-M-80-03