Dealing with inequalities in polynomial models

Abstract

It is described how set membership identification and model rejection for polynomial models can be described using polynomial inequalities and inequations. Using difference algebra methods these problems can be reduced form based on so called autoreduced sets. It is shown that these descriptions generalize state space descriptions. It is also discussed how special forms of autoreduced sets can make methods based on interval methods easier to implement.