EXACT RECURSIVE CHARACTERIZATION OF FEASIBLE PARAMETER SETS IN THE LINEAR CASE

Set-membership estimation (or parameter bounding) assumes that the error corrupting the data is described only by upper and lower bounds between which its realizations must lie. It aims at providing a description of the set of all parameter vectors that are consistent with the data, error bounds and model structure. For models linear in their parameters, an algorithm that gives an exact recursive characterization of this set is described. The problems raised by the implementation of the method on a computer are considered. Solutions are proposed and discussed. An application of the improved algorithm to a real example is finally presented.