Abstract
A recursive ellipsoid algorithm is derived for estimating the parameter set of a single-input single-output linear time-invariant system with bounded noise. The algorithm's objective is to seek the minimal volume ellipsoid bounding the feasible parameter set. Cast in a recursive framework, where a minimal volume ellipsoid results at each recursion, the algorithm extends a result due to Khachian (see Aspvall and Stone, 1980) in which a technique was developed to solve a class of linear programming problems. This extension and application to the parameter set estimation problem have intuitive geometric appeal and are easy to implement. Comparisons are made to the optimal bounding ellipsoid algorithm of Fogel and Huang (1982), and the results are demonstrated through computer simulations. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
