Design criteria for robust strict positive realness in adaptive schemes

DOI10.1016/0005-1098(94)90153-8MaRDI QIDQ1323770zbMATH OpenOpenAlexFDO

Authors Alberto Tesi, Antonio Vicino, G. Zappa

Publication date 9 March 1995

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0005-1098(94)90153-8

zbMATH Keywords

adaptive controlidentification algorithmstrict positive realnessuncertain polynomials

Mathematics Subject Classification ID

System identification (93B30) Sensitivity (robustness) (93B35) Design techniques (robust design, computer-aided design, etc.) (93B51) Adaptive control/observation systems (93C40)

Review text

The authors investigate the property of a family of polynomials over specific regions of the complex plane, and they give criteria for design of filters ensuring convergence of recursive estimation algorithms in the presence of uncertainty in the plant model. The problem of enlarging the positive realness of the transfer functions in order to improve behaviour of the algorithm in broader operating conditions is treated. Also the problem of minimizing the phase of the transfer function at certain points \(z\) of the complex plane is treated. A geometrical approach for the filter design is given by introducing the lead and lag functions. The uncertainty is assumed to be both structured and unstructured. The latter is given by a bound on the frequency response magnitude, while the former is characterized in terms of regions of polynomial root locations. An analytical solution for a certain class of root location regions is given. A solution to devise a technique for tackling the problem when general regions of root locations are of concern is provided. A numerical example illustrates how the design procedure proposed by the authors can be used to improve the convergence of the recursive adaptive algorithms.

Recommendations

• Enhancing strict positive realness condition on families of polynomials by filter design
• Robust strict positive realness: characterization and construction
• Synthesis of robust strictly positive real systems with l/sub 2/ parametric uncertainty
• Convexity properties of polynomials with assigned root location
• Algebraic solution to the robust SPR problem for two polynomials

Cites work

• Enhancing strict positive realness condition on families of polynomials by filter design
• Examination of the SPR condition in output error parameter estimation
• scientific article; zbMATH DE number 46023 (Why is no real title available?)
• scientific article; zbMATH DE number 46612 (Why is no real title available?)
• Identification/prediction algorithms for armax models with relaxed positive real conditions
• On positive real transfer functions and the convergence of some recursive schemes
• On the estimation of the number of equally likely classes in a population
• Removal of a positive realness condition in minimum variance adaptive regulators by multistep horizons
• Robust strict positive realness: characterization and construction

Cited in

(3)

• Enhancing strict positive realness condition on families of polynomials by filter design
• Convexity properties of polynomials with assigned root location
• Algebraic solution to the robust SPR problem for two polynomials

This page was built for publication: Design criteria for robust strict positive realness in adaptive schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323770)