Computing the maximum robust controlled invariant subspace

Abstract An algorithm is presented to compute the maximum robust controlled invariant subspace contained in a given subspace. It is based on a special computational scheme to derive the intersection of a family of subspaces, which is particularly convenient when the system coefficients depend polynomially on the uncertain parameter. An example is presented to illustrate the algorithm.