Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Optimal bounding error algorithms with adaptive tracking capability
By: Deller, J.R.; Nayeri, M.; Liu, M.S.;
1992 / IEEE / 0-8186-3160-0
This item was taken from the IEEE Periodical ' Optimal bounding error algorithms with adaptive tracking capability ' A class of set membership (SM)-based techniques which are of particular interest in applications requiring real-time identification is considered. The optimal bounding ellipsoid (OBE) algorithms are interpreted as a blending of the classical least square error minimization approach with knowledge of bounds on model errors arising from SM considerations. Various adaptive strategies are discussed. It is shown that the adaptive OBE algorithms are more effective in tracking time-varying systems than least squares techniques.<
Optimal Bounding Error Algorithms
Set Membership-based Techniques
Optimal Bounding Ellipsoid
Least Square Error Minimization Approach
Least Squares Methods
Least Squares Approximation
Time Varying Systems
Least Squares Approximations
Adaptive Tracking Capability