1,721,087 research outputs found
Robust Stability: The Computational Complexity Point of View
No full textAbstractIn this paper, we explore the new and emerging research area of robust stability and study its interplay with computational complexity. Robust stability deals with a family P consisting of all polynomials p(s, q) of fixed order n whose coefficients vary in a set Q ⊂ Rn+1. The main task of robust stability is to detect if all the roots of p(s, q) are contained in a given region D of the complex plane for all q ϵ Q. In the special case when D is the open left half plane and P is a so-called interval polynomial we combine the Theorem of Kharitonov with the Test of Routh and show that the number of elementary operations (multiplications/divisions and additions/subtractions) required for the solution of this problem is at most O(n2)
Optimal algorithms for system identification: a review of recent results
No full textIn this paper we present a review of some recent results for identification of linear dynamic systems in the presence of unknown but bounded uncertainty. We make reference to the optimal algorithms theory which provides a general unifying framework to deal with several typical problems of system identification such as model parameter and state estimation, time series prediction and reduced order model estimation. The min-max optimality concepts pertaining to the optimal algorithms theory can be considered as counterparts to those available in classical standard approaches. We review some aspects of the general theory which make it possible to study properties of both classical standard estimators, such as least squares, and optimal error estimators derived in recent work in the field
SEQUAL: An interactive computer program for sequential classification of biomedical data
No full text
The probability of reversal as a stopping criterion in sequential pattern recognition; results of a simulation study
No full text
- …
