A POLYNOMIAL SOLUTION TO THE SCALAR 4-BLOCK H-INFINITY GENERAL DISTANCE PROBLEM

Citation
A. Casavola et al., A POLYNOMIAL SOLUTION TO THE SCALAR 4-BLOCK H-INFINITY GENERAL DISTANCE PROBLEM, International Journal of Control, 65(1), 1996, pp. 33-52
Citations number
19
Categorie Soggetti
Controlo Theory & Cybernetics","Robotics & Automatic Control
ISSN journal
00207179
Volume
65
Issue
1
Year of publication
1996
Pages
33 - 52
Database
ISI
SICI code
0020-7179(1996)65:1<33:APSTTS>2.0.ZU;2-Q
Abstract
The H-infinity mixed sensitivity with measurement noise problem is con sidered for the scalar case using a polynomial description. The proble m results in a 4-block general distance scalar problem which is solved in a general way by using a polynomial equation approach. As an examp le, the solution is then applied to the mixed sensitivity with measure ment noise problem where all relevant simplifications are carried out. The solution requires solving two spectral factorization problems and one linear polynomial equation. Further, new insight into the connect ions with the Nehari problem is provided.