The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper a very simple algorithm is given to find the largest stability boxes in the coefficient space centered at a stable polynomial. We first establish an optimality property of Kharitonov polynomials [1], namely that the closest point to instability over a stable box lies at one of the Kharitonov vertices. This property naturally leads to the algorithm.
The techniques of nuclear operators and duality theory are applied to the problem of time-varying control of time-invariant systems. In this paper the problem of assessing the advatages of time-varying compensation will be studied using operator theoretic methods. In specific, the problems of disturbance rejection, H2, and H2/H??, will be analyzed.
The techniques of nuclear operators and duality theory are applied to the problem of time-varying control of time-invariant systems. In this paper the problem of assessing the advantages of time-varying compensation will be studied using operator theoretic methods. In specific, the problems of disturbance rejection, H2, and H2/H?? will be analyzed.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.