An efficient generalized eigenvalue method for computing zeros

In this paper we discuss the numerical properties of a new algorithm for computing the zeros of linear multivariable systems and compare it with some earlier techniques of computing zeros. The new approach can handle both nonsquare and/or degenerate systems without difficulties whereas earlier methods would either fail or would require special treatment for these cases. The method is very efficient and backward stable in a rigorous sense.