Computation of exact ellipsoidal bounds on the state trajectories of discrete-time linear systems that have time-varying or time-invariant linear fractional parameter uncertainties and ellipsoidal uncertainty in the initial state is known to be NP-hard. This paper proposes three algorithms to compute ellipsoidal bounds on such a state trajectory set and discusses the tradeoffs between computational complexity and conservatism of the algorithms. The approach employs linear matrix inequalities to determine an initial estimate of the ellipsoid that is refined by the subsequent application of the skewed structured singular value ν. Numerical examples are used to illustrate the application of the proposed algorithms and to compare the differences between them, where small conservatism for the tightest bounds is observed.
展开▼
