By Topic

An optimal volume ellipsoid algorithm for parameter set estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cheung, Man-Fung ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; Yurkovich, S. ; Passino, K.M.

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

Published in:

Automatic Control, IEEE Transactions on  (Volume:38 ,  Issue: 8 )