Computation of structural system properties, integer matrices, and Bipartite Graphs

Abstract

The computation of the McMillan degree and structure at infinity for large scale uncertain models of the type known as Structural Transfer Functions (STF) have been shown to be equivalent to determining the maximal weight of associated integer matrices. These problems are equivalent to the class of “Optimal Assignment Problems” developed for the family of resource allocation studies. A new algorithm that exploits notions of “reduceness” of integer matrices and the notions of Bipartite Graphs associated with them is presented here. The complexity of the algorithm is examined and its performance with respect to known optimal assignment methods is considered in terms of features and demonstrated by examples.