An algorithm for computing parameter bounds using prior information on physical parameter bounds

When prior information on plant behaviour are not available, recursive parameter bounding algorithms often use loose initial bounds which may lead to a large final membership sets. Conversely if bounds on some physically meaningful parameters of the dynamical system are available they help to compute prior bounds that can be used as an initial feasible set which accelerate the algorithm convergence and contribute largely to yield a narrower final membership set. In this paper we develop a method which compute the initial feasible set when bounds on the damping factor, the natural pulsation and the steady state gain are available. The computed feasible set is used as initial bounds on polytope updating algorithm. The volume evolution of the feasible set as well as the activity of constraints defining the initial bounds, during updating operation, are compared to the case of loose initial bounds