Inner ellipsoidal approximation of membership set: a fast recursive algorithm

In robust system identification the measurement errors are usually assumed to be unknown but bounded, leading to a description of the model parameters in terms of a membership set. Due to the difficulty in obtaining an exact description of this set, in the past several methods have been proposed for its approximation. In the paper a fast recursive algorithm for the determination of an inner ellipsoidal approximation of the membership set is presented