Proving set inclusion via intervals: Application to parametric robust stability
The uncertain parametric model \(M(p)\) with its characteristic polynomial \[ P(p,s)= \alpha _d(p)s^d + \alpha _{d-1}(p)s^{d-1} + \dots + \alpha _1(p)s + \alpha _0(p) \] is studied. The parameter vector \(p\) is only known to belong to some feasible set \(A\). The authors consider the stability problem for \(M(p)\) and formulate it in the form of an inclusion problem \(A\subset B\), where \(B\) is a set of all parameters \(p\) for which the model \(M(p)\) is stable. It is assumed that the sets \(A\), \(B\) are described by nonlinear inequalities. The interval analysis methods are used to construct an algorithm able to prove the above inclusion. The convergence properties are studied and in some cases it is proven that the given algorithm is finite. Two illustrative examples are also given.
This page was built for publication: Proving set inclusion via intervals: Application to parametric robust stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301377)
