Computation of algebraic combinations of uncertainty value sets

A robust analysis approach based on the computation of boundaries of uncertainty value sets is presented. The idea is to use the strongly connected subsystem separation and the tree structured decomposition (TSD) concept to extend the class of uncertainty structures to be considered. To this end we compute the exact boundaries of regions produced by operations (+, -, /spl times/, /spl divide/) among boundaries of simply connected value sets, in polynomial time, and without incrementing the total amount of input data. Parametric, dynamic or general multiply connected value set descriptions may be accommodated.<
>