Implementing the optimal bounding ellipsoid algorithm on a fast processor

2003 ◽  
Author(s):  
J.R. Deller ◽  
S.F. Odeh
Keyword(s):  
Ellipsoid Algorithm ◽  
Optimal Bounding Ellipsoid

scholarly journals Recursive set membership estimation for output–error fractional models with unknown–but–bounded errors

2016 ◽  
Vol 26 (3) ◽  
pp. 543-553 ◽  
Author(s):  
Messaoud Amairi
Keyword(s):  
A Priori ◽  
Ellipsoid Algorithm ◽  
Fractional Systems ◽  
Output Error ◽  
Set Membership ◽  
Equation Error ◽  
Fractional Models ◽  
Bounded Error ◽  
Optimal Bounding Ellipsoid ◽  
New Formulation

Abstract This paper presents a new formulation for set-membership parameter estimation of fractional systems. In such a context, the error between the measured data and the output model is supposed to be unknown but bounded with a priori known bounds. The bounded error is specified over measurement noise, rather than over an equation error, which is mainly motivated by experimental considerations. The proposed approach is based on the optimal bounding ellipsoid algorithm for linear output-error fractional models. A numerical example is presented to show effectiveness and discuss results.

scholarly journals Sorting under partial information (without the ellipsoid algorithm)

2010 ◽  
Author(s):  
Jean Cardinal ◽  
Samuel Fiorini ◽  
Gwenaël Joret ◽  
Raphaël M. Jungers ◽  
J. Ian Munro
Keyword(s):  
Partial Information ◽  
Ellipsoid Algorithm

The ellipsoid algorithm: A new method for feedback gain optimization

1985 ◽  
Vol 13 ◽  
pp. 85-94 ◽  
Author(s):  
M Kupferschmid ◽  
K Mohrmann ◽  
J.G Ecker ◽  
H Kaufman
Keyword(s):  
New Method ◽  
Feedback Gain ◽  
Ellipsoid Algorithm ◽  
Gain Optimization
Sign in / Sign up

Export Citation Format

Share Document