Computation of zeros: a decomposition algorithm for large scale systems

Abstract

In this paper a new graph-theoretic decomposition algorithm for the computation of zeros of large scale systems is presented. If such a decomposition exists, the algorithm divides the computation of zeros in at least m subproblems, where m is equal to the number of inputs and outputs of a square, invertible system. Several examples illustrate the advantages of the proposed algorithm.<>